./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-18 21:07:35,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 21:07:35,551 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 21:07:35,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 21:07:35,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 21:07:35,598 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 21:07:35,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 21:07:35,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 21:07:35,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 21:07:35,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 21:07:35,614 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 21:07:35,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 21:07:35,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 21:07:35,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 21:07:35,627 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 21:07:35,628 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 21:07:35,630 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 21:07:35,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 21:07:35,633 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 21:07:35,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 21:07:35,644 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 21:07:35,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 21:07:35,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 21:07:35,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 21:07:35,657 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 21:07:35,658 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 21:07:35,658 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 21:07:35,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 21:07:35,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 21:07:35,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 21:07:35,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 21:07:35,665 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 21:07:35,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 21:07:35,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 21:07:35,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 21:07:35,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 21:07:35,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 21:07:35,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 21:07:35,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 21:07:35,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 21:07:35,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 21:07:35,676 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 21:07:35,728 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 21:07:35,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 21:07:35,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 21:07:35,730 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 21:07:35,731 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 21:07:35,731 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 21:07:35,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 21:07:35,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 21:07:35,733 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 21:07:35,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 21:07:35,734 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 21:07:35,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 21:07:35,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 21:07:35,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 21:07:35,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 21:07:35,736 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 21:07:35,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 21:07:35,737 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 21:07:35,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 21:07:35,737 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 21:07:35,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 21:07:35,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 21:07:35,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 21:07:35,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 21:07:35,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:07:35,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 21:07:35,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 21:07:35,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 21:07:35,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 21:07:35,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 21:07:35,742 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 21:07:35,742 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 21:07:35,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 21:07:35,743 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2022-11-18 21:07:36,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 21:07:36,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 21:07:36,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 21:07:36,129 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 21:07:36,130 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 21:07:36,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-11-18 21:07:36,229 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/data/361c8a746/a83bfec98f50451da63d224db2bb962d/FLAGf4ff533f3 [2022-11-18 21:07:36,962 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 21:07:36,963 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2022-11-18 21:07:36,980 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/data/361c8a746/a83bfec98f50451da63d224db2bb962d/FLAGf4ff533f3 [2022-11-18 21:07:36,993 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/data/361c8a746/a83bfec98f50451da63d224db2bb962d [2022-11-18 21:07:36,996 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 21:07:36,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 21:07:37,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 21:07:37,003 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 21:07:37,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 21:07:37,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:07:36" (1/1) ... [2022-11-18 21:07:37,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f370330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37, skipping insertion in model container [2022-11-18 21:07:37,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:07:36" (1/1) ... [2022-11-18 21:07:37,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 21:07:37,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 21:07:37,361 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-11-18 21:07:37,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:07:37,712 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 21:07:37,729 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i[1001,1014] [2022-11-18 21:07:37,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 21:07:37,869 INFO L208 MainTranslator]: Completed translation [2022-11-18 21:07:37,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37 WrapperNode [2022-11-18 21:07:37,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 21:07:37,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 21:07:37,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 21:07:37,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 21:07:37,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (1/1) ... [2022-11-18 21:07:37,913 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (1/1) ... [2022-11-18 21:07:37,951 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-11-18 21:07:37,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 21:07:37,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 21:07:37,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 21:07:37,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 21:07:37,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (1/1) ... [2022-11-18 21:07:37,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (1/1) ... [2022-11-18 21:07:37,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (1/1) ... [2022-11-18 21:07:37,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (1/1) ... [2022-11-18 21:07:37,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (1/1) ... [2022-11-18 21:07:37,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (1/1) ... [2022-11-18 21:07:37,985 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (1/1) ... [2022-11-18 21:07:37,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (1/1) ... [2022-11-18 21:07:37,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 21:07:37,992 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 21:07:37,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 21:07:37,992 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 21:07:37,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (1/1) ... [2022-11-18 21:07:38,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 21:07:38,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 21:07:38,029 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 21:07:38,067 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 21:07:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 21:07:38,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 21:07:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 21:07:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 21:07:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 21:07:38,093 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 21:07:38,093 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 21:07:38,094 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 21:07:38,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 21:07:38,095 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 21:07:38,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 21:07:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 21:07:38,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 21:07:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 21:07:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 21:07:38,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 21:07:38,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 21:07:38,098 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 21:07:38,370 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 21:07:38,373 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 21:07:38,848 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 21:07:38,991 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 21:07:38,992 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 21:07:38,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:07:38 BoogieIcfgContainer [2022-11-18 21:07:38,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 21:07:38,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 21:07:39,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 21:07:39,003 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 21:07:39,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:07:36" (1/3) ... [2022-11-18 21:07:39,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba36acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:07:39, skipping insertion in model container [2022-11-18 21:07:39,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:07:37" (2/3) ... [2022-11-18 21:07:39,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba36acb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:07:39, skipping insertion in model container [2022-11-18 21:07:39,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:07:38" (3/3) ... [2022-11-18 21:07:39,007 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2022-11-18 21:07:39,017 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 21:07:39,028 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 21:07:39,028 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 21:07:39,028 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 21:07:39,105 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 21:07:39,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-18 21:07:39,232 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-18 21:07:39,232 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:07:39,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-11-18 21:07:39,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-18 21:07:39,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-18 21:07:39,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 21:07:39,284 INFO L357 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=true, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@255d4f81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 21:07:39,284 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-18 21:07:39,305 INFO L130 PetriNetUnfolder]: 0/63 cut-off events. [2022-11-18 21:07:39,305 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 21:07:39,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:39,306 INFO L209 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] [2022-11-18 21:07:39,307 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:07:39,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:39,313 INFO L85 PathProgramCache]: Analyzing trace with hash 826960451, now seen corresponding path program 1 times [2022-11-18 21:07:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:39,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973241486] [2022-11-18 21:07:39,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:39,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:07:40,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:40,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973241486] [2022-11-18 21:07:40,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973241486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:40,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:40,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 21:07:40,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249211787] [2022-11-18 21:07:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:40,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 21:07:40,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 21:07:40,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 21:07:40,160 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 137 [2022-11-18 21:07:40,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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-11-18 21:07:40,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:40,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 137 [2022-11-18 21:07:40,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:40,541 INFO L130 PetriNetUnfolder]: 109/538 cut-off events. [2022-11-18 21:07:40,541 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-11-18 21:07:40,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 764 conditions, 538 events. 109/538 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2749 event pairs, 67 based on Foata normal form. 22/515 useless extension candidates. Maximal degree in co-relation 706. Up to 131 conditions per place. [2022-11-18 21:07:40,550 INFO L137 encePairwiseOnDemand]: 132/137 looper letters, 15 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2022-11-18 21:07:40,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 135 transitions, 322 flow [2022-11-18 21:07:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 21:07:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 21:07:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-11-18 21:07:40,567 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2022-11-18 21:07:40,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-11-18 21:07:40,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-11-18 21:07:40,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:40,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-11-18 21:07:40,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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-11-18 21:07:40,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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-11-18 21:07:40,586 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 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-11-18 21:07:40,588 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 388 transitions. [2022-11-18 21:07:40,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 135 transitions, 322 flow [2022-11-18 21:07:40,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 135 transitions, 316 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 21:07:40,598 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-11-18 21:07:40,601 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-11-18 21:07:40,605 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-11-18 21:07:40,605 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-11-18 21:07:40,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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-11-18 21:07:40,606 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:40,606 INFO L209 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] [2022-11-18 21:07:40,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 21:07:40,607 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:07:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1893955568, now seen corresponding path program 1 times [2022-11-18 21:07:40,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:40,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104585892] [2022-11-18 21:07:40,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:40,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:07:41,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:41,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104585892] [2022-11-18 21:07:41,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104585892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:41,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:41,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:07:41,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891696040] [2022-11-18 21:07:41,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:41,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:07:41,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:41,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:07:41,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:07:41,417 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-11-18 21:07:41,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 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-11-18 21:07:41,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:41,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-11-18 21:07:41,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:44,841 INFO L130 PetriNetUnfolder]: 4676/10347 cut-off events. [2022-11-18 21:07:44,841 INFO L131 PetriNetUnfolder]: For 482/482 co-relation queries the response was YES. [2022-11-18 21:07:44,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17515 conditions, 10347 events. 4676/10347 cut-off events. For 482/482 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 94083 event pairs, 530 based on Foata normal form. 0/10131 useless extension candidates. Maximal degree in co-relation 17454. Up to 2269 conditions per place. [2022-11-18 21:07:44,927 INFO L137 encePairwiseOnDemand]: 127/137 looper letters, 39 selfloop transitions, 6 changer transitions 98/232 dead transitions. [2022-11-18 21:07:44,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 232 transitions, 758 flow [2022-11-18 21:07:44,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 21:07:44,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 21:07:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1511 transitions. [2022-11-18 21:07:44,936 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8483997754070747 [2022-11-18 21:07:44,936 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1511 transitions. [2022-11-18 21:07:44,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1511 transitions. [2022-11-18 21:07:44,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:44,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1511 transitions. [2022-11-18 21:07:44,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.23076923076923) internal successors, (1511), 13 states have internal predecessors, (1511), 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-11-18 21:07:45,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-11-18 21:07:45,038 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-11-18 21:07:45,038 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 13 states and 1511 transitions. [2022-11-18 21:07:45,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 232 transitions, 758 flow [2022-11-18 21:07:45,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 232 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 21:07:45,047 INFO L231 Difference]: Finished difference. Result has 162 places, 119 transitions, 324 flow [2022-11-18 21:07:45,048 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=324, PETRI_PLACES=162, PETRI_TRANSITIONS=119} [2022-11-18 21:07:45,051 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 18 predicate places. [2022-11-18 21:07:45,052 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 119 transitions, 324 flow [2022-11-18 21:07:45,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 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-11-18 21:07:45,053 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:45,053 INFO L209 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-11-18 21:07:45,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 21:07:45,053 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:07:45,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1064717220, now seen corresponding path program 1 times [2022-11-18 21:07:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:45,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854969094] [2022-11-18 21:07:45,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:07:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:45,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854969094] [2022-11-18 21:07:45,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854969094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:45,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:45,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 21:07:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192356592] [2022-11-18 21:07:45,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:45,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 21:07:45,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:45,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 21:07:45,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 21:07:45,346 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-18 21:07:45,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 119 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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-11-18 21:07:45,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:45,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-18 21:07:45,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:47,792 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [99#L802true, 32#L838true, 191#true, 155#true, P1Thread1of1ForFork2InUse, 69#L825true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 7#L775true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 89#L872true, Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-18 21:07:47,792 INFO L383 tUnfolder$Statistics]: this new event has 89 ancestors and is cut-off event [2022-11-18 21:07:47,793 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 21:07:47,793 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 21:07:47,793 INFO L386 tUnfolder$Statistics]: existing Event has 89 ancestors and is cut-off event [2022-11-18 21:07:48,491 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [99#L802true, 32#L838true, 80#L873-1true, 191#true, 155#true, P1Thread1of1ForFork2InUse, 69#L825true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 7#L775true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-18 21:07:48,492 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-11-18 21:07:48,492 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 21:07:48,492 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 21:07:48,492 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 21:07:48,764 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [99#L802true, 32#L838true, 191#true, 66#L3true, 155#true, P1Thread1of1ForFork2InUse, 69#L825true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 7#L775true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-18 21:07:48,765 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-11-18 21:07:48,765 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 21:07:48,765 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 21:07:48,765 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 21:07:48,999 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [99#L802true, 32#L838true, 191#true, 155#true, P1Thread1of1ForFork2InUse, 69#L825true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, 90#L4true, Black: 175#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 7#L775true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-18 21:07:49,000 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-18 21:07:49,000 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 21:07:49,000 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 21:07:49,000 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 21:07:49,367 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][184], [99#L802true, 32#L838true, 155#true, P1Thread1of1ForFork2InUse, 69#L825true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 101#L4-1true, Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 7#L775true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 196#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-18 21:07:49,368 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-18 21:07:49,368 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:07:49,368 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:07:49,368 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:07:49,370 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [99#L802true, 32#L838true, 191#true, 155#true, P1Thread1of1ForFork2InUse, 69#L825true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 135#L3-1true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 7#L775true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-18 21:07:49,370 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-18 21:07:49,370 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:07:49,371 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:07:49,371 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 21:07:49,543 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L880-->L883: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= 2 v_~z~0_5) (= v_~__unbuffered_p1_EAX~0_3 0) (= 2 v_~__unbuffered_p3_EAX~0_3) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p0_EAX~0_3 0))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][185], [24#L835true, 191#true, 155#true, P1Thread1of1ForFork2InUse, 69#L825true, 40#L883true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 138#L795true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 7#L775true, Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-18 21:07:49,544 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-11-18 21:07:49,544 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-18 21:07:49,544 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-18 21:07:49,544 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-18 21:07:49,709 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([394] L795-->L802: Formula: (let ((.cse3 (not (= (mod v_~x$w_buff0_used~0_109 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_39 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd2~0_28 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff1_used~0_103 256) 0)) .cse4)) (.cse1 (and .cse3 .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff0_used~0_110 256) 0)) .cse5))) (and (= v_~x$w_buff1_used~0_102 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_103)) (= (ite .cse2 v_~x$w_buff0~0_39 (ite .cse0 v_~x$w_buff1~0_32 v_~x~0_49)) v_~x~0_48) (= (ite .cse1 0 v_~x$r_buff0_thd2~0_39) v_~x$r_buff0_thd2~0_38) (= v_~x$r_buff1_thd2~0_27 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_38 256) 0)) .cse3) (and (not (= (mod v_~x$w_buff1_used~0_102 256) 0)) .cse4)) 0 v_~x$r_buff1_thd2~0_28)) (= v_~x$w_buff0_used~0_109 (ite .cse2 0 v_~x$w_buff0_used~0_110))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_103, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_39, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_110} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_32, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_27, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_102, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_38, ~x~0=v_~x~0_48, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_109} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][140], [99#L802true, 32#L838true, 191#true, 155#true, P1Thread1of1ForFork2InUse, 69#L825true, P3Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 171#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork3InUse, Black: 175#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 165#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 39#L880true, Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), 7#L775true, Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 163#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-18 21:07:49,709 INFO L383 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-11-18 21:07:49,709 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-18 21:07:49,710 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-18 21:07:49,710 INFO L386 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-11-18 21:07:50,162 INFO L130 PetriNetUnfolder]: 11051/18639 cut-off events. [2022-11-18 21:07:50,162 INFO L131 PetriNetUnfolder]: For 16534/18458 co-relation queries the response was YES. [2022-11-18 21:07:50,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43508 conditions, 18639 events. 11051/18639 cut-off events. For 16534/18458 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 154219 event pairs, 1049 based on Foata normal form. 52/17393 useless extension candidates. Maximal degree in co-relation 43439. Up to 6048 conditions per place. [2022-11-18 21:07:50,556 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 85 selfloop transitions, 20 changer transitions 0/201 dead transitions. [2022-11-18 21:07:50,557 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 201 transitions, 788 flow [2022-11-18 21:07:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 21:07:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 21:07:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1209 transitions. [2022-11-18 21:07:50,561 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8824817518248175 [2022-11-18 21:07:50,562 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1209 transitions. [2022-11-18 21:07:50,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1209 transitions. [2022-11-18 21:07:50,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:50,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1209 transitions. [2022-11-18 21:07:50,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.9) internal successors, (1209), 10 states have internal predecessors, (1209), 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-11-18 21:07:50,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-11-18 21:07:50,576 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 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-11-18 21:07:50,576 INFO L175 Difference]: Start difference. First operand has 162 places, 119 transitions, 324 flow. Second operand 10 states and 1209 transitions. [2022-11-18 21:07:50,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 201 transitions, 788 flow [2022-11-18 21:07:50,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 201 transitions, 774 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-11-18 21:07:50,676 INFO L231 Difference]: Finished difference. Result has 150 places, 137 transitions, 453 flow [2022-11-18 21:07:50,677 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=453, PETRI_PLACES=150, PETRI_TRANSITIONS=137} [2022-11-18 21:07:50,681 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 6 predicate places. [2022-11-18 21:07:50,682 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 137 transitions, 453 flow [2022-11-18 21:07:50,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.0) internal successors, (678), 6 states have internal predecessors, (678), 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-11-18 21:07:50,687 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:50,687 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:50,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 21:07:50,689 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:07:50,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:50,691 INFO L85 PathProgramCache]: Analyzing trace with hash 877156109, now seen corresponding path program 1 times [2022-11-18 21:07:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:50,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145857328] [2022-11-18 21:07:50,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:07:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:51,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145857328] [2022-11-18 21:07:51,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145857328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:51,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:51,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:07:51,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201611382] [2022-11-18 21:07:51,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:51,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:07:51,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:51,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:07:51,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:07:51,167 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-18 21:07:51,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 137 transitions, 453 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-11-18 21:07:51,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:51,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-18 21:07:51,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:54,920 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([286] L880-->L883: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= 2 v_~z~0_5) (= v_~__unbuffered_p1_EAX~0_3 0) (= 2 v_~__unbuffered_p3_EAX~0_3) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p0_EAX~0_3 0))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_5, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3} AuxVars[] AssignedVars[~main$tmp_guard1~0][227], [24#L835true, 155#true, P1Thread1of1ForFork2InUse, 69#L825true, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 214#true, Black: 194#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P3Thread1of1ForFork1InUse, Black: 198#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), P0Thread1of1ForFork0InUse, Black: 206#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork3InUse, Black: 202#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 138#L795true, 7#L775true, 191#true, 40#L883true, Black: 177#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 157#(= ~__unbuffered_p3_EAX~0 0), Black: 169#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 173#(and (<= 1 ~main$tmp_guard1~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 167#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 158#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2022-11-18 21:07:54,920 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-11-18 21:07:54,921 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-18 21:07:54,921 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-18 21:07:54,921 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-11-18 21:07:55,116 INFO L130 PetriNetUnfolder]: 10394/18005 cut-off events. [2022-11-18 21:07:55,117 INFO L131 PetriNetUnfolder]: For 32588/34456 co-relation queries the response was YES. [2022-11-18 21:07:55,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55723 conditions, 18005 events. 10394/18005 cut-off events. For 32588/34456 co-relation queries the response was YES. Maximal size of possible extension queue 1445. Compared 155524 event pairs, 744 based on Foata normal form. 332/17465 useless extension candidates. Maximal degree in co-relation 55649. Up to 3918 conditions per place. [2022-11-18 21:07:55,323 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 108 selfloop transitions, 38 changer transitions 2/244 dead transitions. [2022-11-18 21:07:55,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 244 transitions, 1289 flow [2022-11-18 21:07:55,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 21:07:55,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 21:07:55,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1576 transitions. [2022-11-18 21:07:55,330 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8848961257720381 [2022-11-18 21:07:55,330 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1576 transitions. [2022-11-18 21:07:55,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1576 transitions. [2022-11-18 21:07:55,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:55,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1576 transitions. [2022-11-18 21:07:55,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.23076923076923) internal successors, (1576), 13 states have internal predecessors, (1576), 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-11-18 21:07:55,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-11-18 21:07:55,343 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 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-11-18 21:07:55,343 INFO L175 Difference]: Start difference. First operand has 150 places, 137 transitions, 453 flow. Second operand 13 states and 1576 transitions. [2022-11-18 21:07:55,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 244 transitions, 1289 flow [2022-11-18 21:07:55,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 244 transitions, 1281 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-11-18 21:07:55,636 INFO L231 Difference]: Finished difference. Result has 164 places, 157 transitions, 738 flow [2022-11-18 21:07:55,637 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=738, PETRI_PLACES=164, PETRI_TRANSITIONS=157} [2022-11-18 21:07:55,639 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 20 predicate places. [2022-11-18 21:07:55,639 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 157 transitions, 738 flow [2022-11-18 21:07:55,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 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-11-18 21:07:55,640 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:07:55,640 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:07:55,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 21:07:55,640 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:07:55,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:07:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash 656799503, now seen corresponding path program 1 times [2022-11-18 21:07:55,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:07:55,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642221163] [2022-11-18 21:07:55,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:07:55,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:07:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:07:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:07:56,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:07:56,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642221163] [2022-11-18 21:07:56,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642221163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:07:56,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:07:56,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:07:56,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506461037] [2022-11-18 21:07:56,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:07:56,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:07:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:07:56,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:07:56,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:07:56,098 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-18 21:07:56,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 157 transitions, 738 flow. Second operand has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 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-11-18 21:07:56,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:07:56,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-18 21:07:56,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:07:59,384 INFO L130 PetriNetUnfolder]: 3344/10643 cut-off events. [2022-11-18 21:07:59,384 INFO L131 PetriNetUnfolder]: For 29928/36958 co-relation queries the response was YES. [2022-11-18 21:07:59,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35883 conditions, 10643 events. 3344/10643 cut-off events. For 29928/36958 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 131276 event pairs, 377 based on Foata normal form. 198/10088 useless extension candidates. Maximal degree in co-relation 35803. Up to 2685 conditions per place. [2022-11-18 21:07:59,754 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 64 selfloop transitions, 6 changer transitions 0/205 dead transitions. [2022-11-18 21:07:59,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 205 transitions, 1064 flow [2022-11-18 21:07:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 21:07:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 21:07:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 848 transitions. [2022-11-18 21:07:59,758 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8842544316996872 [2022-11-18 21:07:59,758 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 848 transitions. [2022-11-18 21:07:59,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 848 transitions. [2022-11-18 21:07:59,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:07:59,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 848 transitions. [2022-11-18 21:07:59,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 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-11-18 21:07:59,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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-11-18 21:07:59,765 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 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-11-18 21:07:59,765 INFO L175 Difference]: Start difference. First operand has 164 places, 157 transitions, 738 flow. Second operand 7 states and 848 transitions. [2022-11-18 21:07:59,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 205 transitions, 1064 flow [2022-11-18 21:08:00,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 205 transitions, 969 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-11-18 21:08:00,952 INFO L231 Difference]: Finished difference. Result has 171 places, 162 transitions, 708 flow [2022-11-18 21:08:00,953 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=708, PETRI_PLACES=171, PETRI_TRANSITIONS=162} [2022-11-18 21:08:00,956 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 27 predicate places. [2022-11-18 21:08:00,956 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 162 transitions, 708 flow [2022-11-18 21:08:00,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 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-11-18 21:08:00,957 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:08:00,957 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:08:00,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 21:08:00,992 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:08:00,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:00,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1626177431, now seen corresponding path program 2 times [2022-11-18 21:08:00,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:00,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129653920] [2022-11-18 21:08:00,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:00,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:01,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:08:01,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:01,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129653920] [2022-11-18 21:08:01,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129653920] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:01,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:01,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 21:08:01,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140604930] [2022-11-18 21:08:01,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:01,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 21:08:01,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:01,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 21:08:01,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 21:08:01,402 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-18 21:08:01,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 162 transitions, 708 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-11-18 21:08:01,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:08:01,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-18 21:08:01,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:08:08,054 INFO L130 PetriNetUnfolder]: 17234/30431 cut-off events. [2022-11-18 21:08:08,055 INFO L131 PetriNetUnfolder]: For 84699/89873 co-relation queries the response was YES. [2022-11-18 21:08:08,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103483 conditions, 30431 events. 17234/30431 cut-off events. For 84699/89873 co-relation queries the response was YES. Maximal size of possible extension queue 2450. Compared 291802 event pairs, 850 based on Foata normal form. 462/29411 useless extension candidates. Maximal degree in co-relation 103400. Up to 4256 conditions per place. [2022-11-18 21:08:08,334 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 108 selfloop transitions, 58 changer transitions 30/294 dead transitions. [2022-11-18 21:08:08,335 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 294 transitions, 1928 flow [2022-11-18 21:08:08,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 21:08:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 21:08:08,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1942 transitions. [2022-11-18 21:08:08,341 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8859489051094891 [2022-11-18 21:08:08,341 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1942 transitions. [2022-11-18 21:08:08,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1942 transitions. [2022-11-18 21:08:08,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:08:08,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1942 transitions. [2022-11-18 21:08:08,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 121.375) internal successors, (1942), 16 states have internal predecessors, (1942), 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-11-18 21:08:08,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 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-11-18 21:08:08,355 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 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-11-18 21:08:08,355 INFO L175 Difference]: Start difference. First operand has 171 places, 162 transitions, 708 flow. Second operand 16 states and 1942 transitions. [2022-11-18 21:08:08,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 294 transitions, 1928 flow [2022-11-18 21:08:11,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 294 transitions, 1925 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-18 21:08:11,739 INFO L231 Difference]: Finished difference. Result has 189 places, 185 transitions, 1142 flow [2022-11-18 21:08:11,739 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1142, PETRI_PLACES=189, PETRI_TRANSITIONS=185} [2022-11-18 21:08:11,740 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 45 predicate places. [2022-11-18 21:08:11,740 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 185 transitions, 1142 flow [2022-11-18 21:08:11,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 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-11-18 21:08:11,742 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:08:11,743 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:08:11,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 21:08:11,743 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:08:11,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:11,744 INFO L85 PathProgramCache]: Analyzing trace with hash -798407495, now seen corresponding path program 1 times [2022-11-18 21:08:11,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:11,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747496007] [2022-11-18 21:08:11,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:11,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:12,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:08:12,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:12,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747496007] [2022-11-18 21:08:12,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747496007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:12,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:12,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 21:08:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396126690] [2022-11-18 21:08:12,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:12,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 21:08:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:12,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 21:08:12,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 21:08:12,371 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 137 [2022-11-18 21:08:12,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 185 transitions, 1142 flow. Second operand has 9 states, 9 states have (on average 113.11111111111111) internal successors, (1018), 9 states have internal predecessors, (1018), 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-11-18 21:08:12,374 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:08:12,374 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 137 [2022-11-18 21:08:12,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:08:18,670 INFO L130 PetriNetUnfolder]: 16984/30261 cut-off events. [2022-11-18 21:08:18,670 INFO L131 PetriNetUnfolder]: For 114244/119452 co-relation queries the response was YES. [2022-11-18 21:08:18,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113345 conditions, 30261 events. 16984/30261 cut-off events. For 114244/119452 co-relation queries the response was YES. Maximal size of possible extension queue 2362. Compared 293657 event pairs, 817 based on Foata normal form. 325/29258 useless extension candidates. Maximal degree in co-relation 113312. Up to 4058 conditions per place. [2022-11-18 21:08:18,952 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 80 selfloop transitions, 59 changer transitions 55/292 dead transitions. [2022-11-18 21:08:18,952 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 292 transitions, 2129 flow [2022-11-18 21:08:18,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 21:08:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 21:08:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2262 transitions. [2022-11-18 21:08:18,959 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8689973107952362 [2022-11-18 21:08:18,959 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2262 transitions. [2022-11-18 21:08:18,959 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2262 transitions. [2022-11-18 21:08:18,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:08:18,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2262 transitions. [2022-11-18 21:08:18,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 119.05263157894737) internal successors, (2262), 19 states have internal predecessors, (2262), 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-11-18 21:08:18,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 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-11-18 21:08:18,976 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 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-11-18 21:08:18,976 INFO L175 Difference]: Start difference. First operand has 189 places, 185 transitions, 1142 flow. Second operand 19 states and 2262 transitions. [2022-11-18 21:08:18,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 292 transitions, 2129 flow [2022-11-18 21:08:27,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 292 transitions, 1728 flow, removed 157 selfloop flow, removed 15 redundant places. [2022-11-18 21:08:27,836 INFO L231 Difference]: Finished difference. Result has 196 places, 180 transitions, 951 flow [2022-11-18 21:08:27,837 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=951, PETRI_PLACES=196, PETRI_TRANSITIONS=180} [2022-11-18 21:08:27,837 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 52 predicate places. [2022-11-18 21:08:27,838 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 180 transitions, 951 flow [2022-11-18 21:08:27,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.11111111111111) internal successors, (1018), 9 states have internal predecessors, (1018), 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-11-18 21:08:27,839 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:08:27,839 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:08:27,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 21:08:27,839 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:08:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:27,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1244437423, now seen corresponding path program 1 times [2022-11-18 21:08:27,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:27,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319757216] [2022-11-18 21:08:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:08:28,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:28,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319757216] [2022-11-18 21:08:28,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319757216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:28,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:28,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 21:08:28,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390851135] [2022-11-18 21:08:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:28,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 21:08:28,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:28,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 21:08:28,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 21:08:28,357 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 137 [2022-11-18 21:08:28,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 180 transitions, 951 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 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-11-18 21:08:28,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:08:28,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 137 [2022-11-18 21:08:28,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:08:30,697 INFO L130 PetriNetUnfolder]: 4302/14351 cut-off events. [2022-11-18 21:08:30,697 INFO L131 PetriNetUnfolder]: For 32659/34312 co-relation queries the response was YES. [2022-11-18 21:08:30,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46036 conditions, 14351 events. 4302/14351 cut-off events. For 32659/34312 co-relation queries the response was YES. Maximal size of possible extension queue 1866. Compared 196998 event pairs, 75 based on Foata normal form. 8/13393 useless extension candidates. Maximal degree in co-relation 45942. Up to 1382 conditions per place. [2022-11-18 21:08:30,846 INFO L137 encePairwiseOnDemand]: 125/137 looper letters, 47 selfloop transitions, 16 changer transitions 7/216 dead transitions. [2022-11-18 21:08:30,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 216 transitions, 1279 flow [2022-11-18 21:08:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 21:08:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 21:08:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 894 transitions. [2022-11-18 21:08:30,850 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8156934306569343 [2022-11-18 21:08:30,851 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 894 transitions. [2022-11-18 21:08:30,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 894 transitions. [2022-11-18 21:08:30,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:08:30,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 894 transitions. [2022-11-18 21:08:30,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.75) internal successors, (894), 8 states have internal predecessors, (894), 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-11-18 21:08:30,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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-11-18 21:08:30,858 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 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-11-18 21:08:30,858 INFO L175 Difference]: Start difference. First operand has 196 places, 180 transitions, 951 flow. Second operand 8 states and 894 transitions. [2022-11-18 21:08:30,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 216 transitions, 1279 flow [2022-11-18 21:08:32,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 216 transitions, 1098 flow, removed 46 selfloop flow, removed 17 redundant places. [2022-11-18 21:08:32,303 INFO L231 Difference]: Finished difference. Result has 189 places, 191 transitions, 966 flow [2022-11-18 21:08:32,303 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=966, PETRI_PLACES=189, PETRI_TRANSITIONS=191} [2022-11-18 21:08:32,304 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 45 predicate places. [2022-11-18 21:08:32,304 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 191 transitions, 966 flow [2022-11-18 21:08:32,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 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-11-18 21:08:32,305 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:08:32,305 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:08:32,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 21:08:32,306 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:08:32,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:32,306 INFO L85 PathProgramCache]: Analyzing trace with hash 993518423, now seen corresponding path program 2 times [2022-11-18 21:08:32,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:32,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713229889] [2022-11-18 21:08:32,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:32,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 21:08:35,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 21:08:35,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 21:08:35,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713229889] [2022-11-18 21:08:35,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713229889] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 21:08:35,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 21:08:35,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-18 21:08:35,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819820518] [2022-11-18 21:08:35,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 21:08:35,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-18 21:08:35,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 21:08:35,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-18 21:08:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-18 21:08:35,291 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 137 [2022-11-18 21:08:35,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 191 transitions, 966 flow. Second operand has 15 states, 15 states have (on average 104.93333333333334) internal successors, (1574), 15 states have internal predecessors, (1574), 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-11-18 21:08:35,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 21:08:35,293 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 137 [2022-11-18 21:08:35,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 21:08:39,678 INFO L130 PetriNetUnfolder]: 9229/30186 cut-off events. [2022-11-18 21:08:39,678 INFO L131 PetriNetUnfolder]: For 54123/55099 co-relation queries the response was YES. [2022-11-18 21:08:39,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88051 conditions, 30186 events. 9229/30186 cut-off events. For 54123/55099 co-relation queries the response was YES. Maximal size of possible extension queue 3833. Compared 463548 event pairs, 95 based on Foata normal form. 25/28375 useless extension candidates. Maximal degree in co-relation 88019. Up to 3138 conditions per place. [2022-11-18 21:08:39,993 INFO L137 encePairwiseOnDemand]: 122/137 looper letters, 45 selfloop transitions, 20 changer transitions 7/232 dead transitions. [2022-11-18 21:08:39,993 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 232 transitions, 1298 flow [2022-11-18 21:08:39,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 21:08:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 21:08:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1608 transitions. [2022-11-18 21:08:39,998 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7824817518248175 [2022-11-18 21:08:39,998 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1608 transitions. [2022-11-18 21:08:39,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1608 transitions. [2022-11-18 21:08:40,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 21:08:40,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1608 transitions. [2022-11-18 21:08:40,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 107.2) internal successors, (1608), 15 states have internal predecessors, (1608), 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-11-18 21:08:40,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 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-11-18 21:08:40,011 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 137.0) internal successors, (2192), 16 states have internal predecessors, (2192), 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-11-18 21:08:40,011 INFO L175 Difference]: Start difference. First operand has 189 places, 191 transitions, 966 flow. Second operand 15 states and 1608 transitions. [2022-11-18 21:08:40,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 232 transitions, 1298 flow [2022-11-18 21:08:49,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 232 transitions, 1286 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-11-18 21:08:49,603 INFO L231 Difference]: Finished difference. Result has 206 places, 205 transitions, 1126 flow [2022-11-18 21:08:49,603 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=958, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1126, PETRI_PLACES=206, PETRI_TRANSITIONS=205} [2022-11-18 21:08:49,604 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 62 predicate places. [2022-11-18 21:08:49,604 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 205 transitions, 1126 flow [2022-11-18 21:08:49,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 104.93333333333334) internal successors, (1574), 15 states have internal predecessors, (1574), 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-11-18 21:08:49,605 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 21:08:49,606 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 21:08:49,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 21:08:49,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 21:08:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 21:08:49,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2097891867, now seen corresponding path program 3 times [2022-11-18 21:08:49,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 21:08:49,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87868490] [2022-11-18 21:08:49,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 21:08:49,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 21:08:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:08:49,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 21:08:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 21:08:49,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 21:08:49,805 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 21:08:49,807 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-18 21:08:49,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-18 21:08:49,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-18 21:08:49,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-18 21:08:49,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-18 21:08:49,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-18 21:08:49,814 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-18 21:08:49,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 21:08:49,815 INFO L444 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2022-11-18 21:08:49,823 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 21:08:49,823 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 21:08:50,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:08:50 BasicIcfg [2022-11-18 21:08:50,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 21:08:50,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 21:08:50,024 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 21:08:50,025 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 21:08:50,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:07:38" (3/4) ... [2022-11-18 21:08:50,027 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 21:08:50,215 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 21:08:50,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 21:08:50,216 INFO L158 Benchmark]: Toolchain (without parser) took 73218.58ms. Allocated memory was 90.2MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 57.8MB in the beginning and 9.3GB in the end (delta: -9.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-11-18 21:08:50,216 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 90.2MB. Free memory was 44.3MB in the beginning and 44.3MB in the end (delta: 45.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:08:50,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 868.22ms. Allocated memory is still 90.2MB. Free memory was 57.6MB in the beginning and 53.4MB in the end (delta: 4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-18 21:08:50,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.12ms. Allocated memory is still 90.2MB. Free memory was 53.4MB in the beginning and 51.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:08:50,218 INFO L158 Benchmark]: Boogie Preprocessor took 38.96ms. Allocated memory is still 90.2MB. Free memory was 50.7MB in the beginning and 48.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 21:08:50,218 INFO L158 Benchmark]: RCFGBuilder took 1003.29ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 48.7MB in the beginning and 57.9MB in the end (delta: -9.2MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-11-18 21:08:50,218 INFO L158 Benchmark]: TraceAbstraction took 71023.59ms. Allocated memory was 109.1MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 57.0MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2022-11-18 21:08:50,219 INFO L158 Benchmark]: Witness Printer took 191.91ms. Allocated memory is still 11.1GB. Free memory was 9.4GB in the beginning and 9.3GB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-11-18 21:08:50,222 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.28ms. Allocated memory is still 90.2MB. Free memory was 44.3MB in the beginning and 44.3MB in the end (delta: 45.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 868.22ms. Allocated memory is still 90.2MB. Free memory was 57.6MB in the beginning and 53.4MB in the end (delta: 4.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.12ms. Allocated memory is still 90.2MB. Free memory was 53.4MB in the beginning and 51.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.96ms. Allocated memory is still 90.2MB. Free memory was 50.7MB in the beginning and 48.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1003.29ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 48.7MB in the beginning and 57.9MB in the end (delta: -9.2MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 71023.59ms. Allocated memory was 109.1MB in the beginning and 11.1GB in the end (delta: 11.0GB). Free memory was 57.0MB in the beginning and 9.4GB in the end (delta: -9.3GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Witness Printer took 191.91ms. Allocated memory is still 11.1GB. Free memory was 9.4GB in the beginning and 9.3GB in the end (delta: 35.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L726] 0 _Bool x$flush_delayed; VAL [x$flush_delayed=0] [L739] 0 int *x$read_delayed_var; VAL [x$flush_delayed=0, x$read_delayed_var={0:0}] [L748] 0 _Bool weak$$choice0; VAL [weak$$choice0=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L749] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$read_delayed_var={0:0}] [L727] 0 int x$mem_tmp; VAL [weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L713] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$read_delayed_var={0:0}] [L731] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd3=0, x$read_delayed_var={0:0}] [L732] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L729] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L715] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L730] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L719] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L728] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L721] 0 int a = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed_var={0:0}] [L738] 0 _Bool x$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L711] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L723] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L743] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L722] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L717] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff1_used=0] [L741] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0_used=0, x$w_buff1_used=0] [L740] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1_used=0] [L742] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L725] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L734] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L733] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L745] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L737] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L736] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L735] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t685; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=-3, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t686; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=-2, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L866] 0 pthread_t t687; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=-1, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L868] 0 pthread_t t688; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0: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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 19]: 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: 865]: 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: 869]: 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: 863]: 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: 867]: 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 9 procedures, 173 locations, 7 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: 70.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 62.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 920 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 920 mSDsluCounter, 544 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 439 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1528 IncrementalHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 105 mSDtfsCounter, 1528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1142occurred in iteration=6, InterpolantAutomatonStates: 104, 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.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 935 NumberOfCodeBlocks, 935 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 820 ConstructedInterpolants, 0 QuantifiedInterpolants, 4299 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-11-18 21:08:50,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84e970ca-72b8-4d6f-b9f8-10546248f79d/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE