/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:40:49,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:40:49,694 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:40:49,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:40:49,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:40:49,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:40:49,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:40:49,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:40:49,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:40:49,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:40:49,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:40:49,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:40:49,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:40:49,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:40:49,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:40:49,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:40:49,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:40:49,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:40:49,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:40:49,780 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:40:49,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:40:49,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:40:49,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:40:49,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:40:49,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:40:49,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:40:49,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:40:49,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:40:49,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:40:49,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:40:49,789 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:40:49,790 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:40:49,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:40:49,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:40:49,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:40:49,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:40:49,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:40:49,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:40:49,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:40:49,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:40:49,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:40:49,796 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-18 22:40:49,817 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:40:49,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:40:49,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:40:49,818 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:40:49,818 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:40:49,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:40:49,818 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:40:49,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:40:49,818 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:40:49,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:40:49,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:40:49,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:40:49,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:40:49,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:40:49,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:40:49,820 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:40:49,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:40:49,820 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:40:49,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:40:49,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:40:49,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:40:49,820 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:40:49,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:40:49,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:40:49,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:40:49,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:40:49,820 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:40:49,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:40:49,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:40:49,821 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:40:49,821 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:40:49,821 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 22:40:49,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:40:50,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:40:50,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:40:50,019 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:40:50,019 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:40:50,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2022-01-18 22:40:50,065 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badcbb6e6/03e7fe4fccad459b843f58bcd13e6e23/FLAG0a4663e12 [2022-01-18 22:40:50,424 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:40:50,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.i [2022-01-18 22:40:50,433 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badcbb6e6/03e7fe4fccad459b843f58bcd13e6e23/FLAG0a4663e12 [2022-01-18 22:40:50,803 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/badcbb6e6/03e7fe4fccad459b843f58bcd13e6e23 [2022-01-18 22:40:50,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:40:50,805 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:40:50,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:40:50,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:40:50,809 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:40:50,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:40:50" (1/1) ... [2022-01-18 22:40:50,811 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc1d5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:50, skipping insertion in model container [2022-01-18 22:40:50,811 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:40:50" (1/1) ... [2022-01-18 22:40:50,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:40:50,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:40:50,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.i[944,957] [2022-01-18 22:40:51,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:40:51,134 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:40:51,143 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.i[944,957] [2022-01-18 22:40:51,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:40:51,212 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:40:51,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51 WrapperNode [2022-01-18 22:40:51,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:40:51,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:40:51,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:40:51,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:40:51,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51" (1/1) ... [2022-01-18 22:40:51,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51" (1/1) ... [2022-01-18 22:40:51,283 INFO L137 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 377 [2022-01-18 22:40:51,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:40:51,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:40:51,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:40:51,284 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:40:51,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51" (1/1) ... [2022-01-18 22:40:51,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51" (1/1) ... [2022-01-18 22:40:51,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51" (1/1) ... [2022-01-18 22:40:51,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51" (1/1) ... [2022-01-18 22:40:51,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51" (1/1) ... [2022-01-18 22:40:51,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51" (1/1) ... [2022-01-18 22:40:51,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51" (1/1) ... [2022-01-18 22:40:51,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:40:51,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:40:51,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:40:51,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:40:51,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51" (1/1) ... [2022-01-18 22:40:51,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:40:51,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:40:51,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 22:40:51,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 22:40:51,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:40:51,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:40:51,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:40:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:40:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:40:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:40:51,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:40:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:40:51,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:40:51,403 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-18 22:40:51,403 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-18 22:40:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:40:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:40:51,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:40:51,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:40:51,405 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 22:40:51,551 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:40:51,552 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:40:51,953 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:40:52,216 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:40:52,217 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:40:52,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:40:52 BoogieIcfgContainer [2022-01-18 22:40:52,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:40:52,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:40:52,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:40:52,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:40:52,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:40:50" (1/3) ... [2022-01-18 22:40:52,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1692b462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:40:52, skipping insertion in model container [2022-01-18 22:40:52,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:40:51" (2/3) ... [2022-01-18 22:40:52,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1692b462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:40:52, skipping insertion in model container [2022-01-18 22:40:52,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:40:52" (3/3) ... [2022-01-18 22:40:52,225 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_tso.i [2022-01-18 22:40:52,229 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:40:52,229 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:40:52,229 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:40:52,270 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,270 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,270 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,270 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,270 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,270 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,270 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,271 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,271 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,271 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,271 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,271 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,272 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,272 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,272 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,272 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,273 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,273 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,273 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,273 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,273 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,273 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,273 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,274 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,274 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,274 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,274 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,275 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,276 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,277 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,277 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,277 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,277 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,277 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,277 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,277 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,277 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,277 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,278 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,278 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,278 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,278 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,278 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,279 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,279 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,279 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,279 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,279 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,279 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,279 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,279 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,279 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,280 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,280 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,280 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,280 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,280 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,280 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,280 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,280 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,280 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,280 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,280 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,281 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,281 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,281 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,281 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,281 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,281 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,281 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,281 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,282 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,282 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,282 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,282 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,282 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,282 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,282 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,283 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,283 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,283 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,284 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,284 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,288 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,292 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,292 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,292 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,292 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,293 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,294 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,295 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,295 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,295 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,295 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,295 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,295 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,297 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,297 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,297 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,297 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,297 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,298 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,298 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,298 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,298 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,298 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,298 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,298 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,298 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,299 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,299 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,299 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,300 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,300 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,302 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,302 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,302 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,302 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,302 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,302 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,303 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,303 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,303 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,303 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,303 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,303 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,304 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,304 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,304 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,304 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,304 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,304 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,304 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,304 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,304 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,304 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,305 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,306 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,306 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,307 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,307 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,307 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,307 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,307 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,307 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,307 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,308 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,308 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,308 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,308 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,308 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,308 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,308 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:40:52,308 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:40:52,347 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:40:52,351 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 22:40:52,351 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-01-18 22:40:52,358 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 115 transitions, 245 flow [2022-01-18 22:40:52,388 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2022-01-18 22:40:52,388 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:40:52,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-01-18 22:40:52,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 115 transitions, 245 flow [2022-01-18 22:40:52,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 112 transitions, 233 flow [2022-01-18 22:40:52,403 INFO L129 PetriNetUnfolder]: 0/74 cut-off events. [2022-01-18 22:40:52,403 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:40:52,403 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:52,404 INFO L254 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] [2022-01-18 22:40:52,405 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:52,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:52,410 INFO L85 PathProgramCache]: Analyzing trace with hash 593438959, now seen corresponding path program 1 times [2022-01-18 22:40:52,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:52,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179050202] [2022-01-18 22:40:52,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:52,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:52,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:52,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179050202] [2022-01-18 22:40:52,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179050202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:52,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:52,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:40:52,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618601119] [2022-01-18 22:40:52,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:52,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:40:52,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:52,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:40:52,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:40:52,694 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2022-01-18 22:40:52,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 112 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) [2022-01-18 22:40:52,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:52,699 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2022-01-18 22:40:52,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:52,817 INFO L129 PetriNetUnfolder]: 24/194 cut-off events. [2022-01-18 22:40:52,817 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-18 22:40:52,818 INFO L84 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 194 events. 24/194 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 496 event pairs, 3 based on Foata normal form. 7/191 useless extension candidates. Maximal degree in co-relation 207. Up to 40 conditions per place. [2022-01-18 22:40:52,820 INFO L132 encePairwiseOnDemand]: 110/115 looper letters, 11 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2022-01-18 22:40:52,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 111 transitions, 257 flow [2022-01-18 22:40:52,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:40:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:40:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-01-18 22:40:52,833 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9304347826086956 [2022-01-18 22:40:52,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-01-18 22:40:52,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-01-18 22:40:52,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:52,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-01-18 22:40:52,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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) [2022-01-18 22:40:52,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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) [2022-01-18 22:40:52,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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) [2022-01-18 22:40:52,856 INFO L186 Difference]: Start difference. First operand has 120 places, 112 transitions, 233 flow. Second operand 3 states and 321 transitions. [2022-01-18 22:40:52,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 111 transitions, 257 flow [2022-01-18 22:40:52,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 111 transitions, 254 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-18 22:40:52,862 INFO L242 Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow [2022-01-18 22:40:52,864 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2022-01-18 22:40:52,869 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places. [2022-01-18 22:40:52,869 INFO L470 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow [2022-01-18 22:40:52,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 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) [2022-01-18 22:40:52,870 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:52,870 INFO L254 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] [2022-01-18 22:40:52,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:40:52,870 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:52,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1890616278, now seen corresponding path program 1 times [2022-01-18 22:40:52,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:52,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225306165] [2022-01-18 22:40:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:52,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:53,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:53,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225306165] [2022-01-18 22:40:53,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225306165] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:53,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:53,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:40:53,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172483606] [2022-01-18 22:40:53,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:53,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:40:53,097 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:53,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:40:53,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:40:53,099 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 115 [2022-01-18 22:40:53,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 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) [2022-01-18 22:40:53,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:53,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 115 [2022-01-18 22:40:53,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:53,325 INFO L129 PetriNetUnfolder]: 84/407 cut-off events. [2022-01-18 22:40:53,325 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-01-18 22:40:53,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 407 events. 84/407 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1970 event pairs, 20 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 550. Up to 65 conditions per place. [2022-01-18 22:40:53,329 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 15 selfloop transitions, 2 changer transitions 36/134 dead transitions. [2022-01-18 22:40:53,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 134 transitions, 368 flow [2022-01-18 22:40:53,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:40:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:40:53,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 899 transitions. [2022-01-18 22:40:53,332 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8685990338164251 [2022-01-18 22:40:53,332 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 899 transitions. [2022-01-18 22:40:53,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 899 transitions. [2022-01-18 22:40:53,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:53,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 899 transitions. [2022-01-18 22:40:53,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.88888888888889) internal successors, (899), 9 states have internal predecessors, (899), 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) [2022-01-18 22:40:53,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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) [2022-01-18 22:40:53,338 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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) [2022-01-18 22:40:53,338 INFO L186 Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 899 transitions. [2022-01-18 22:40:53,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 134 transitions, 368 flow [2022-01-18 22:40:53,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 134 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:40:53,341 INFO L242 Difference]: Finished difference. Result has 130 places, 96 transitions, 218 flow [2022-01-18 22:40:53,341 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=218, PETRI_PLACES=130, PETRI_TRANSITIONS=96} [2022-01-18 22:40:53,342 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 10 predicate places. [2022-01-18 22:40:53,342 INFO L470 AbstractCegarLoop]: Abstraction has has 130 places, 96 transitions, 218 flow [2022-01-18 22:40:53,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 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) [2022-01-18 22:40:53,342 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:53,342 INFO L254 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] [2022-01-18 22:40:53,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:40:53,343 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:53,343 INFO L85 PathProgramCache]: Analyzing trace with hash -435548897, now seen corresponding path program 1 times [2022-01-18 22:40:53,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:53,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626256777] [2022-01-18 22:40:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:53,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:53,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:53,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626256777] [2022-01-18 22:40:53,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626256777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:53,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:53,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:40:53,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557919869] [2022-01-18 22:40:53,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:53,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:40:53,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:53,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:40:53,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:40:53,519 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2022-01-18 22:40:53,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 96 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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) [2022-01-18 22:40:53,519 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:53,519 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2022-01-18 22:40:53,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:53,739 INFO L129 PetriNetUnfolder]: 222/597 cut-off events. [2022-01-18 22:40:53,739 INFO L130 PetriNetUnfolder]: For 120/120 co-relation queries the response was YES. [2022-01-18 22:40:53,741 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 597 events. 222/597 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3036 event pairs, 97 based on Foata normal form. 12/582 useless extension candidates. Maximal degree in co-relation 1089. Up to 247 conditions per place. [2022-01-18 22:40:53,742 INFO L132 encePairwiseOnDemand]: 108/115 looper letters, 22 selfloop transitions, 3 changer transitions 28/132 dead transitions. [2022-01-18 22:40:53,743 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 132 transitions, 421 flow [2022-01-18 22:40:53,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:40:53,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:40:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2022-01-18 22:40:53,748 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8618357487922705 [2022-01-18 22:40:53,748 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 892 transitions. [2022-01-18 22:40:53,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions. [2022-01-18 22:40:53,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:53,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions. [2022-01-18 22:40:53,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 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) [2022-01-18 22:40:53,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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) [2022-01-18 22:40:53,751 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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) [2022-01-18 22:40:53,752 INFO L186 Difference]: Start difference. First operand has 130 places, 96 transitions, 218 flow. Second operand 9 states and 892 transitions. [2022-01-18 22:40:53,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 132 transitions, 421 flow [2022-01-18 22:40:53,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 132 transitions, 387 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-01-18 22:40:53,759 INFO L242 Difference]: Finished difference. Result has 119 places, 98 transitions, 245 flow [2022-01-18 22:40:53,759 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=245, PETRI_PLACES=119, PETRI_TRANSITIONS=98} [2022-01-18 22:40:53,760 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -1 predicate places. [2022-01-18 22:40:53,761 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 98 transitions, 245 flow [2022-01-18 22:40:53,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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) [2022-01-18 22:40:53,761 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:53,761 INFO L254 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] [2022-01-18 22:40:53,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:40:53,762 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:53,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:53,762 INFO L85 PathProgramCache]: Analyzing trace with hash -393241332, now seen corresponding path program 1 times [2022-01-18 22:40:53,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:53,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531808260] [2022-01-18 22:40:53,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:53,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:53,922 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:53,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531808260] [2022-01-18 22:40:53,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531808260] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:53,923 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:53,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:40:53,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987853281] [2022-01-18 22:40:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:53,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:40:53,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:53,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:40:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:40:53,924 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-01-18 22:40:53,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 98 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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) [2022-01-18 22:40:53,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:53,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-01-18 22:40:53,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:54,266 INFO L129 PetriNetUnfolder]: 762/1649 cut-off events. [2022-01-18 22:40:54,266 INFO L130 PetriNetUnfolder]: For 321/321 co-relation queries the response was YES. [2022-01-18 22:40:54,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3302 conditions, 1649 events. 762/1649 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10888 event pairs, 43 based on Foata normal form. 0/1574 useless extension candidates. Maximal degree in co-relation 3242. Up to 471 conditions per place. [2022-01-18 22:40:54,277 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 60 selfloop transitions, 15 changer transitions 5/158 dead transitions. [2022-01-18 22:40:54,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 158 transitions, 536 flow [2022-01-18 22:40:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:40:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:40:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 992 transitions. [2022-01-18 22:40:54,280 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8626086956521739 [2022-01-18 22:40:54,280 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 992 transitions. [2022-01-18 22:40:54,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 992 transitions. [2022-01-18 22:40:54,280 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:54,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 992 transitions. [2022-01-18 22:40:54,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.2) internal successors, (992), 10 states have internal predecessors, (992), 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) [2022-01-18 22:40:54,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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) [2022-01-18 22:40:54,284 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 115.0) internal successors, (1265), 11 states have internal predecessors, (1265), 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) [2022-01-18 22:40:54,284 INFO L186 Difference]: Start difference. First operand has 119 places, 98 transitions, 245 flow. Second operand 10 states and 992 transitions. [2022-01-18 22:40:54,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 158 transitions, 536 flow [2022-01-18 22:40:54,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 158 transitions, 527 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-01-18 22:40:54,288 INFO L242 Difference]: Finished difference. Result has 124 places, 111 transitions, 345 flow [2022-01-18 22:40:54,288 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=345, PETRI_PLACES=124, PETRI_TRANSITIONS=111} [2022-01-18 22:40:54,288 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 4 predicate places. [2022-01-18 22:40:54,288 INFO L470 AbstractCegarLoop]: Abstraction has has 124 places, 111 transitions, 345 flow [2022-01-18 22:40:54,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.33333333333333) internal successors, (560), 6 states have internal predecessors, (560), 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) [2022-01-18 22:40:54,289 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:54,289 INFO L254 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] [2022-01-18 22:40:54,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:40:54,289 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:54,289 INFO L85 PathProgramCache]: Analyzing trace with hash 768522523, now seen corresponding path program 1 times [2022-01-18 22:40:54,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:54,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649528613] [2022-01-18 22:40:54,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:54,290 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:54,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:54,388 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:54,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649528613] [2022-01-18 22:40:54,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649528613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:54,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:54,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:40:54,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214741206] [2022-01-18 22:40:54,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:54,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:40:54,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:54,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:40:54,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:40:54,390 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2022-01-18 22:40:54,390 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 111 transitions, 345 flow. Second operand has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 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) [2022-01-18 22:40:54,391 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:54,391 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2022-01-18 22:40:54,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:54,650 INFO L129 PetriNetUnfolder]: 309/1357 cut-off events. [2022-01-18 22:40:54,650 INFO L130 PetriNetUnfolder]: For 1061/1154 co-relation queries the response was YES. [2022-01-18 22:40:54,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3157 conditions, 1357 events. 309/1357 cut-off events. For 1061/1154 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 11263 event pairs, 109 based on Foata normal form. 31/1314 useless extension candidates. Maximal degree in co-relation 3092. Up to 222 conditions per place. [2022-01-18 22:40:54,659 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 31 selfloop transitions, 6 changer transitions 15/144 dead transitions. [2022-01-18 22:40:54,660 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 144 transitions, 562 flow [2022-01-18 22:40:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:40:54,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:40:54,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 890 transitions. [2022-01-18 22:40:54,662 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8599033816425121 [2022-01-18 22:40:54,662 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 890 transitions. [2022-01-18 22:40:54,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 890 transitions. [2022-01-18 22:40:54,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:54,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 890 transitions. [2022-01-18 22:40:54,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 98.88888888888889) internal successors, (890), 9 states have internal predecessors, (890), 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) [2022-01-18 22:40:54,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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) [2022-01-18 22:40:54,665 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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) [2022-01-18 22:40:54,665 INFO L186 Difference]: Start difference. First operand has 124 places, 111 transitions, 345 flow. Second operand 9 states and 890 transitions. [2022-01-18 22:40:54,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 144 transitions, 562 flow [2022-01-18 22:40:54,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 144 transitions, 552 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-01-18 22:40:54,714 INFO L242 Difference]: Finished difference. Result has 138 places, 114 transitions, 390 flow [2022-01-18 22:40:54,714 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=390, PETRI_PLACES=138, PETRI_TRANSITIONS=114} [2022-01-18 22:40:54,715 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 18 predicate places. [2022-01-18 22:40:54,715 INFO L470 AbstractCegarLoop]: Abstraction has has 138 places, 114 transitions, 390 flow [2022-01-18 22:40:54,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 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) [2022-01-18 22:40:54,715 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:54,715 INFO L254 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] [2022-01-18 22:40:54,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:40:54,715 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:54,716 INFO L85 PathProgramCache]: Analyzing trace with hash 63050052, now seen corresponding path program 1 times [2022-01-18 22:40:54,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:54,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127943476] [2022-01-18 22:40:54,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:54,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:54,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:54,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:54,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:54,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127943476] [2022-01-18 22:40:54,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127943476] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:54,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:54,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:40:54,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095599809] [2022-01-18 22:40:54,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:54,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:40:54,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:54,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:40:54,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:40:54,841 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-01-18 22:40:54,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 114 transitions, 390 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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) [2022-01-18 22:40:54,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:54,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-01-18 22:40:54,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:55,300 INFO L129 PetriNetUnfolder]: 983/2190 cut-off events. [2022-01-18 22:40:55,300 INFO L130 PetriNetUnfolder]: For 2888/2892 co-relation queries the response was YES. [2022-01-18 22:40:55,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6327 conditions, 2190 events. 983/2190 cut-off events. For 2888/2892 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 16334 event pairs, 54 based on Foata normal form. 43/2168 useless extension candidates. Maximal degree in co-relation 6260. Up to 503 conditions per place. [2022-01-18 22:40:55,313 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 34 selfloop transitions, 9 changer transitions 71/192 dead transitions. [2022-01-18 22:40:55,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 192 transitions, 940 flow [2022-01-18 22:40:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:40:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:40:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1290 transitions. [2022-01-18 22:40:55,316 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.862876254180602 [2022-01-18 22:40:55,316 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1290 transitions. [2022-01-18 22:40:55,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1290 transitions. [2022-01-18 22:40:55,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:55,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1290 transitions. [2022-01-18 22:40:55,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.23076923076923) internal successors, (1290), 13 states have internal predecessors, (1290), 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) [2022-01-18 22:40:55,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 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) [2022-01-18 22:40:55,321 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 115.0) internal successors, (1610), 14 states have internal predecessors, (1610), 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) [2022-01-18 22:40:55,321 INFO L186 Difference]: Start difference. First operand has 138 places, 114 transitions, 390 flow. Second operand 13 states and 1290 transitions. [2022-01-18 22:40:55,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 192 transitions, 940 flow [2022-01-18 22:40:55,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 192 transitions, 923 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-18 22:40:55,330 INFO L242 Difference]: Finished difference. Result has 149 places, 103 transitions, 378 flow [2022-01-18 22:40:55,330 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=378, PETRI_PLACES=149, PETRI_TRANSITIONS=103} [2022-01-18 22:40:55,331 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 29 predicate places. [2022-01-18 22:40:55,332 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 103 transitions, 378 flow [2022-01-18 22:40:55,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 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) [2022-01-18 22:40:55,333 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:55,333 INFO L254 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] [2022-01-18 22:40:55,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:40:55,333 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:55,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1290049173, now seen corresponding path program 1 times [2022-01-18 22:40:55,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:55,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122524821] [2022-01-18 22:40:55,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:55,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:55,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:55,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:55,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122524821] [2022-01-18 22:40:55,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122524821] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:55,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:55,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:40:55,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091326850] [2022-01-18 22:40:55,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:55,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:40:55,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:55,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:40:55,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:40:55,462 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2022-01-18 22:40:55,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 103 transitions, 378 flow. Second operand has 8 states, 8 states have (on average 93.25) internal successors, (746), 8 states have internal predecessors, (746), 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) [2022-01-18 22:40:55,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:55,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2022-01-18 22:40:55,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:55,677 INFO L129 PetriNetUnfolder]: 129/465 cut-off events. [2022-01-18 22:40:55,677 INFO L130 PetriNetUnfolder]: For 1454/1456 co-relation queries the response was YES. [2022-01-18 22:40:55,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 465 events. 129/465 cut-off events. For 1454/1456 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2306 event pairs, 12 based on Foata normal form. 17/468 useless extension candidates. Maximal degree in co-relation 1434. Up to 97 conditions per place. [2022-01-18 22:40:55,680 INFO L132 encePairwiseOnDemand]: 106/115 looper letters, 24 selfloop transitions, 12 changer transitions 23/135 dead transitions. [2022-01-18 22:40:55,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 135 transitions, 669 flow [2022-01-18 22:40:55,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-18 22:40:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-18 22:40:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1060 transitions. [2022-01-18 22:40:55,682 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8379446640316206 [2022-01-18 22:40:55,682 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1060 transitions. [2022-01-18 22:40:55,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1060 transitions. [2022-01-18 22:40:55,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:55,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1060 transitions. [2022-01-18 22:40:55,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.36363636363636) internal successors, (1060), 11 states have internal predecessors, (1060), 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) [2022-01-18 22:40:55,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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) [2022-01-18 22:40:55,687 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 115.0) internal successors, (1380), 12 states have internal predecessors, (1380), 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) [2022-01-18 22:40:55,687 INFO L186 Difference]: Start difference. First operand has 149 places, 103 transitions, 378 flow. Second operand 11 states and 1060 transitions. [2022-01-18 22:40:55,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 135 transitions, 669 flow [2022-01-18 22:40:55,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 135 transitions, 523 flow, removed 55 selfloop flow, removed 20 redundant places. [2022-01-18 22:40:55,691 INFO L242 Difference]: Finished difference. Result has 129 places, 101 transitions, 318 flow [2022-01-18 22:40:55,691 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=318, PETRI_PLACES=129, PETRI_TRANSITIONS=101} [2022-01-18 22:40:55,692 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 9 predicate places. [2022-01-18 22:40:55,692 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 101 transitions, 318 flow [2022-01-18 22:40:55,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.25) internal successors, (746), 8 states have internal predecessors, (746), 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) [2022-01-18 22:40:55,693 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:55,693 INFO L254 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] [2022-01-18 22:40:55,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:40:55,693 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:55,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:55,693 INFO L85 PathProgramCache]: Analyzing trace with hash 653688193, now seen corresponding path program 1 times [2022-01-18 22:40:55,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:55,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81285197] [2022-01-18 22:40:55,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:55,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:55,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:55,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81285197] [2022-01-18 22:40:55,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81285197] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:55,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:55,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:40:55,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528457726] [2022-01-18 22:40:55,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:55,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:40:55,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:55,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:40:55,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:40:55,812 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 115 [2022-01-18 22:40:55,812 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 101 transitions, 318 flow. Second operand has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 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) [2022-01-18 22:40:55,812 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:55,812 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 115 [2022-01-18 22:40:55,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:55,923 INFO L129 PetriNetUnfolder]: 25/224 cut-off events. [2022-01-18 22:40:55,923 INFO L130 PetriNetUnfolder]: For 183/193 co-relation queries the response was YES. [2022-01-18 22:40:55,924 INFO L84 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 224 events. 25/224 cut-off events. For 183/193 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 656 event pairs, 3 based on Foata normal form. 1/222 useless extension candidates. Maximal degree in co-relation 414. Up to 29 conditions per place. [2022-01-18 22:40:55,925 INFO L132 encePairwiseOnDemand]: 109/115 looper letters, 18 selfloop transitions, 1 changer transitions 12/114 dead transitions. [2022-01-18 22:40:55,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 114 transitions, 412 flow [2022-01-18 22:40:55,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:40:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:40:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 676 transitions. [2022-01-18 22:40:55,926 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8397515527950311 [2022-01-18 22:40:55,926 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 676 transitions. [2022-01-18 22:40:55,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 676 transitions. [2022-01-18 22:40:55,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:55,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 676 transitions. [2022-01-18 22:40:55,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 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) [2022-01-18 22:40:55,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 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) [2022-01-18 22:40:55,930 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 115.0) internal successors, (920), 8 states have internal predecessors, (920), 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) [2022-01-18 22:40:55,930 INFO L186 Difference]: Start difference. First operand has 129 places, 101 transitions, 318 flow. Second operand 7 states and 676 transitions. [2022-01-18 22:40:55,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 114 transitions, 412 flow [2022-01-18 22:40:55,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 114 transitions, 322 flow, removed 23 selfloop flow, removed 18 redundant places. [2022-01-18 22:40:55,932 INFO L242 Difference]: Finished difference. Result has 118 places, 101 transitions, 243 flow [2022-01-18 22:40:55,932 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=243, PETRI_PLACES=118, PETRI_TRANSITIONS=101} [2022-01-18 22:40:55,935 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, -2 predicate places. [2022-01-18 22:40:55,935 INFO L470 AbstractCegarLoop]: Abstraction has has 118 places, 101 transitions, 243 flow [2022-01-18 22:40:55,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 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) [2022-01-18 22:40:55,935 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:55,935 INFO L254 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] [2022-01-18 22:40:55,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:40:55,936 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1043971597, now seen corresponding path program 2 times [2022-01-18 22:40:55,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:55,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866928413] [2022-01-18 22:40:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:55,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:40:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:40:56,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:40:56,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866928413] [2022-01-18 22:40:56,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866928413] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:40:56,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:40:56,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-18 22:40:56,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10407727] [2022-01-18 22:40:56,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:40:56,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-18 22:40:56,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:40:56,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-18 22:40:56,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-18 22:40:56,107 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 115 [2022-01-18 22:40:56,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 101 transitions, 243 flow. Second operand has 10 states, 10 states have (on average 92.0) internal successors, (920), 10 states have internal predecessors, (920), 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) [2022-01-18 22:40:56,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:40:56,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 115 [2022-01-18 22:40:56,108 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:40:56,248 INFO L129 PetriNetUnfolder]: 22/212 cut-off events. [2022-01-18 22:40:56,248 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-18 22:40:56,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 212 events. 22/212 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 596 event pairs, 2 based on Foata normal form. 1/209 useless extension candidates. Maximal degree in co-relation 318. Up to 22 conditions per place. [2022-01-18 22:40:56,249 INFO L132 encePairwiseOnDemand]: 105/115 looper letters, 16 selfloop transitions, 5 changer transitions 9/111 dead transitions. [2022-01-18 22:40:56,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 111 transitions, 329 flow [2022-01-18 22:40:56,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:40:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:40:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 841 transitions. [2022-01-18 22:40:56,250 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.81256038647343 [2022-01-18 22:40:56,250 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 841 transitions. [2022-01-18 22:40:56,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 841 transitions. [2022-01-18 22:40:56,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:40:56,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 841 transitions. [2022-01-18 22:40:56,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 93.44444444444444) internal successors, (841), 9 states have internal predecessors, (841), 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) [2022-01-18 22:40:56,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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) [2022-01-18 22:40:56,254 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 115.0) internal successors, (1150), 10 states have internal predecessors, (1150), 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) [2022-01-18 22:40:56,254 INFO L186 Difference]: Start difference. First operand has 118 places, 101 transitions, 243 flow. Second operand 9 states and 841 transitions. [2022-01-18 22:40:56,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 111 transitions, 329 flow [2022-01-18 22:40:56,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 111 transitions, 314 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-18 22:40:56,255 INFO L242 Difference]: Finished difference. Result has 121 places, 101 transitions, 256 flow [2022-01-18 22:40:56,256 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=256, PETRI_PLACES=121, PETRI_TRANSITIONS=101} [2022-01-18 22:40:56,256 INFO L334 CegarLoopForPetriNet]: 120 programPoint places, 1 predicate places. [2022-01-18 22:40:56,256 INFO L470 AbstractCegarLoop]: Abstraction has has 121 places, 101 transitions, 256 flow [2022-01-18 22:40:56,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 92.0) internal successors, (920), 10 states have internal predecessors, (920), 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) [2022-01-18 22:40:56,257 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:40:56,257 INFO L254 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] [2022-01-18 22:40:56,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 22:40:56,257 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2022-01-18 22:40:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:40:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1375894321, now seen corresponding path program 3 times [2022-01-18 22:40:56,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:40:56,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623001074] [2022-01-18 22:40:56,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:40:56,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:40:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:40:56,298 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:40:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:40:56,365 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:40:56,365 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:40:56,366 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-01-18 22:40:56,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-01-18 22:40:56,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2022-01-18 22:40:56,367 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2022-01-18 22:40:56,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2022-01-18 22:40:56,368 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-01-18 22:40:56,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 22:40:56,370 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:40:56,373 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:40:56,373 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:40:56,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:40:56 BasicIcfg [2022-01-18 22:40:56,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:40:56,448 INFO L158 Benchmark]: Toolchain (without parser) took 5643.16ms. Allocated memory was 350.2MB in the beginning and 511.7MB in the end (delta: 161.5MB). Free memory was 296.0MB in the beginning and 252.4MB in the end (delta: 43.6MB). Peak memory consumption was 207.1MB. Max. memory is 16.0GB. [2022-01-18 22:40:56,448 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 350.2MB. Free memory is still 313.9MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:40:56,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.93ms. Allocated memory is still 350.2MB. Free memory was 295.6MB in the beginning and 309.5MB in the end (delta: -13.9MB). Peak memory consumption was 17.9MB. Max. memory is 16.0GB. [2022-01-18 22:40:56,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.64ms. Allocated memory is still 350.2MB. Free memory was 309.5MB in the beginning and 305.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-18 22:40:56,449 INFO L158 Benchmark]: Boogie Preprocessor took 47.23ms. Allocated memory is still 350.2MB. Free memory was 305.3MB in the beginning and 303.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:40:56,449 INFO L158 Benchmark]: RCFGBuilder took 886.87ms. Allocated memory is still 350.2MB. Free memory was 303.2MB in the beginning and 196.3MB in the end (delta: 107.0MB). Peak memory consumption was 107.0MB. Max. memory is 16.0GB. [2022-01-18 22:40:56,449 INFO L158 Benchmark]: TraceAbstraction took 4228.36ms. Allocated memory was 350.2MB in the beginning and 511.7MB in the end (delta: 161.5MB). Free memory was 195.2MB in the beginning and 252.4MB in the end (delta: -57.2MB). Peak memory consumption was 107.4MB. Max. memory is 16.0GB. [2022-01-18 22:40:56,452 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.11ms. Allocated memory is still 350.2MB. Free memory is still 313.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 405.93ms. Allocated memory is still 350.2MB. Free memory was 295.6MB in the beginning and 309.5MB in the end (delta: -13.9MB). Peak memory consumption was 17.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.64ms. Allocated memory is still 350.2MB. Free memory was 309.5MB in the beginning and 305.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.23ms. Allocated memory is still 350.2MB. Free memory was 305.3MB in the beginning and 303.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 886.87ms. Allocated memory is still 350.2MB. Free memory was 303.2MB in the beginning and 196.3MB in the end (delta: 107.0MB). Peak memory consumption was 107.0MB. Max. memory is 16.0GB. * TraceAbstraction took 4228.36ms. Allocated memory was 350.2MB in the beginning and 511.7MB in the end (delta: 161.5MB). Free memory was 195.2MB in the beginning and 252.4MB in the end (delta: -57.2MB). Peak memory consumption was 107.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L713] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L714] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L715] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L717] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L719] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L720] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L721] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L722] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L723] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L724] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L725] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L726] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L727] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L728] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L729] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L730] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L731] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L732] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L733] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L734] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L735] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L738] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L831] 0 pthread_t t763; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t763={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L832] FCALL, FORK 0 pthread_create(&t763, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t763, ((void *)0), P0, ((void *)0))=-2, t763={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L833] 0 pthread_t t764; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t763={5:0}, t764={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t764, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t764, ((void *)0), P1, ((void *)0))=-1, t763={5:0}, t764={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] 0 pthread_t t765; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t765, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t765, ((void *)0), P2, ((void *)0))=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L782] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L782] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1 [L794] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L849] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L850] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L851] 0 y$flush_delayed = weak$$choice2 [L852] 0 y$mem_tmp = y [L853] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L853] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L854] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L854] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L854] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L854] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L855] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L855] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L855] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L855] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L856] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L856] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L856] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L857] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L857] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L857] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L858] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L858] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L858] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L858] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L859] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L859] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L859] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L860] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L861] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L861] 0 y = y$flush_delayed ? y$mem_tmp : y [L862] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t763={5:0}, t764={6:0}, t765={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.0s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 372 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 637 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 912 IncrementalHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 57 mSDtfsCounter, 912 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=5, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 706 ConstructedInterpolants, 0 QuantifiedInterpolants, 2256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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! [2022-01-18 22:40:56,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...