/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-OGIterative-CovSimpl-Hitting.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix005_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 15:06:18,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 15:06:18,634 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 15:06:18,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 15:06:18,664 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 15:06:18,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 15:06:18,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 15:06:18,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 15:06:18,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 15:06:18,678 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 15:06:18,679 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 15:06:18,680 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 15:06:18,680 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 15:06:18,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 15:06:18,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 15:06:18,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 15:06:18,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 15:06:18,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 15:06:18,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 15:06:18,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 15:06:18,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 15:06:18,698 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 15:06:18,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 15:06:18,700 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 15:06:18,714 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 15:06:18,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 15:06:18,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 15:06:18,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 15:06:18,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 15:06:18,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 15:06:18,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 15:06:18,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 15:06:18,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 15:06:18,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 15:06:18,730 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 15:06:18,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 15:06:18,731 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 15:06:18,731 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 15:06:18,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 15:06:18,732 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 15:06:18,733 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 15:06:18,736 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-OGIterative-CovSimpl-Hitting.epf [2021-08-13 15:06:18,765 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 15:06:18,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 15:06:18,769 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 15:06:18,769 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 15:06:18,769 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 15:06:18,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 15:06:18,769 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 15:06:18,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 15:06:18,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 15:06:18,770 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 15:06:18,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 15:06:18,771 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 15:06:18,771 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 15:06:18,771 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 15:06:18,771 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 15:06:18,771 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 15:06:18,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 15:06:18,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 15:06:18,772 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 15:06:18,772 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 15:06:18,772 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 15:06:18,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 15:06:18,772 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 15:06:18,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 15:06:18,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 15:06:18,773 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 15:06:18,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 15:06:18,773 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 15:06:18,773 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 15:06:18,773 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 15:06:18,773 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 15:06:18,773 INFO L138 SettingsManager]: * Use hitting sets in computation of OwickiGries annotation=true [2021-08-13 15:06:18,773 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-13 15:06:18,774 INFO L138 SettingsManager]: * Simplify away covered predicates in OwickiGries annotation=true 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-13 15:06:19,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 15:06:19,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 15:06:19,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 15:06:19,061 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 15:06:19,062 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 15:06:19,062 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix005_pso.oepc.i [2021-08-13 15:06:19,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042ea62a1/9f2e4a8e381f4f2dba6711b8e96c3ee6/FLAGf8dd18e35 [2021-08-13 15:06:19,547 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 15:06:19,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix005_pso.oepc.i [2021-08-13 15:06:19,560 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042ea62a1/9f2e4a8e381f4f2dba6711b8e96c3ee6/FLAGf8dd18e35 [2021-08-13 15:06:19,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042ea62a1/9f2e4a8e381f4f2dba6711b8e96c3ee6 [2021-08-13 15:06:19,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 15:06:19,882 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 15:06:19,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 15:06:19,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 15:06:19,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 15:06:19,889 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 03:06:19" (1/1) ... [2021-08-13 15:06:19,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24da950b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:19, skipping insertion in model container [2021-08-13 15:06:19,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 03:06:19" (1/1) ... [2021-08-13 15:06:19,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 15:06:19,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 15:06:20,064 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/mix005_pso.oepc.i[949,962] [2021-08-13 15:06:20,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 15:06:20,257 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 15:06:20,270 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/mix005_pso.oepc.i[949,962] [2021-08-13 15:06:20,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 15:06:20,344 INFO L208 MainTranslator]: Completed translation [2021-08-13 15:06:20,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20 WrapperNode [2021-08-13 15:06:20,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 15:06:20,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 15:06:20,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 15:06:20,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 15:06:20,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20" (1/1) ... [2021-08-13 15:06:20,362 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20" (1/1) ... [2021-08-13 15:06:20,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 15:06:20,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 15:06:20,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 15:06:20,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 15:06:20,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20" (1/1) ... [2021-08-13 15:06:20,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20" (1/1) ... [2021-08-13 15:06:20,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20" (1/1) ... [2021-08-13 15:06:20,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20" (1/1) ... [2021-08-13 15:06:20,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20" (1/1) ... [2021-08-13 15:06:20,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20" (1/1) ... [2021-08-13 15:06:20,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20" (1/1) ... [2021-08-13 15:06:20,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 15:06:20,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 15:06:20,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 15:06:20,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 15:06:20,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20" (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-13 15:06:20,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 15:06:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 15:06:20,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 15:06:20,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 15:06:20,505 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 15:06:20,505 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 15:06:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 15:06:20,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 15:06:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 15:06:20,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 15:06:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-13 15:06:20,506 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-13 15:06:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 15:06:20,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 15:06:20,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 15:06:20,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 15:06:20,508 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 15:06:22,104 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 15:06:22,104 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 15:06:22,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:06:22 BoogieIcfgContainer [2021-08-13 15:06:22,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 15:06:22,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 15:06:22,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 15:06:22,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 15:06:22,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 03:06:19" (1/3) ... [2021-08-13 15:06:22,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23072d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 03:06:22, skipping insertion in model container [2021-08-13 15:06:22,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 03:06:20" (2/3) ... [2021-08-13 15:06:22,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23072d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 03:06:22, skipping insertion in model container [2021-08-13 15:06:22,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 03:06:22" (3/3) ... [2021-08-13 15:06:22,110 INFO L111 eAbstractionObserver]: Analyzing ICFG mix005_pso.oepc.i [2021-08-13 15:06:22,115 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 15:06:22,115 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 15:06:22,116 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 15:06:22,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,144 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,144 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,144 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,144 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,144 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,145 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,149 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,149 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,149 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,150 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,150 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,150 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,152 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,154 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,155 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,156 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,157 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,157 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,157 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,158 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,158 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,158 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,159 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,160 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,161 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,162 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,163 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,168 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,169 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,170 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,177 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,178 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,178 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,178 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,178 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,179 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,180 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,180 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,182 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,183 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,183 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,184 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,184 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,185 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,187 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,188 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,189 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,196 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,197 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,199 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,199 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 15:06:22,200 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 15:06:22,217 INFO L255 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-13 15:06:22,237 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 15:06:22,237 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 15:06:22,237 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 15:06:22,237 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 15:06:22,237 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 15:06:22,237 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 15:06:22,237 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 15:06:22,237 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 15:06:22,248 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2021-08-13 15:06:22,295 INFO L129 PetriNetUnfolder]: 2/128 cut-off events. [2021-08-13 15:06:22,295 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:06:22,298 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 78 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2021-08-13 15:06:22,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2021-08-13 15:06:22,311 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2021-08-13 15:06:22,325 INFO L129 PetriNetUnfolder]: 0/49 cut-off events. [2021-08-13 15:06:22,325 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:06:22,325 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:06:22,326 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] [2021-08-13 15:06:22,326 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:06:22,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:06:22,330 INFO L82 PathProgramCache]: Analyzing trace with hash 191754456, now seen corresponding path program 1 times [2021-08-13 15:06:22,335 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:06:22,335 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914548748] [2021-08-13 15:06:22,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:06:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:06:22,561 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:22,562 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:22,563 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:22,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:06:22,574 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-13 15:06:22,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:06:22,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914548748] [2021-08-13 15:06:22,575 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914548748] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:06:22,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:06:22,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 15:06:22,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910989234] [2021-08-13 15:06:22,581 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 15:06:22,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:06:22,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 15:06:22,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 15:06:22,593 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 132 [2021-08-13 15:06:22,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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-13 15:06:22,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:06:22,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 132 [2021-08-13 15:06:22,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:06:22,783 INFO L129 PetriNetUnfolder]: 133/489 cut-off events. [2021-08-13 15:06:22,783 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 15:06:22,786 INFO L84 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 489 events. 133/489 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2608 event pairs, 110 based on Foata normal form. 49/508 useless extension candidates. Maximal degree in co-relation 653. Up to 153 conditions per place. [2021-08-13 15:06:22,789 INFO L132 encePairwiseOnDemand]: 127/132 looper letters, 11 selfloop transitions, 2 changer transitions 0/129 dead transitions. [2021-08-13 15:06:22,789 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 129 transitions, 296 flow [2021-08-13 15:06:22,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 15:06:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 15:06:22,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2021-08-13 15:06:22,798 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9545454545454546 [2021-08-13 15:06:22,798 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2021-08-13 15:06:22,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2021-08-13 15:06:22,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:06:22,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2021-08-13 15:06:22,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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-13 15:06:22,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 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-13 15:06:22,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 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-13 15:06:22,812 INFO L348 CegarLoopForPetriNet]: 139 programPoint places, 0 predicate places. [2021-08-13 15:06:22,812 INFO L482 AbstractCegarLoop]: Abstraction has has 139 places, 129 transitions, 296 flow [2021-08-13 15:06:22,813 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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-13 15:06:22,815 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:06:22,815 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] [2021-08-13 15:06:22,815 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 15:06:22,815 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:06:22,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:06:22,816 INFO L82 PathProgramCache]: Analyzing trace with hash 822261494, now seen corresponding path program 1 times [2021-08-13 15:06:22,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:06:22,816 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344229932] [2021-08-13 15:06:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:06:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:06:22,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:22,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:22,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:22,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:06:22,955 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-08-13 15:06:22,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-13 15:06:22,972 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:06:22,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:06:22,986 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:22,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:22,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:22,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:23,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:23,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:23,006 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-13 15:06:23,007 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:06:23,007 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344229932] [2021-08-13 15:06:23,008 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344229932] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:06:23,008 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:06:23,008 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:06:23,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112921975] [2021-08-13 15:06:23,009 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:06:23,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:06:23,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:06:23,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:06:23,011 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2021-08-13 15:06:23,011 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 129 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 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-13 15:06:23,011 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:06:23,011 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2021-08-13 15:06:23,012 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:06:25,036 INFO L129 PetriNetUnfolder]: 4457/12627 cut-off events. [2021-08-13 15:06:25,036 INFO L130 PetriNetUnfolder]: For 984/1648 co-relation queries the response was YES. [2021-08-13 15:06:25,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20939 conditions, 12627 events. 4457/12627 cut-off events. For 984/1648 co-relation queries the response was YES. Maximal size of possible extension queue 780. Compared 144162 event pairs, 1561 based on Foata normal form. 39/11570 useless extension candidates. Maximal degree in co-relation 20876. Up to 3079 conditions per place. [2021-08-13 15:06:25,139 INFO L132 encePairwiseOnDemand]: 118/132 looper letters, 65 selfloop transitions, 36 changer transitions 3/212 dead transitions. [2021-08-13 15:06:25,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 212 transitions, 690 flow [2021-08-13 15:06:25,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 15:06:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 15:06:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1520 transitions. [2021-08-13 15:06:25,145 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8857808857808858 [2021-08-13 15:06:25,145 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1520 transitions. [2021-08-13 15:06:25,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1520 transitions. [2021-08-13 15:06:25,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:06:25,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1520 transitions. [2021-08-13 15:06:25,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.92307692307692) internal successors, (1520), 13 states have internal predecessors, (1520), 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-13 15:06:25,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 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-13 15:06:25,153 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 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-13 15:06:25,153 INFO L348 CegarLoopForPetriNet]: 139 programPoint places, 12 predicate places. [2021-08-13 15:06:25,153 INFO L482 AbstractCegarLoop]: Abstraction has has 151 places, 212 transitions, 690 flow [2021-08-13 15:06:25,154 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 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-13 15:06:25,154 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:06:25,154 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] [2021-08-13 15:06:25,154 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 15:06:25,154 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:06:25,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:06:25,155 INFO L82 PathProgramCache]: Analyzing trace with hash -109410402, now seen corresponding path program 1 times [2021-08-13 15:06:25,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:06:25,155 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235852944] [2021-08-13 15:06:25,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:06:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:06:25,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:25,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:25,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:25,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:06:25,275 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-08-13 15:06:25,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-13 15:06:25,288 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:06:25,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:06:25,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:25,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:25,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:25,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:25,319 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:25,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:25,321 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-13 15:06:25,321 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:06:25,321 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235852944] [2021-08-13 15:06:25,321 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235852944] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:06:25,321 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:06:25,321 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:06:25,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376899296] [2021-08-13 15:06:25,322 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:06:25,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:06:25,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:06:25,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:06:25,323 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2021-08-13 15:06:25,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 212 transitions, 690 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 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-13 15:06:25,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:06:25,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2021-08-13 15:06:25,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:06:28,260 INFO L129 PetriNetUnfolder]: 7255/21320 cut-off events. [2021-08-13 15:06:28,260 INFO L130 PetriNetUnfolder]: For 2647/6565 co-relation queries the response was YES. [2021-08-13 15:06:28,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42835 conditions, 21320 events. 7255/21320 cut-off events. For 2647/6565 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 269442 event pairs, 1947 based on Foata normal form. 68/19696 useless extension candidates. Maximal degree in co-relation 42764. Up to 5064 conditions per place. [2021-08-13 15:06:28,464 INFO L132 encePairwiseOnDemand]: 120/132 looper letters, 197 selfloop transitions, 125 changer transitions 15/445 dead transitions. [2021-08-13 15:06:28,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 445 transitions, 2374 flow [2021-08-13 15:06:28,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 15:06:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 15:06:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1520 transitions. [2021-08-13 15:06:28,468 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8857808857808858 [2021-08-13 15:06:28,468 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1520 transitions. [2021-08-13 15:06:28,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1520 transitions. [2021-08-13 15:06:28,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:06:28,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1520 transitions. [2021-08-13 15:06:28,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.92307692307692) internal successors, (1520), 13 states have internal predecessors, (1520), 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-13 15:06:28,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 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-13 15:06:28,475 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 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-13 15:06:28,475 INFO L348 CegarLoopForPetriNet]: 139 programPoint places, 24 predicate places. [2021-08-13 15:06:28,476 INFO L482 AbstractCegarLoop]: Abstraction has has 163 places, 445 transitions, 2374 flow [2021-08-13 15:06:28,476 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 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-13 15:06:28,476 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:06:28,476 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] [2021-08-13 15:06:28,476 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 15:06:28,477 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:06:28,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:06:28,477 INFO L82 PathProgramCache]: Analyzing trace with hash -59878972, now seen corresponding path program 1 times [2021-08-13 15:06:28,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:06:28,477 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737483993] [2021-08-13 15:06:28,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:06:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:06:28,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:28,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:28,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:28,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:06:28,590 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:06:28,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:06:28,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:28,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:28,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:28,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:28,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:28,620 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:28,623 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-13 15:06:28,623 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:06:28,623 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737483993] [2021-08-13 15:06:28,624 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737483993] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:06:28,624 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:06:28,624 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:06:28,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986311315] [2021-08-13 15:06:28,625 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:06:28,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:06:28,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:06:28,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:06:28,627 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 132 [2021-08-13 15:06:28,628 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 445 transitions, 2374 flow. Second operand has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 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-13 15:06:28,628 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:06:28,628 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 132 [2021-08-13 15:06:28,628 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:06:33,635 INFO L129 PetriNetUnfolder]: 12076/35834 cut-off events. [2021-08-13 15:06:33,635 INFO L130 PetriNetUnfolder]: For 6590/11727 co-relation queries the response was YES. [2021-08-13 15:06:33,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77801 conditions, 35834 events. 12076/35834 cut-off events. For 6590/11727 co-relation queries the response was YES. Maximal size of possible extension queue 2557. Compared 492691 event pairs, 2990 based on Foata normal form. 53/32936 useless extension candidates. Maximal degree in co-relation 77727. Up to 8619 conditions per place. [2021-08-13 15:06:33,886 INFO L132 encePairwiseOnDemand]: 125/132 looper letters, 193 selfloop transitions, 81 changer transitions 136/681 dead transitions. [2021-08-13 15:06:33,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 681 transitions, 4580 flow [2021-08-13 15:06:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 15:06:33,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 15:06:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1106 transitions. [2021-08-13 15:06:33,889 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.930976430976431 [2021-08-13 15:06:33,889 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1106 transitions. [2021-08-13 15:06:33,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1106 transitions. [2021-08-13 15:06:33,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:06:33,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1106 transitions. [2021-08-13 15:06:33,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.88888888888889) internal successors, (1106), 9 states have internal predecessors, (1106), 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-13 15:06:33,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 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-13 15:06:33,893 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 132.0) internal successors, (1320), 10 states have internal predecessors, (1320), 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-13 15:06:33,893 INFO L348 CegarLoopForPetriNet]: 139 programPoint places, 32 predicate places. [2021-08-13 15:06:33,893 INFO L482 AbstractCegarLoop]: Abstraction has has 171 places, 681 transitions, 4580 flow [2021-08-13 15:06:33,894 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 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-13 15:06:33,894 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:06:33,894 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] [2021-08-13 15:06:33,894 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 15:06:33,894 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:06:33,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:06:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1187955329, now seen corresponding path program 1 times [2021-08-13 15:06:33,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:06:33,895 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401511627] [2021-08-13 15:06:33,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:06:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:06:33,933 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:33,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:33,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:33,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:06:33,937 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:06:33,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:06:33,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:33,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:06:33,959 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:06:33,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:33,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:33,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:33,967 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-13 15:06:33,967 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:06:33,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401511627] [2021-08-13 15:06:33,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401511627] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:06:33,967 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:06:33,967 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 15:06:33,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916822340] [2021-08-13 15:06:33,968 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 15:06:33,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:06:33,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 15:06:33,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 15:06:33,969 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2021-08-13 15:06:33,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 681 transitions, 4580 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 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-13 15:06:33,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:06:33,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2021-08-13 15:06:33,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:06:39,550 INFO L129 PetriNetUnfolder]: 12912/39794 cut-off events. [2021-08-13 15:06:39,550 INFO L130 PetriNetUnfolder]: For 4859/6613 co-relation queries the response was YES. [2021-08-13 15:06:39,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84218 conditions, 39794 events. 12912/39794 cut-off events. For 4859/6613 co-relation queries the response was YES. Maximal size of possible extension queue 2022. Compared 555641 event pairs, 2102 based on Foata normal form. 10/37250 useless extension candidates. Maximal degree in co-relation 84141. Up to 5901 conditions per place. [2021-08-13 15:06:39,891 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 29 selfloop transitions, 20 changer transitions 58/610 dead transitions. [2021-08-13 15:06:39,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 610 transitions, 3888 flow [2021-08-13 15:06:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 15:06:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 15:06:39,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1221 transitions. [2021-08-13 15:06:39,894 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.925 [2021-08-13 15:06:39,894 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1221 transitions. [2021-08-13 15:06:39,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1221 transitions. [2021-08-13 15:06:39,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:06:39,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1221 transitions. [2021-08-13 15:06:39,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.1) internal successors, (1221), 10 states have internal predecessors, (1221), 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-13 15:06:39,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 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-13 15:06:39,902 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 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-13 15:06:39,902 INFO L348 CegarLoopForPetriNet]: 139 programPoint places, 41 predicate places. [2021-08-13 15:06:39,902 INFO L482 AbstractCegarLoop]: Abstraction has has 180 places, 610 transitions, 3888 flow [2021-08-13 15:06:39,902 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 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-13 15:06:39,902 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:06:39,902 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, 1, 1] [2021-08-13 15:06:39,902 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 15:06:39,903 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:06:39,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:06:39,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2104103170, now seen corresponding path program 1 times [2021-08-13 15:06:39,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:06:39,903 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337181370] [2021-08-13 15:06:39,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:06:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:06:39,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:39,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:39,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:39,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:06:39,981 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-08-13 15:06:39,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-13 15:06:39,993 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:06:39,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:06:40,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:40,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:40,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:40,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:40,020 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:40,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:40,021 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-13 15:06:40,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:06:40,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337181370] [2021-08-13 15:06:40,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337181370] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:06:40,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:06:40,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:06:40,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282013519] [2021-08-13 15:06:40,023 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:06:40,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:06:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:06:40,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:06:40,028 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 132 [2021-08-13 15:06:40,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 610 transitions, 3888 flow. Second operand has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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-13 15:06:40,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:06:40,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 132 [2021-08-13 15:06:40,029 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:06:49,099 INFO L129 PetriNetUnfolder]: 19484/62469 cut-off events. [2021-08-13 15:06:49,099 INFO L130 PetriNetUnfolder]: For 11297/18419 co-relation queries the response was YES. [2021-08-13 15:06:49,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146987 conditions, 62469 events. 19484/62469 cut-off events. For 11297/18419 co-relation queries the response was YES. Maximal size of possible extension queue 3517. Compared 948074 event pairs, 3660 based on Foata normal form. 139/58656 useless extension candidates. Maximal degree in co-relation 146902. Up to 9424 conditions per place. [2021-08-13 15:06:49,661 INFO L132 encePairwiseOnDemand]: 119/132 looper letters, 544 selfloop transitions, 121 changer transitions 190/1000 dead transitions. [2021-08-13 15:06:49,661 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1000 transitions, 8346 flow [2021-08-13 15:06:49,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 15:06:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 15:06:49,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1169 transitions. [2021-08-13 15:06:49,679 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8856060606060606 [2021-08-13 15:06:49,679 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1169 transitions. [2021-08-13 15:06:49,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1169 transitions. [2021-08-13 15:06:49,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:06:49,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1169 transitions. [2021-08-13 15:06:49,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.9) internal successors, (1169), 10 states have internal predecessors, (1169), 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-13 15:06:49,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 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-13 15:06:49,683 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 132.0) internal successors, (1452), 11 states have internal predecessors, (1452), 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-13 15:06:49,683 INFO L348 CegarLoopForPetriNet]: 139 programPoint places, 50 predicate places. [2021-08-13 15:06:49,684 INFO L482 AbstractCegarLoop]: Abstraction has has 189 places, 1000 transitions, 8346 flow [2021-08-13 15:06:49,684 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 111.14285714285714) internal successors, (778), 7 states have internal predecessors, (778), 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-13 15:06:49,684 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:06:49,684 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, 1, 1] [2021-08-13 15:06:49,684 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 15:06:49,684 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:06:49,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:06:49,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1110600762, now seen corresponding path program 1 times [2021-08-13 15:06:49,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:06:49,685 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619939660] [2021-08-13 15:06:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:06:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:06:49,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:49,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:49,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:49,723 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:06:49,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:49,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:06:49,731 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:06:49,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:06:49,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:49,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:06:49,750 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:06:49,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:49,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:49,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:49,758 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-13 15:06:49,758 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:06:49,758 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619939660] [2021-08-13 15:06:49,758 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619939660] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:06:49,758 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:06:49,758 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 15:06:49,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241380367] [2021-08-13 15:06:49,759 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 15:06:49,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:06:49,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 15:06:49,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 15:06:49,760 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2021-08-13 15:06:49,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 1000 transitions, 8346 flow. Second operand has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 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-13 15:06:49,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:06:49,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2021-08-13 15:06:49,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:06:54,104 INFO L129 PetriNetUnfolder]: 8489/28403 cut-off events. [2021-08-13 15:06:54,104 INFO L130 PetriNetUnfolder]: For 4932/14879 co-relation queries the response was YES. [2021-08-13 15:06:54,274 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70571 conditions, 28403 events. 8489/28403 cut-off events. For 4932/14879 co-relation queries the response was YES. Maximal size of possible extension queue 1816. Compared 388410 event pairs, 679 based on Foata normal form. 1818/28465 useless extension candidates. Maximal degree in co-relation 70483. Up to 5539 conditions per place. [2021-08-13 15:06:54,333 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 52 selfloop transitions, 54 changer transitions 263/729 dead transitions. [2021-08-13 15:06:54,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 729 transitions, 5710 flow [2021-08-13 15:06:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 15:06:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 15:06:54,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1589 transitions. [2021-08-13 15:06:54,337 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.925990675990676 [2021-08-13 15:06:54,337 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1589 transitions. [2021-08-13 15:06:54,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1589 transitions. [2021-08-13 15:06:54,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:06:54,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1589 transitions. [2021-08-13 15:06:54,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 122.23076923076923) internal successors, (1589), 13 states have internal predecessors, (1589), 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-13 15:06:54,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 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-13 15:06:54,344 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 132.0) internal successors, (1848), 14 states have internal predecessors, (1848), 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-13 15:06:54,344 INFO L348 CegarLoopForPetriNet]: 139 programPoint places, 62 predicate places. [2021-08-13 15:06:54,344 INFO L482 AbstractCegarLoop]: Abstraction has has 201 places, 729 transitions, 5710 flow [2021-08-13 15:06:54,345 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 118.14285714285714) internal successors, (827), 7 states have internal predecessors, (827), 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-13 15:06:54,345 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:06:54,345 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, 1, 1, 1, 1, 1] [2021-08-13 15:06:54,345 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 15:06:54,345 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:06:54,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:06:54,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1851027997, now seen corresponding path program 1 times [2021-08-13 15:06:54,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:06:54,345 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583854490] [2021-08-13 15:06:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:06:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:06:54,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:54,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:54,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:54,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:06:54,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:54,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:06:54,398 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-08-13 15:06:54,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-08-13 15:06:54,408 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 15:06:54,409 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 15:06:54,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:54,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:54,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:54,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:06:54,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:06:54,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:06:54,437 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-13 15:06:54,438 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:06:54,438 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583854490] [2021-08-13 15:06:54,438 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583854490] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:06:54,438 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:06:54,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 15:06:54,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542079310] [2021-08-13 15:06:54,438 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 15:06:54,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:06:54,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 15:06:54,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-13 15:06:54,439 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 132 [2021-08-13 15:06:54,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 729 transitions, 5710 flow. Second operand has 8 states, 8 states have (on average 109.375) internal successors, (875), 8 states have internal predecessors, (875), 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-13 15:06:54,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:06:54,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 132 [2021-08-13 15:06:54,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:06:55,161 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1111] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~a~0=v_~a~0_154, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_2|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, P2Thread1of1ForFork0_#t~ite19][96], [259#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0)), 199#true, 235#(= ~x~0 1), 140#true, 142#true, 175#true, 79#L854true, 144#true, 146#true, 147#true, 277#(= ~y~0 1), 151#true, 123#L775true, 92#L878-3true, 29#L818true, 223#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0)), 31#L795true]) [2021-08-13 15:06:55,161 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2021-08-13 15:06:55,161 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-08-13 15:06:55,161 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-08-13 15:06:55,161 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-08-13 15:06:58,359 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1111] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~a~0=v_~a~0_154, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_2|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, P2Thread1of1ForFork0_#t~ite19][96], [199#true, 39#L798true, 73#L778true, 235#(= ~x~0 1), 140#true, 142#true, 175#true, 79#L854true, 144#true, 146#true, 147#true, 277#(= ~y~0 1), 151#true, 87#L889true, 216#true, 251#true, 29#L818true]) [2021-08-13 15:06:58,360 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,360 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,360 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,360 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,693 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1111] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~a~0=v_~a~0_154, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_2|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, P2Thread1of1ForFork0_#t~ite19][96], [39#L798true, 199#true, 73#L778true, 235#(= ~x~0 1), 140#true, 142#true, 175#true, 79#L854true, 144#true, 146#true, 147#true, 277#(= ~y~0 1), 87#L889true, 151#true, 216#true, 251#true, 29#L818true]) [2021-08-13 15:06:58,694 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,694 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,694 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,694 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,694 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,710 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1111] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~a~0=v_~a~0_154, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_2|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, P2Thread1of1ForFork0_#t~ite19][96], [134#L857true, 199#true, 73#L778true, 235#(= ~x~0 1), 140#true, 142#true, 175#true, 144#true, 146#true, 147#true, 277#(= ~y~0 1), 87#L889true, 151#true, 216#true, 251#true, 29#L818true, 31#L795true]) [2021-08-13 15:06:58,710 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,710 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,710 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,710 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,827 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1111] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~a~0=v_~a~0_154, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_2|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, P2Thread1of1ForFork0_#t~ite19][96], [134#L857true, 39#L798true, 199#true, 235#(= ~x~0 1), 140#true, 142#true, 175#true, 144#true, 146#true, 147#true, 277#(= ~y~0 1), 87#L889true, 151#true, 216#true, 123#L775true, 251#true, 29#L818true]) [2021-08-13 15:06:58,828 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,828 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,828 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:58,828 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2021-08-13 15:06:59,263 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1111] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~a~0=v_~a~0_154, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_2|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, P2Thread1of1ForFork0_#t~ite19][96], [134#L857true, 39#L798true, 199#true, 73#L778true, 235#(= ~x~0 1), 140#true, 142#true, 175#true, 144#true, 146#true, 147#true, 277#(= ~y~0 1), 87#L889true, 151#true, 216#true, 251#true, 29#L818true]) [2021-08-13 15:06:59,264 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2021-08-13 15:06:59,264 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-08-13 15:06:59,264 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-08-13 15:06:59,264 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-08-13 15:06:59,397 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1048] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_2 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 1) (= v_~__unbuffered_p3_EBX~0_2 0) (= v_~__unbuffered_p3_EAX~0_2 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][302], [96#L811true, 134#L857true, 39#L798true, 199#true, 140#true, 142#true, 175#true, 144#true, 81#L892true, 241#(and (<= 1 ~main$tmp_guard1~0) (= ~x~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 146#true, 147#true, 277#(= ~y~0 1), 151#true, 216#true, 123#L775true, 251#true]) [2021-08-13 15:06:59,397 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is not cut-off event [2021-08-13 15:06:59,398 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-08-13 15:06:59,398 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-08-13 15:06:59,398 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-08-13 15:06:59,618 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1048] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_2 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 1) (= v_~__unbuffered_p3_EBX~0_2 0) (= v_~__unbuffered_p3_EAX~0_2 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][302], [96#L811true, 134#L857true, 199#true, 39#L798true, 73#L778true, 140#true, 142#true, 175#true, 144#true, 81#L892true, 241#(and (<= 1 ~main$tmp_guard1~0) (= ~x~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 146#true, 147#true, 277#(= ~y~0 1), 151#true, 216#true, 251#true]) [2021-08-13 15:06:59,619 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is not cut-off event [2021-08-13 15:06:59,619 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-08-13 15:06:59,619 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-08-13 15:06:59,619 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-08-13 15:07:01,806 INFO L129 PetriNetUnfolder]: 16009/51863 cut-off events. [2021-08-13 15:07:01,806 INFO L130 PetriNetUnfolder]: For 16390/30653 co-relation queries the response was YES. [2021-08-13 15:07:02,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 137376 conditions, 51863 events. 16009/51863 cut-off events. For 16390/30653 co-relation queries the response was YES. Maximal size of possible extension queue 3368. Compared 766159 event pairs, 1239 based on Foata normal form. 140/48780 useless extension candidates. Maximal degree in co-relation 137279. Up to 10616 conditions per place. [2021-08-13 15:07:02,244 INFO L132 encePairwiseOnDemand]: 115/132 looper letters, 371 selfloop transitions, 173 changer transitions 642/1386 dead transitions. [2021-08-13 15:07:02,244 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 1386 transitions, 14176 flow [2021-08-13 15:07:02,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-08-13 15:07:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-08-13 15:07:02,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2410 transitions. [2021-08-13 15:07:02,248 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8694083694083694 [2021-08-13 15:07:02,248 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2410 transitions. [2021-08-13 15:07:02,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2410 transitions. [2021-08-13 15:07:02,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:07:02,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2410 transitions. [2021-08-13 15:07:02,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 114.76190476190476) internal successors, (2410), 21 states have internal predecessors, (2410), 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-13 15:07:02,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 132.0) internal successors, (2904), 22 states have internal predecessors, (2904), 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-13 15:07:02,255 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 132.0) internal successors, (2904), 22 states have internal predecessors, (2904), 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-13 15:07:02,256 INFO L348 CegarLoopForPetriNet]: 139 programPoint places, 82 predicate places. [2021-08-13 15:07:02,256 INFO L482 AbstractCegarLoop]: Abstraction has has 221 places, 1386 transitions, 14176 flow [2021-08-13 15:07:02,256 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 109.375) internal successors, (875), 8 states have internal predecessors, (875), 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-13 15:07:02,256 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:07:02,256 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, 1, 1, 1, 1, 1] [2021-08-13 15:07:02,256 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 15:07:02,256 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:07:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:07:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash 148045451, now seen corresponding path program 2 times [2021-08-13 15:07:02,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:07:02,257 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031515455] [2021-08-13 15:07:02,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:07:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:07:02,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:02,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:07:02,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:02,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:07:02,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:02,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:07:02,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:02,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:07:02,476 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:07:02,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:07:02,488 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:02,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:07:02,495 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:07:02,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:07:02,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:02,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:07:02,504 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-13 15:07:02,504 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:07:02,504 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031515455] [2021-08-13 15:07:02,504 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031515455] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:07:02,504 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:07:02,504 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 15:07:02,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151941649] [2021-08-13 15:07:02,504 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 15:07:02,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:07:02,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 15:07:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 15:07:02,508 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2021-08-13 15:07:02,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 1386 transitions, 14176 flow. Second operand has 8 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 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-13 15:07:02,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:07:02,509 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2021-08-13 15:07:02,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:07:04,133 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1111] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~a~0=v_~a~0_154, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_2|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, P2Thread1of1ForFork0_#t~ite19][96], [259#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0)), 325#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0)), 199#true, 235#(= ~x~0 1), 140#true, 142#true, 175#true, 79#L854true, 144#true, 146#true, 147#true, 277#(= ~y~0 1), 151#true, 123#L775true, 92#L878-3true, 29#L818true, 31#L795true, 223#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0))]) [2021-08-13 15:07:04,133 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2021-08-13 15:07:04,133 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-08-13 15:07:04,133 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-08-13 15:07:04,133 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-08-13 15:07:08,858 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1111] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~a~0=v_~a~0_154, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_2|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, P2Thread1of1ForFork0_#t~ite19][96], [134#L857true, 39#L798true, 199#true, 73#L778true, 235#(= ~x~0 1), 140#true, 142#true, 175#true, 144#true, 146#true, 147#true, 277#(= ~y~0 1), 151#true, 87#L889true, 216#true, 251#true, 316#true, 29#L818true]) [2021-08-13 15:07:08,859 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2021-08-13 15:07:08,859 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-08-13 15:07:08,859 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-08-13 15:07:08,859 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2021-08-13 15:07:08,861 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1048] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_2 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 1) (= v_~__unbuffered_p3_EBX~0_2 0) (= v_~__unbuffered_p3_EAX~0_2 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][356], [134#L857true, 39#L798true, 199#true, 73#L778true, 140#true, 142#true, 110#L808true, 175#true, 144#true, 81#L892true, 241#(and (<= 1 ~main$tmp_guard1~0) (= ~x~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 146#true, 147#true, 277#(= ~y~0 1), 151#true, 216#true, 251#true, 316#true]) [2021-08-13 15:07:08,861 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is not cut-off event [2021-08-13 15:07:08,861 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-08-13 15:07:08,861 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-08-13 15:07:08,861 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is not cut-off event [2021-08-13 15:07:08,957 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1048] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_2 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p2_EBX~0_2 0) (= v_~__unbuffered_p2_EAX~0_2 1) (= v_~__unbuffered_p3_EBX~0_2 0) (= v_~__unbuffered_p3_EAX~0_2 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_2, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][356], [96#L811true, 134#L857true, 39#L798true, 199#true, 73#L778true, 140#true, 142#true, 175#true, 144#true, 81#L892true, 241#(and (<= 1 ~main$tmp_guard1~0) (= ~x~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 146#true, 147#true, 277#(= ~y~0 1), 151#true, 216#true, 251#true, 316#true]) [2021-08-13 15:07:08,957 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is not cut-off event [2021-08-13 15:07:08,957 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-08-13 15:07:08,957 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-08-13 15:07:08,957 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is not cut-off event [2021-08-13 15:07:09,473 INFO L129 PetriNetUnfolder]: 11657/34328 cut-off events. [2021-08-13 15:07:09,473 INFO L130 PetriNetUnfolder]: For 10621/43024 co-relation queries the response was YES. [2021-08-13 15:07:09,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105240 conditions, 34328 events. 11657/34328 cut-off events. For 10621/43024 co-relation queries the response was YES. Maximal size of possible extension queue 3278. Compared 483747 event pairs, 322 based on Foata normal form. 3727/35582 useless extension candidates. Maximal degree in co-relation 105140. Up to 8798 conditions per place. [2021-08-13 15:07:09,778 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 33 selfloop transitions, 106 changer transitions 336/701 dead transitions. [2021-08-13 15:07:09,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 701 transitions, 6442 flow [2021-08-13 15:07:09,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 15:07:09,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 15:07:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1957 transitions. [2021-08-13 15:07:09,787 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9266098484848485 [2021-08-13 15:07:09,787 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1957 transitions. [2021-08-13 15:07:09,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1957 transitions. [2021-08-13 15:07:09,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:07:09,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1957 transitions. [2021-08-13 15:07:09,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 122.3125) internal successors, (1957), 16 states have internal predecessors, (1957), 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-13 15:07:09,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 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-13 15:07:09,794 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 132.0) internal successors, (2244), 17 states have internal predecessors, (2244), 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-13 15:07:09,794 INFO L348 CegarLoopForPetriNet]: 139 programPoint places, 88 predicate places. [2021-08-13 15:07:09,794 INFO L482 AbstractCegarLoop]: Abstraction has has 227 places, 701 transitions, 6442 flow [2021-08-13 15:07:09,794 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 118.125) internal successors, (945), 8 states have internal predecessors, (945), 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-13 15:07:09,794 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:07:09,794 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:07:09,794 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 15:07:09,795 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:07:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:07:09,795 INFO L82 PathProgramCache]: Analyzing trace with hash 221871334, now seen corresponding path program 1 times [2021-08-13 15:07:09,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:07:09,795 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124721479] [2021-08-13 15:07:09,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:07:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 15:07:09,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:09,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:07:09,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:09,844 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:07:09,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:09,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:07:09,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:09,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:07:09,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:09,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 15:07:09,857 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 15:07:09,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 15:07:09,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:09,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 15:07:09,879 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 15:07:09,880 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 15:07:09,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 15:07:09,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 15:07:09,888 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-13 15:07:09,888 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 15:07:09,888 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124721479] [2021-08-13 15:07:09,888 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124721479] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 15:07:09,888 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 15:07:09,889 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 15:07:09,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491921521] [2021-08-13 15:07:09,889 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 15:07:09,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 15:07:09,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 15:07:09,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-13 15:07:09,890 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 132 [2021-08-13 15:07:09,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 701 transitions, 6442 flow. Second operand has 9 states, 9 states have (on average 118.11111111111111) internal successors, (1063), 9 states have internal predecessors, (1063), 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-13 15:07:09,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 15:07:09,891 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 132 [2021-08-13 15:07:09,891 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 15:07:11,090 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1111] L811-->L818: Formula: (let ((.cse8 (= (mod v_~a$r_buff1_thd3~0_52 256) 0)) (.cse14 (= (mod v_~a$w_buff1_used~0_372 256) 0)) (.cse12 (= (mod v_~a$w_buff0_used~0_456 256) 0)) (.cse13 (= (mod v_~a$r_buff0_thd3~0_68 256) 0)) (.cse7 (= 0 (mod v_~a$w_buff0_used~0_455 256)))) (let ((.cse10 (or .cse13 .cse7)) (.cse6 (not .cse7)) (.cse0 (or .cse13 .cse12)) (.cse11 (not .cse14)) (.cse3 (not .cse8)) (.cse9 (or .cse8 .cse14)) (.cse1 (not .cse13)) (.cse2 (not .cse12))) (and (or (and (= v_~a$w_buff0_used~0_456 v_~a$w_buff0_used~0_455) .cse0) (and .cse1 .cse2 (= v_~a$w_buff0_used~0_455 0))) (let ((.cse5 (= (mod v_~a$r_buff0_thd3~0_67 256) 0)) (.cse4 (= (mod v_~a$w_buff1_used~0_371 256) 0))) (or (and (= v_~a$r_buff1_thd3~0_51 0) (or (and .cse3 (not .cse4)) (and (not .cse5) .cse6))) (and (= v_~a$r_buff1_thd3~0_52 v_~a$r_buff1_thd3~0_51) (or .cse7 .cse5) (or .cse4 .cse8)))) (or (and (= v_~a$w_buff1_used~0_372 v_~a$w_buff1_used~0_371) .cse9 .cse10) (and (= v_~a$w_buff1_used~0_371 0) (or (and .cse11 .cse3) (and .cse1 .cse6)))) (or (and (= v_~a$r_buff0_thd3~0_68 v_~a$r_buff0_thd3~0_67) .cse10) (and .cse1 (= v_~a$r_buff0_thd3~0_67 0) .cse6)) (or (and (= |v_P2_#t~ite17_49| v_~a~0_154) .cse0 (or (and (= |v_P2_#t~ite17_49| v_~a$w_buff1~0_110) .cse11 .cse3) (and .cse9 (= |v_P2_#t~ite17_49| v_~a~0_155)))) (and .cse1 (= v_~a~0_154 v_~a$w_buff0~0_91) (= |v_P2_#t~ite17_49| |v_P2Thread1of1ForFork0_#t~ite17_1|) .cse2))))) InVars {~a~0=v_~a~0_155, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_52, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_456, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_68, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_372} OutVars{~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_51, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_455, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_67, P2Thread1of1ForFork0_#t~ite20=|v_P2Thread1of1ForFork0_#t~ite20_1|, ~a~0=v_~a~0_154, P2Thread1of1ForFork0_#t~ite17=|v_P2Thread1of1ForFork0_#t~ite17_2|, P2Thread1of1ForFork0_#t~ite21=|v_P2Thread1of1ForFork0_#t~ite21_1|, ~a$w_buff1~0=v_~a$w_buff1~0_110, P2Thread1of1ForFork0_#t~ite22=|v_P2Thread1of1ForFork0_#t~ite22_1|, ~a$w_buff0~0=v_~a$w_buff0~0_91, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_371, P2Thread1of1ForFork0_#t~ite18=|v_P2Thread1of1ForFork0_#t~ite18_1|, P2Thread1of1ForFork0_#t~ite19=|v_P2Thread1of1ForFork0_#t~ite19_1|} AuxVars[|v_P2_#t~ite17_49|] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite17, P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite22, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite20, ~a$w_buff1_used~0, P2Thread1of1ForFork0_#t~ite18, P2Thread1of1ForFork0_#t~ite19][96], [259#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0)), 325#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0)), 357#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0)), 199#true, 235#(= ~x~0 1), 140#true, 142#true, 175#true, 79#L854true, 144#true, 146#true, 147#true, 277#(= ~y~0 1), 151#true, 123#L775true, 92#L878-3true, 29#L818true, 31#L795true, 223#(and (< 0 (+ (div ~main$tmp_guard0~0 256) 1)) (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0))]) [2021-08-13 15:07:11,091 INFO L384 tUnfolder$Statistics]: this new event has 85 ancestors and is cut-off event [2021-08-13 15:07:11,091 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-08-13 15:07:11,091 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-08-13 15:07:11,091 INFO L387 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2021-08-13 15:07:15,123 INFO L129 PetriNetUnfolder]: 11356/32072 cut-off events. [2021-08-13 15:07:15,123 INFO L130 PetriNetUnfolder]: For 16918/53955 co-relation queries the response was YES. [2021-08-13 15:07:15,380 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119556 conditions, 32072 events. 11356/32072 cut-off events. For 16918/53955 co-relation queries the response was YES. Maximal size of possible extension queue 3278. Compared 454057 event pairs, 292 based on Foata normal form. 3741/33436 useless extension candidates. Maximal degree in co-relation 119453. Up to 8640 conditions per place. [2021-08-13 15:07:15,427 INFO L132 encePairwiseOnDemand]: 121/132 looper letters, 28 selfloop transitions, 111 changer transitions 152/454 dead transitions. [2021-08-13 15:07:15,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 454 transitions, 3980 flow [2021-08-13 15:07:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-13 15:07:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2021-08-13 15:07:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2305 transitions. [2021-08-13 15:07:15,430 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9190590111642744 [2021-08-13 15:07:15,430 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2305 transitions. [2021-08-13 15:07:15,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2305 transitions. [2021-08-13 15:07:15,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 15:07:15,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2305 transitions. [2021-08-13 15:07:15,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 121.3157894736842) internal successors, (2305), 19 states have internal predecessors, (2305), 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-13 15:07:15,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 132.0) internal successors, (2640), 20 states have internal predecessors, (2640), 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-13 15:07:15,437 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 132.0) internal successors, (2640), 20 states have internal predecessors, (2640), 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-13 15:07:15,437 INFO L348 CegarLoopForPetriNet]: 139 programPoint places, 85 predicate places. [2021-08-13 15:07:15,437 INFO L482 AbstractCegarLoop]: Abstraction has has 224 places, 454 transitions, 3980 flow [2021-08-13 15:07:15,438 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 118.11111111111111) internal successors, (1063), 9 states have internal predecessors, (1063), 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-13 15:07:15,438 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 15:07:15,438 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-13 15:07:15,438 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 15:07:15,438 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 15:07:15,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 15:07:15,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1002066206, now seen corresponding path program 1 times [2021-08-13 15:07:15,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 15:07:15,439 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174391521] [2021-08-13 15:07:15,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 15:07:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 15:07:15,474 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 15:07:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 15:07:15,513 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 15:07:15,546 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 15:07:15,546 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 15:07:15,546 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 15:07:15,548 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 15:07:15,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 03:07:15 BasicIcfg [2021-08-13 15:07:15,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 15:07:15,728 INFO L168 Benchmark]: Toolchain (without parser) took 55845.42 ms. Allocated memory was 195.0 MB in the beginning and 5.0 GB in the end (delta: 4.8 GB). Free memory was 158.0 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 8.0 GB. [2021-08-13 15:07:15,728 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 195.0 MB. Free memory is still 176.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 15:07:15,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 460.10 ms. Allocated memory is still 195.0 MB. Free memory was 158.0 MB in the beginning and 151.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-08-13 15:07:15,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.40 ms. Allocated memory is still 195.0 MB. Free memory was 151.3 MB in the beginning and 148.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 15:07:15,728 INFO L168 Benchmark]: Boogie Preprocessor took 31.72 ms. Allocated memory is still 195.0 MB. Free memory was 148.7 MB in the beginning and 146.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 15:07:15,729 INFO L168 Benchmark]: RCFGBuilder took 1685.97 ms. Allocated memory was 195.0 MB in the beginning and 245.4 MB in the end (delta: 50.3 MB). Free memory was 146.6 MB in the beginning and 157.7 MB in the end (delta: -11.0 MB). Peak memory consumption was 88.6 MB. Max. memory is 8.0 GB. [2021-08-13 15:07:15,729 INFO L168 Benchmark]: TraceAbstraction took 53620.68 ms. Allocated memory was 245.4 MB in the beginning and 5.0 GB in the end (delta: 4.8 GB). Free memory was 157.1 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 8.0 GB. [2021-08-13 15:07:15,730 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.09 ms. Allocated memory is still 195.0 MB. Free memory is still 176.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 460.10 ms. Allocated memory is still 195.0 MB. Free memory was 158.0 MB in the beginning and 151.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 41.40 ms. Allocated memory is still 195.0 MB. Free memory was 151.3 MB in the beginning and 148.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.72 ms. Allocated memory is still 195.0 MB. Free memory was 148.7 MB in the beginning and 146.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1685.97 ms. Allocated memory was 195.0 MB in the beginning and 245.4 MB in the end (delta: 50.3 MB). Free memory was 146.6 MB in the beginning and 157.7 MB in the end (delta: -11.0 MB). Peak memory consumption was 88.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 53620.68 ms. Allocated memory was 245.4 MB in the beginning and 5.0 GB in the end (delta: 4.8 GB). Free memory was 157.1 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.5 GB. 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: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L722] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L723] 0 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0] [L724] 0 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L725] 0 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L726] 0 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L727] 0 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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] [L728] 0 _Bool a$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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] [L729] 0 _Bool a$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0] [L730] 0 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0] [L731] 0 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L732] 0 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L733] 0 _Bool a$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0] [L734] 0 _Bool a$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0] [L735] 0 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0] [L736] 0 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L737] 0 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L738] 0 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L739] 0 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L740] 0 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L741] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L742] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L744] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L746] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L749] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L750] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L871] 0 pthread_t t129; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L872] FCALL, FORK 0 pthread_create(&t129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L754] 1 a$w_buff1 = a$w_buff0 [L755] 1 a$w_buff0 = 1 [L756] 1 a$w_buff1_used = a$w_buff0_used [L757] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L759] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L760] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L761] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L762] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L763] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L764] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L873] 0 pthread_t t130; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L874] FCALL, FORK 0 pthread_create(&t130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=0, z=0] [L875] 0 pthread_t t131; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=1, z=0] [L877] 0 pthread_t t132; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=2, y=1, z=0] [L878] FCALL, FORK 0 pthread_create(&t132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 a$flush_delayed = weak$$choice2 [L836] 4 a$mem_tmp = a [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L837] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L838] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L838] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L839] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L840] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L840] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L842] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = a [L845] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L845] 4 a = a$flush_delayed ? a$mem_tmp : a [L846] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L770] 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) [L770] 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) [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L771] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L772] 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 [L773] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L773] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L774] 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 [L790] 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) [L790] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L790] 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) [L790] 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) [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L791] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L792] 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 [L793] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L793] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L794] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 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 [L813] 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) [L813] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L813] 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) [L813] 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) [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] 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 [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L817] 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 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L849] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L850] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L851] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L852] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L852] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L853] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L853] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L884] 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) [L884] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L884] 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) [L884] 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) [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L885] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L886] 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 [L887] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L887] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L888] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L888] 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 [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 170 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 14.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 53313.9ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 51619.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 73.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 241 SDtfs, 557 SDslu, 809 SDs, 0 SdLazy, 740 SolverSat, 207 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 668.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1247.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14176occurred in iteration=8, InterpolantAutomatonStates: 127, 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: 177.9ms SsaConstructionTime, 319.0ms SatisfiabilityAnalysisTime, 850.1ms InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 851 ConstructedInterpolants, 0 QuantifiedInterpolants, 3459 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...