./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP --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 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:27,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:27,154 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:53:27,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:27,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:27,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:27,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:27,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:27,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:27,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:27,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:27,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:27,192 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:27,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:27,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:53:27,194 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:53:27,195 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:27,195 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:53:27,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:27,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:53:27,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:27,198 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:53:27,199 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:53:27,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:53:27,200 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:27,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:27,201 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:27,202 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:27,202 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:27,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:27,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:27,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:53:27,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:53:27,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:53:27,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:27,206 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:53:27,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:27,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:27,207 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:27,207 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/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_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP 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 -> 0b278c8af08551c2e27294e2c5dca8c5bd0f6f00874366f88466c32210c557af [2023-11-06 21:53:27,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:27,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:27,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:27,527 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:27,528 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:27,529 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-06 21:53:30,668 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:30,994 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:30,994 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i [2023-11-06 21:53:31,013 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/data/3710be9a3/afdf5d5eb09a468fb875163e68a4b6b6/FLAG2b4c2ea42 [2023-11-06 21:53:31,028 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/data/3710be9a3/afdf5d5eb09a468fb875163e68a4b6b6 [2023-11-06 21:53:31,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:31,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:31,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:31,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:31,040 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:31,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f39d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31, skipping insertion in model container [2023-11-06 21:53:31,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,125 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:31,326 WARN L240 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_8a5806cb-de36-49c1-8c5f-1f07c9694c32/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-06 21:53:31,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:31,559 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:31,572 WARN L240 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_8a5806cb-de36-49c1-8c5f-1f07c9694c32/sv-benchmarks/c/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-06 21:53:31,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:31,752 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:53:31,753 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:53:31,761 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:31,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31 WrapperNode [2023-11-06 21:53:31,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:31,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:31,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:31,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:31,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,880 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160 [2023-11-06 21:53:31,880 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:31,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:31,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:31,882 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:31,891 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,907 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,915 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:31,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:31,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:31,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:31,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (1/1) ... [2023-11-06 21:53:31,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:31,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:31,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:32,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:32,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:53:32,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:53:32,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:32,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:53:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:53:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 21:53:32,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 21:53:32,033 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 21:53:32,034 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 21:53:32,034 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 21:53:32,035 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 21:53:32,036 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 21:53:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 21:53:32,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:53:32,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:53:32,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:32,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:32,039 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:53:32,220 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:32,222 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:32,574 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:32,825 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:32,825 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:53:32,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:32 BoogieIcfgContainer [2023-11-06 21:53:32,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:32,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:53:32,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:53:32,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:53:32,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:53:31" (1/3) ... [2023-11-06 21:53:32,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ddb073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:32, skipping insertion in model container [2023-11-06 21:53:32,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:31" (2/3) ... [2023-11-06 21:53:32,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48ddb073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:32, skipping insertion in model container [2023-11-06 21:53:32,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:32" (3/3) ... [2023-11-06 21:53:32,844 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i [2023-11-06 21:53:32,855 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 21:53:32,866 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:53:32,867 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-06 21:53:32,867 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:53:32,969 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:53:33,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 280 flow [2023-11-06 21:53:33,126 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-11-06 21:53:33,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:53:33,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-06 21:53:33,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 280 flow [2023-11-06 21:53:33,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-11-06 21:53:33,150 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:53:33,173 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-11-06 21:53:33,178 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-11-06 21:53:33,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-11-06 21:53:33,258 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-11-06 21:53:33,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:53:33,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2023-11-06 21:53:33,263 INFO L119 LiptonReduction]: Number of co-enabled transitions 3218 [2023-11-06 21:53:38,474 INFO L134 LiptonReduction]: Checked pairs total: 8831 [2023-11-06 21:53:38,474 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-11-06 21:53:38,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:53:38,516 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;@65c551d3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:53:38,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-06 21:53:38,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:53:38,533 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-06 21:53:38,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:53:38,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:53:38,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:38,535 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:53:38,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:38,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1906343462, now seen corresponding path program 1 times [2023-11-06 21:53:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:38,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953320171] [2023-11-06 21:53:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:38,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:39,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953320171] [2023-11-06 21:53:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953320171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:39,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:53:39,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606981302] [2023-11-06 21:53:39,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:39,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:53:39,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:39,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:53:39,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:53:39,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 242 [2023-11-06 21:53:39,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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) [2023-11-06 21:53:39,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:53:39,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 242 [2023-11-06 21:53:39,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:53:40,460 INFO L124 PetriNetUnfolderBase]: 3975/5715 cut-off events. [2023-11-06 21:53:40,461 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-06 21:53:40,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11295 conditions, 5715 events. 3975/5715 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 30715 event pairs, 1089 based on Foata normal form. 192/5483 useless extension candidates. Maximal degree in co-relation 11283. Up to 4303 conditions per place. [2023-11-06 21:53:40,520 INFO L140 encePairwiseOnDemand]: 238/242 looper letters, 35 selfloop transitions, 2 changer transitions 4/46 dead transitions. [2023-11-06 21:53:40,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2023-11-06 21:53:40,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:53:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:53:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 395 transitions. [2023-11-06 21:53:40,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5440771349862259 [2023-11-06 21:53:40,544 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 395 transitions. [2023-11-06 21:53:40,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 395 transitions. [2023-11-06 21:53:40,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:53:40,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 395 transitions. [2023-11-06 21:53:40,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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) [2023-11-06 21:53:40,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-11-06 21:53:40,570 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-11-06 21:53:40,572 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 395 transitions. [2023-11-06 21:53:40,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 189 flow [2023-11-06 21:53:40,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 184 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 21:53:40,581 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-11-06 21:53:40,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-06 21:53:40,588 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-06 21:53:40,588 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-11-06 21:53:40,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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) [2023-11-06 21:53:40,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:53:40,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:40,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:53:40,590 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:53:40,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:40,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2130469192, now seen corresponding path program 1 times [2023-11-06 21:53:40,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:40,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098509903] [2023-11-06 21:53:40,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:40,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:42,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:42,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098509903] [2023-11-06 21:53:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098509903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:42,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:42,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:42,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364436332] [2023-11-06 21:53:42,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:42,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:53:42,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:42,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:53:42,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:42,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242 [2023-11-06 21:53:42,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 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) [2023-11-06 21:53:42,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:53:42,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242 [2023-11-06 21:53:42,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:53:45,215 INFO L124 PetriNetUnfolderBase]: 9939/13515 cut-off events. [2023-11-06 21:53:45,216 INFO L125 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2023-11-06 21:53:45,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27833 conditions, 13515 events. 9939/13515 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 67809 event pairs, 1559 based on Foata normal form. 572/14083 useless extension candidates. Maximal degree in co-relation 27823. Up to 9785 conditions per place. [2023-11-06 21:53:45,346 INFO L140 encePairwiseOnDemand]: 230/242 looper letters, 45 selfloop transitions, 12 changer transitions 38/96 dead transitions. [2023-11-06 21:53:45,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 96 transitions, 404 flow [2023-11-06 21:53:45,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:45,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:53:45,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions. [2023-11-06 21:53:45,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4834710743801653 [2023-11-06 21:53:45,352 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 819 transitions. [2023-11-06 21:53:45,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions. [2023-11-06 21:53:45,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:53:45,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions. [2023-11-06 21:53:45,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 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) [2023-11-06 21:53:45,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-11-06 21:53:45,367 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-11-06 21:53:45,367 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 7 states and 819 transitions. [2023-11-06 21:53:45,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 96 transitions, 404 flow [2023-11-06 21:53:45,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 96 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:53:45,376 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 159 flow [2023-11-06 21:53:45,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=159, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-11-06 21:53:45,383 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2023-11-06 21:53:45,384 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 159 flow [2023-11-06 21:53:45,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 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) [2023-11-06 21:53:45,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:53:45,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:45,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:53:45,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:53:45,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:45,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1620002476, now seen corresponding path program 1 times [2023-11-06 21:53:45,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:45,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479044142] [2023-11-06 21:53:45,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:45,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:46,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:46,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479044142] [2023-11-06 21:53:46,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479044142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:46,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:46,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:46,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877383362] [2023-11-06 21:53:46,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:46,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:53:46,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:46,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:53:46,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:47,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242 [2023-11-06 21:53:47,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 159 flow. Second operand has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:47,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:53:47,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242 [2023-11-06 21:53:47,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:53:49,173 INFO L124 PetriNetUnfolderBase]: 8903/12147 cut-off events. [2023-11-06 21:53:49,173 INFO L125 PetriNetUnfolderBase]: For 8393/8393 co-relation queries the response was YES. [2023-11-06 21:53:49,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36726 conditions, 12147 events. 8903/12147 cut-off events. For 8393/8393 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 60000 event pairs, 2091 based on Foata normal form. 528/12671 useless extension candidates. Maximal degree in co-relation 36711. Up to 6833 conditions per place. [2023-11-06 21:53:49,284 INFO L140 encePairwiseOnDemand]: 231/242 looper letters, 50 selfloop transitions, 10 changer transitions 40/101 dead transitions. [2023-11-06 21:53:49,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 101 transitions, 595 flow [2023-11-06 21:53:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:53:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2023-11-06 21:53:49,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793388429752066 [2023-11-06 21:53:49,288 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2023-11-06 21:53:49,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2023-11-06 21:53:49,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:53:49,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2023-11-06 21:53:49,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 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) [2023-11-06 21:53:49,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-11-06 21:53:49,299 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-11-06 21:53:49,300 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 159 flow. Second operand 7 states and 812 transitions. [2023-11-06 21:53:49,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 101 transitions, 595 flow [2023-11-06 21:53:49,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 101 transitions, 587 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-06 21:53:49,518 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 246 flow [2023-11-06 21:53:49,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-06 21:53:49,520 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-11-06 21:53:49,524 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 246 flow [2023-11-06 21:53:49,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.6) internal successors, (528), 5 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:49,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:53:49,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:49,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:53:49,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:53:49,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:49,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1337479755, now seen corresponding path program 1 times [2023-11-06 21:53:49,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:49,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670851166] [2023-11-06 21:53:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:49,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:50,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:50,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670851166] [2023-11-06 21:53:50,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670851166] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:50,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:50,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:53:50,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343001584] [2023-11-06 21:53:50,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:50,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:53:50,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:50,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:53:50,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:50,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 242 [2023-11-06 21:53:50,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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) [2023-11-06 21:53:50,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:53:50,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 242 [2023-11-06 21:53:50,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:53:51,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L822-->L829: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_119 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_118 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_118 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_119)) (= v_~y~0_77 (ite .cse4 v_~y$w_buff0~0_51 (ite .cse3 v_~y$w_buff1~0_56 v_~y~0_78))) (= v_~y$w_buff0_used~0_135 (ite .cse4 0 v_~y$w_buff0_used~0_136)) (= v_~y$r_buff0_thd4~0_29 (ite .cse2 0 v_~y$r_buff0_thd4~0_30))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][46], [Black: 153#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 152#(= ~z~0 0), 99#P1EXITtrue, Black: 158#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 171#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 150#true, P3Thread1of1ForFork0InUse, Black: 169#(or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)), 116#L864true, Black: 168#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), 106#L754true, Black: 173#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 167#(= ~__unbuffered_p3_EAX~0 0), 181#true, 12#L829true, 165#true, 23#L796true]) [2023-11-06 21:53:51,965 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 21:53:51,965 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:53:51,965 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:53:51,965 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:53:51,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([479] L864-->L18: Formula: (let ((.cse8 (= (mod v_~y$r_buff1_thd0~0_76 256) 0)) (.cse3 (= (mod v_~y$r_buff0_thd0~0_78 256) 0))) (let ((.cse5 (not .cse3)) (.cse12 (= (mod v_~y$w_buff0_used~0_166 256) 0)) (.cse9 (and (= (mod v_~y$w_buff1_used~0_141 256) 0) .cse3)) (.cse2 (and .cse3 .cse8))) (let ((.cse10 (or .cse12 .cse9 .cse2)) (.cse11 (and (not .cse12) .cse5))) (let ((.cse4 (= (mod v_~y$w_buff1_used~0_140 256) 0)) (.cse6 (ite .cse10 v_~y~0_94 (ite .cse11 v_~y$w_buff0~0_78 v_~y$w_buff1~0_73))) (.cse1 (= (mod v_~y$w_buff0_used~0_165 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0)))) (and (= v_~y~0_94 v_~y$mem_tmp~0_24) (= v_~y$w_buff1~0_73 v_~y$w_buff1~0_72) (= v_~y$r_buff0_thd0~0_77 (ite .cse0 v_~y$r_buff0_thd0~0_78 (ite (or .cse1 .cse2 (and .cse3 .cse4)) v_~y$r_buff0_thd0~0_78 (ite (and (not .cse1) .cse5) 0 v_~y$r_buff0_thd0~0_78)))) (= (ite .cse0 v_~y$mem_tmp~0_24 .cse6) v_~y~0_93) (= v_~y$w_buff0~0_78 v_~y$w_buff0~0_77) (= (mod v_~main$tmp_guard1~0_18 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= 0 v_~y$flush_delayed~0_29) (= (ite .cse0 v_~y$r_buff1_thd0~0_76 (ite (let ((.cse7 (= 0 (mod v_~y$r_buff0_thd0~0_77 256)))) (or (and .cse4 .cse7) .cse1 (and .cse8 .cse7))) v_~y$r_buff1_thd0~0_76 0)) v_~y$r_buff1_thd0~0_75) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_16) (= 2 .cse6) (= 0 v_~__unbuffered_p3_EBX~0_16) (= v_~z~0_20 2) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_~y$w_buff1_used~0_140 (ite .cse0 v_~y$w_buff1_used~0_141 (ite (or .cse9 .cse1 .cse2) v_~y$w_buff1_used~0_141 0))) (= v_~y$w_buff0_used~0_165 (ite .cse0 v_~y$w_buff0_used~0_166 (ite .cse10 v_~y$w_buff0_used~0_166 (ite .cse11 0 v_~y$w_buff0_used~0_166))))))))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_166, ~y$w_buff1~0=v_~y$w_buff1~0_73, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_78, ~y$w_buff0~0=v_~y$w_buff0~0_78, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ~z~0=v_~z~0_20, ~y~0=v_~y~0_94, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_141} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_22|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_16, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_26|, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_22|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~y$w_buff1~0=v_~y$w_buff1~0_72, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_77, ~y$w_buff0~0=v_~y$w_buff0~0_77, ~y$flush_delayed~0=v_~y$flush_delayed~0_29, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_16, ~z~0=v_~z~0_20, ~y~0=v_~y~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_40, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_140} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][50], [Black: 153#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 152#(= ~z~0 0), 99#P1EXITtrue, Black: 158#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 100#L18true, P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 171#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 150#true, P3Thread1of1ForFork0InUse, Black: 169#(or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)), Black: 168#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), 106#L754true, Black: 173#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 167#(= ~__unbuffered_p3_EAX~0 0), 181#true, 165#true, 45#L822true, 23#L796true]) [2023-11-06 21:53:51,966 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 21:53:51,966 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:53:51,966 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:53:51,967 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:53:52,350 INFO L124 PetriNetUnfolderBase]: 8153/11631 cut-off events. [2023-11-06 21:53:52,351 INFO L125 PetriNetUnfolderBase]: For 19568/20481 co-relation queries the response was YES. [2023-11-06 21:53:52,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38649 conditions, 11631 events. 8153/11631 cut-off events. For 19568/20481 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 64204 event pairs, 2887 based on Foata normal form. 962/12207 useless extension candidates. Maximal degree in co-relation 38628. Up to 8486 conditions per place. [2023-11-06 21:53:52,470 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 42 selfloop transitions, 4 changer transitions 21/77 dead transitions. [2023-11-06 21:53:52,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 504 flow [2023-11-06 21:53:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:53:52,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:53:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2023-11-06 21:53:52,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5223140495867769 [2023-11-06 21:53:52,474 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2023-11-06 21:53:52,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2023-11-06 21:53:52,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:53:52,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2023-11-06 21:53:52,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 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) [2023-11-06 21:53:52,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:52,482 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:53:52,482 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 246 flow. Second operand 5 states and 632 transitions. [2023-11-06 21:53:52,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 504 flow [2023-11-06 21:53:52,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 487 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-06 21:53:52,980 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 272 flow [2023-11-06 21:53:52,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-06 21:53:52,983 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2023-11-06 21:53:52,984 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 272 flow [2023-11-06 21:53:52,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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) [2023-11-06 21:53:52,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:53:52,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:52,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:53:52,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:53:52,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:52,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1489513656, now seen corresponding path program 1 times [2023-11-06 21:53:52,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:52,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429720965] [2023-11-06 21:53:52,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:52,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:53:55,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:55,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429720965] [2023-11-06 21:53:55,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429720965] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:55,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:55,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:53:55,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665235101] [2023-11-06 21:53:55,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:55,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:53:55,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:55,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:53:55,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:53:55,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 242 [2023-11-06 21:53:55,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 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) [2023-11-06 21:53:55,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:53:55,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 242 [2023-11-06 21:53:55,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:53:57,893 INFO L124 PetriNetUnfolderBase]: 11609/15740 cut-off events. [2023-11-06 21:53:57,893 INFO L125 PetriNetUnfolderBase]: For 22117/22117 co-relation queries the response was YES. [2023-11-06 21:53:57,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56761 conditions, 15740 events. 11609/15740 cut-off events. For 22117/22117 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 76461 event pairs, 1889 based on Foata normal form. 476/16216 useless extension candidates. Maximal degree in co-relation 56738. Up to 11001 conditions per place. [2023-11-06 21:53:58,036 INFO L140 encePairwiseOnDemand]: 228/242 looper letters, 72 selfloop transitions, 38 changer transitions 47/157 dead transitions. [2023-11-06 21:53:58,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 157 transitions, 1201 flow [2023-11-06 21:53:58,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:53:58,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 21:53:58,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 922 transitions. [2023-11-06 21:53:58,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4762396694214876 [2023-11-06 21:53:58,042 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 922 transitions. [2023-11-06 21:53:58,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 922 transitions. [2023-11-06 21:53:58,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:53:58,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 922 transitions. [2023-11-06 21:53:58,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.25) internal successors, (922), 8 states have internal predecessors, (922), 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) [2023-11-06 21:53:58,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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) [2023-11-06 21:53:58,053 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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) [2023-11-06 21:53:58,053 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 272 flow. Second operand 8 states and 922 transitions. [2023-11-06 21:53:58,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 157 transitions, 1201 flow [2023-11-06 21:53:58,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 157 transitions, 1177 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-06 21:53:58,612 INFO L231 Difference]: Finished difference. Result has 63 places, 73 transitions, 659 flow [2023-11-06 21:53:58,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=659, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2023-11-06 21:53:58,613 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2023-11-06 21:53:58,613 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 73 transitions, 659 flow [2023-11-06 21:53:58,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.14285714285714) internal successors, (715), 7 states have internal predecessors, (715), 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) [2023-11-06 21:53:58,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:53:58,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:58,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:53:58,614 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:53:58,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:58,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1431392376, now seen corresponding path program 2 times [2023-11-06 21:53:58,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:58,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489060814] [2023-11-06 21:53:58,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:58,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:00,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:00,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489060814] [2023-11-06 21:54:00,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489060814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:00,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:00,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:54:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905334412] [2023-11-06 21:54:00,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:00,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:00,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 242 [2023-11-06 21:54:00,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 73 transitions, 659 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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) [2023-11-06 21:54:00,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:00,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 242 [2023-11-06 21:54:00,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:03,640 INFO L124 PetriNetUnfolderBase]: 11425/15492 cut-off events. [2023-11-06 21:54:03,640 INFO L125 PetriNetUnfolderBase]: For 50628/50628 co-relation queries the response was YES. [2023-11-06 21:54:03,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70213 conditions, 15492 events. 11425/15492 cut-off events. For 50628/50628 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 74975 event pairs, 2005 based on Foata normal form. 412/15904 useless extension candidates. Maximal degree in co-relation 70186. Up to 11207 conditions per place. [2023-11-06 21:54:03,793 INFO L140 encePairwiseOnDemand]: 228/242 looper letters, 101 selfloop transitions, 66 changer transitions 45/212 dead transitions. [2023-11-06 21:54:03,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 212 transitions, 2218 flow [2023-11-06 21:54:03,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:54:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 21:54:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 912 transitions. [2023-11-06 21:54:03,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47107438016528924 [2023-11-06 21:54:03,799 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 912 transitions. [2023-11-06 21:54:03,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 912 transitions. [2023-11-06 21:54:03,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:03,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 912 transitions. [2023-11-06 21:54:03,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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) [2023-11-06 21:54:03,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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) [2023-11-06 21:54:03,809 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 242.0) internal successors, (2178), 9 states have internal predecessors, (2178), 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) [2023-11-06 21:54:03,809 INFO L175 Difference]: Start difference. First operand has 63 places, 73 transitions, 659 flow. Second operand 8 states and 912 transitions. [2023-11-06 21:54:03,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 212 transitions, 2218 flow [2023-11-06 21:54:04,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 212 transitions, 2191 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-06 21:54:04,431 INFO L231 Difference]: Finished difference. Result has 72 places, 125 transitions, 1557 flow [2023-11-06 21:54:04,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1557, PETRI_PLACES=72, PETRI_TRANSITIONS=125} [2023-11-06 21:54:04,435 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 28 predicate places. [2023-11-06 21:54:04,435 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 125 transitions, 1557 flow [2023-11-06 21:54:04,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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) [2023-11-06 21:54:04,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:04,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:04,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:54:04,437 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:54:04,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:04,437 INFO L85 PathProgramCache]: Analyzing trace with hash -296855207, now seen corresponding path program 1 times [2023-11-06 21:54:04,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:04,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109717603] [2023-11-06 21:54:04,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:04,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:04,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109717603] [2023-11-06 21:54:04,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109717603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:04,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:04,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:54:04,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220939865] [2023-11-06 21:54:04,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:04,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:04,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:04,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:04,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:04,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 242 [2023-11-06 21:54:04,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 125 transitions, 1557 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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) [2023-11-06 21:54:04,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:04,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 242 [2023-11-06 21:54:04,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:07,180 INFO L124 PetriNetUnfolderBase]: 8784/12385 cut-off events. [2023-11-06 21:54:07,181 INFO L125 PetriNetUnfolderBase]: For 75500/77463 co-relation queries the response was YES. [2023-11-06 21:54:07,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70211 conditions, 12385 events. 8784/12385 cut-off events. For 75500/77463 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 66420 event pairs, 1872 based on Foata normal form. 1277/13368 useless extension candidates. Maximal degree in co-relation 70177. Up to 8284 conditions per place. [2023-11-06 21:54:07,296 INFO L140 encePairwiseOnDemand]: 237/242 looper letters, 102 selfloop transitions, 10 changer transitions 19/171 dead transitions. [2023-11-06 21:54:07,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 171 transitions, 2140 flow [2023-11-06 21:54:07,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:54:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:54:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions. [2023-11-06 21:54:07,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5192837465564738 [2023-11-06 21:54:07,300 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 754 transitions. [2023-11-06 21:54:07,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions. [2023-11-06 21:54:07,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:07,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions. [2023-11-06 21:54:07,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:07,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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) [2023-11-06 21:54:07,307 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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) [2023-11-06 21:54:07,308 INFO L175 Difference]: Start difference. First operand has 72 places, 125 transitions, 1557 flow. Second operand 6 states and 754 transitions. [2023-11-06 21:54:07,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 171 transitions, 2140 flow [2023-11-06 21:54:07,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 171 transitions, 2106 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-11-06 21:54:07,708 INFO L231 Difference]: Finished difference. Result has 76 places, 127 transitions, 1592 flow [2023-11-06 21:54:07,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1533, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1592, PETRI_PLACES=76, PETRI_TRANSITIONS=127} [2023-11-06 21:54:07,709 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2023-11-06 21:54:07,709 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 127 transitions, 1592 flow [2023-11-06 21:54:07,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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) [2023-11-06 21:54:07,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:07,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:07,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:54:07,711 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:54:07,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:07,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1125170826, now seen corresponding path program 1 times [2023-11-06 21:54:07,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:07,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169596278] [2023-11-06 21:54:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:07,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:08,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:08,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:08,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169596278] [2023-11-06 21:54:08,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169596278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:08,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:08,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:54:08,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146814855] [2023-11-06 21:54:08,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:08,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:08,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:08,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:08,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:08,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 242 [2023-11-06 21:54:08,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 127 transitions, 1592 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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) [2023-11-06 21:54:08,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:08,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 242 [2023-11-06 21:54:08,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:11,357 INFO L124 PetriNetUnfolderBase]: 11275/15479 cut-off events. [2023-11-06 21:54:11,357 INFO L125 PetriNetUnfolderBase]: For 100501/102649 co-relation queries the response was YES. [2023-11-06 21:54:11,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90360 conditions, 15479 events. 11275/15479 cut-off events. For 100501/102649 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 79103 event pairs, 1921 based on Foata normal form. 1544/16923 useless extension candidates. Maximal degree in co-relation 90322. Up to 12360 conditions per place. [2023-11-06 21:54:11,504 INFO L140 encePairwiseOnDemand]: 229/242 looper letters, 121 selfloop transitions, 72 changer transitions 42/247 dead transitions. [2023-11-06 21:54:11,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 247 transitions, 3380 flow [2023-11-06 21:54:11,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:11,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:54:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 841 transitions. [2023-11-06 21:54:11,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4964580873671783 [2023-11-06 21:54:11,509 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 841 transitions. [2023-11-06 21:54:11,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 841 transitions. [2023-11-06 21:54:11,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:11,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 841 transitions. [2023-11-06 21:54:11,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.14285714285714) internal successors, (841), 7 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:11,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-11-06 21:54:11,518 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-11-06 21:54:11,518 INFO L175 Difference]: Start difference. First operand has 76 places, 127 transitions, 1592 flow. Second operand 7 states and 841 transitions. [2023-11-06 21:54:11,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 247 transitions, 3380 flow [2023-11-06 21:54:11,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 247 transitions, 3355 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-06 21:54:11,981 INFO L231 Difference]: Finished difference. Result has 81 places, 179 transitions, 2678 flow [2023-11-06 21:54:11,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1575, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2678, PETRI_PLACES=81, PETRI_TRANSITIONS=179} [2023-11-06 21:54:11,982 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-11-06 21:54:11,982 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 179 transitions, 2678 flow [2023-11-06 21:54:11,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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) [2023-11-06 21:54:11,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:11,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:11,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:54:11,984 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:54:11,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:11,984 INFO L85 PathProgramCache]: Analyzing trace with hash -612680014, now seen corresponding path program 1 times [2023-11-06 21:54:11,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:11,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082017879] [2023-11-06 21:54:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:11,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082017879] [2023-11-06 21:54:12,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082017879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:12,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:12,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:54:12,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422778668] [2023-11-06 21:54:12,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:12,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:54:12,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:12,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:54:12,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:54:12,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 242 [2023-11-06 21:54:12,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 179 transitions, 2678 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 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) [2023-11-06 21:54:12,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:12,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 242 [2023-11-06 21:54:12,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:15,400 INFO L124 PetriNetUnfolderBase]: 10722/15023 cut-off events. [2023-11-06 21:54:15,400 INFO L125 PetriNetUnfolderBase]: For 129637/131947 co-relation queries the response was YES. [2023-11-06 21:54:15,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100452 conditions, 15023 events. 10722/15023 cut-off events. For 129637/131947 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 81296 event pairs, 2362 based on Foata normal form. 1223/15858 useless extension candidates. Maximal degree in co-relation 100411. Up to 8941 conditions per place. [2023-11-06 21:54:15,563 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 114 selfloop transitions, 95 changer transitions 21/288 dead transitions. [2023-11-06 21:54:15,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 288 transitions, 4305 flow [2023-11-06 21:54:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:54:15,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 21:54:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1203 transitions. [2023-11-06 21:54:15,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4971074380165289 [2023-11-06 21:54:15,569 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1203 transitions. [2023-11-06 21:54:15,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1203 transitions. [2023-11-06 21:54:15,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:15,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1203 transitions. [2023-11-06 21:54:15,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.3) internal successors, (1203), 10 states have internal predecessors, (1203), 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) [2023-11-06 21:54:15,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 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) [2023-11-06 21:54:15,581 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 242.0) internal successors, (2662), 11 states have internal predecessors, (2662), 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) [2023-11-06 21:54:15,581 INFO L175 Difference]: Start difference. First operand has 81 places, 179 transitions, 2678 flow. Second operand 10 states and 1203 transitions. [2023-11-06 21:54:15,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 288 transitions, 4305 flow [2023-11-06 21:54:16,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 288 transitions, 4144 flow, removed 37 selfloop flow, removed 4 redundant places. [2023-11-06 21:54:16,103 INFO L231 Difference]: Finished difference. Result has 87 places, 214 transitions, 3414 flow [2023-11-06 21:54:16,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3414, PETRI_PLACES=87, PETRI_TRANSITIONS=214} [2023-11-06 21:54:16,104 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2023-11-06 21:54:16,104 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 214 transitions, 3414 flow [2023-11-06 21:54:16,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 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) [2023-11-06 21:54:16,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:16,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:16,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:54:16,106 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:54:16,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:16,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1208638733, now seen corresponding path program 1 times [2023-11-06 21:54:16,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:16,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232591479] [2023-11-06 21:54:16,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:16,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:16,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:16,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232591479] [2023-11-06 21:54:16,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232591479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:16,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:16,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:54:16,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861519074] [2023-11-06 21:54:16,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:16,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:54:16,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:16,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:54:16,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:54:16,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-11-06 21:54:16,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 214 transitions, 3414 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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) [2023-11-06 21:54:16,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:16,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-11-06 21:54:16,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:17,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([403] L822-->L829: Formula: (let ((.cse1 (not (= (mod v_~y$w_buff0_used~0_135 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_30 256) 0))) (.cse0 (not (= (mod v_~y$r_buff1_thd4~0_28 256) 0)))) (let ((.cse3 (and .cse0 (not (= (mod v_~y$w_buff1_used~0_119 256) 0)))) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_136 256) 0)) .cse5)) (.cse2 (and .cse1 .cse5))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$w_buff1_used~0_118 256) 0))) (and .cse1 (not (= (mod v_~y$r_buff0_thd4~0_29 256) 0)))) 0 v_~y$r_buff1_thd4~0_28) v_~y$r_buff1_thd4~0_27) (= v_~y$w_buff1_used~0_118 (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_119)) (= v_~y~0_77 (ite .cse4 v_~y$w_buff0~0_51 (ite .cse3 v_~y$w_buff1~0_56 v_~y~0_78))) (= v_~y$w_buff0_used~0_135 (ite .cse4 0 v_~y$w_buff0_used~0_136)) (= v_~y$r_buff0_thd4~0_29 (ite .cse2 0 v_~y$r_buff0_thd4~0_30))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_30, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_78, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_119} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_29, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_27, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_51, ~y~0=v_~y~0_77, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_118} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][194], [114#P0EXITtrue, 210#true, 192#true, 259#(= ~y$r_buff0_thd0~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 196#(and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (= 2 ~y$w_buff0~0) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, Black: 197#(or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))), Black: 202#(and (or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 260#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 271#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~y~0 1)), Black: 269#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~y~0 1)), Black: 273#(and (= ~y$r_buff0_thd0~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 165#true, Black: 214#(or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))), Black: 213#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 ~y$w_buff1~0) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 219#(and (or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 153#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 158#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 99#P1EXITtrue, Black: 231#(and (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), 150#true, 136#L857-1true, Black: 230#(and (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0)), 25#L799true, Black: 168#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 167#(= ~__unbuffered_p3_EAX~0 0), 12#L829true, Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 250#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), 279#true, Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 187#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 245#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))]) [2023-11-06 21:54:17,985 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 21:54:17,985 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:54:17,985 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:54:17,986 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:54:17,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([395] L799-->L806: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd3~0_22 256) 0))) (.cse2 (not (= (mod v_~y$w_buff0_used~0_99 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_31 256) 0)))) (let ((.cse3 (and .cse2 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_100 256) 0)) .cse5)) (.cse4 (and (not (= (mod v_~y$w_buff1_used~0_85 256) 0)) .cse1))) (and (= (ite .cse0 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= (ite (or (and .cse1 (not (= (mod v_~y$w_buff1_used~0_84 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_30 256) 0)) .cse2)) 0 v_~y$r_buff1_thd3~0_22) v_~y$r_buff1_thd3~0_21) (= v_~y$w_buff1_used~0_84 (ite (or .cse3 .cse4) 0 v_~y$w_buff1_used~0_85)) (= v_~y$r_buff0_thd3~0_30 (ite .cse3 0 v_~y$r_buff0_thd3~0_31)) (= v_~y~0_53 (ite .cse0 v_~y$w_buff0~0_29 (ite .cse4 v_~y$w_buff1~0_38 v_~y~0_54)))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_22, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_31, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_85} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_38, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_30, ~y$w_buff0~0=v_~y$w_buff0~0_29, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_84} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][123], [114#P0EXITtrue, 210#true, 192#true, 259#(= ~y$r_buff0_thd0~0 0), P0Thread1of1ForFork3InUse, P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 196#(and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (= 2 ~y$w_buff0~0) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, Black: 197#(or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))), Black: 202#(and (or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 260#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 271#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~y~0 1)), Black: 269#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~y~0 1)), Black: 273#(and (= ~y$r_buff0_thd0~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 165#true, 45#L822true, Black: 214#(or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))), Black: 213#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 ~y$w_buff1~0) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 219#(and (or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 153#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 158#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 99#P1EXITtrue, 36#L806true, Black: 231#(and (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), 150#true, 136#L857-1true, Black: 230#(and (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0)), Black: 168#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 167#(= ~__unbuffered_p3_EAX~0 0), 279#true, Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 250#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 187#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 245#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))]) [2023-11-06 21:54:17,987 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 21:54:17,987 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:54:17,987 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:54:17,988 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:54:17,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L857-1-->L864: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_70 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd0~0_74 256)))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_161 256) 0)))) (let ((.cse1 (and .cse5 .cse4)) (.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_162 256) 0)))) (.cse2 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_137 256) 0))))) (and (= v_~y$w_buff0_used~0_161 (ite .cse0 0 v_~y$w_buff0_used~0_162)) (= v_~y$w_buff1_used~0_136 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_137)) (= v_~y$r_buff0_thd0~0_73 (ite .cse1 0 v_~y$r_buff0_thd0~0_74)) (= (ite .cse0 v_~y$w_buff0~0_75 (ite .cse2 v_~y$w_buff1~0_70 v_~y~0_88)) v_~y~0_87) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_136 256) 0))) (and .cse4 (not (= (mod v_~y$r_buff0_thd0~0_73 256) 0)))) 0 v_~y$r_buff1_thd0~0_70) v_~y$r_buff1_thd0~0_69)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_75, ~y~0=v_~y~0_88, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_137} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_70, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_73, ~y$w_buff0~0=v_~y$w_buff0~0_75, ~y~0=v_~y~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_69, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_136, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_8|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][157], [114#P0EXITtrue, 210#true, 192#true, P0Thread1of1ForFork3InUse, 259#(= ~y$r_buff0_thd0~0 0), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse, Black: 196#(and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (= 2 ~y$w_buff0~0) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 197#(or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))), P3Thread1of1ForFork0InUse, Black: 202#(and (or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 260#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 271#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~y~0 1)), Black: 269#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (= ~y~0 1)), Black: 273#(and (= ~y$r_buff0_thd0~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 165#true, 45#L822true, Black: 214#(or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))), Black: 213#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 ~y$w_buff1~0) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 219#(and (or (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (not (= 2 ~y$w_buff1~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 153#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 99#P1EXITtrue, Black: 158#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 231#(and (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0) (= ~y~0 1)), 150#true, Black: 230#(and (= ~y$w_buff0_used~0 0) (= ~y$w_buff1_used~0 0)), 116#L864true, 25#L799true, Black: 168#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 167#(= ~__unbuffered_p3_EAX~0 0), 279#true, Black: 183#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 250#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 243#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd4~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd4~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 245#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (and (or (not (= 2 ~y~0)) (and (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256)))))) (or (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 187#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0_used~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)))]) [2023-11-06 21:54:17,989 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 21:54:17,989 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:54:17,989 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:54:17,989 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:54:18,325 INFO L124 PetriNetUnfolderBase]: 6134/8633 cut-off events. [2023-11-06 21:54:18,325 INFO L125 PetriNetUnfolderBase]: For 117725/122003 co-relation queries the response was YES. [2023-11-06 21:54:18,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62756 conditions, 8633 events. 6134/8633 cut-off events. For 117725/122003 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 45414 event pairs, 1231 based on Foata normal form. 1129/9271 useless extension candidates. Maximal degree in co-relation 62713. Up to 6217 conditions per place. [2023-11-06 21:54:18,437 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 239 selfloop transitions, 5 changer transitions 0/305 dead transitions. [2023-11-06 21:54:18,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 305 transitions, 5378 flow [2023-11-06 21:54:18,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:54:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:54:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-11-06 21:54:18,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234159779614325 [2023-11-06 21:54:18,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-11-06 21:54:18,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-11-06 21:54:18,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:18,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-11-06 21:54:18,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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) [2023-11-06 21:54:18,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-11-06 21:54:18,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 242.0) internal successors, (968), 4 states have internal predecessors, (968), 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) [2023-11-06 21:54:18,446 INFO L175 Difference]: Start difference. First operand has 87 places, 214 transitions, 3414 flow. Second operand 3 states and 380 transitions. [2023-11-06 21:54:18,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 305 transitions, 5378 flow [2023-11-06 21:54:18,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 305 transitions, 5232 flow, removed 68 selfloop flow, removed 4 redundant places. [2023-11-06 21:54:18,691 INFO L231 Difference]: Finished difference. Result has 84 places, 215 transitions, 3305 flow [2023-11-06 21:54:18,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=3272, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3305, PETRI_PLACES=84, PETRI_TRANSITIONS=215} [2023-11-06 21:54:18,692 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2023-11-06 21:54:18,692 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 215 transitions, 3305 flow [2023-11-06 21:54:18,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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) [2023-11-06 21:54:18,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:18,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:18,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:54:18,693 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:54:18,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:18,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1054585689, now seen corresponding path program 1 times [2023-11-06 21:54:18,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:18,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855988123] [2023-11-06 21:54:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:18,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855988123] [2023-11-06 21:54:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855988123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:18,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:18,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:54:18,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079431857] [2023-11-06 21:54:18,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:18,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:54:18,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:18,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:54:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:54:18,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-11-06 21:54:18,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 215 transitions, 3305 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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) [2023-11-06 21:54:18,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:18,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-11-06 21:54:18,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:20,071 INFO L124 PetriNetUnfolderBase]: 3183/4713 cut-off events. [2023-11-06 21:54:20,071 INFO L125 PetriNetUnfolderBase]: For 53726/55423 co-relation queries the response was YES. [2023-11-06 21:54:20,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34542 conditions, 4713 events. 3183/4713 cut-off events. For 53726/55423 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 24260 event pairs, 511 based on Foata normal form. 587/5090 useless extension candidates. Maximal degree in co-relation 34500. Up to 2463 conditions per place. [2023-11-06 21:54:20,132 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 233 selfloop transitions, 9 changer transitions 0/294 dead transitions. [2023-11-06 21:54:20,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 294 transitions, 5043 flow [2023-11-06 21:54:20,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:54:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:54:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-11-06 21:54:20,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5247933884297521 [2023-11-06 21:54:20,136 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-11-06 21:54:20,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-11-06 21:54:20,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:20,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-11-06 21:54:20,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 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) [2023-11-06 21:54:20,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-11-06 21:54:20,141 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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) [2023-11-06 21:54:20,141 INFO L175 Difference]: Start difference. First operand has 84 places, 215 transitions, 3305 flow. Second operand 4 states and 508 transitions. [2023-11-06 21:54:20,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 294 transitions, 5043 flow [2023-11-06 21:54:20,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 294 transitions, 4969 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-11-06 21:54:20,246 INFO L231 Difference]: Finished difference. Result has 83 places, 169 transitions, 2547 flow [2023-11-06 21:54:20,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=2495, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2547, PETRI_PLACES=83, PETRI_TRANSITIONS=169} [2023-11-06 21:54:20,247 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2023-11-06 21:54:20,247 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 169 transitions, 2547 flow [2023-11-06 21:54:20,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 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) [2023-11-06 21:54:20,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:20,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:20,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:54:20,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:54:20,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:20,249 INFO L85 PathProgramCache]: Analyzing trace with hash -284986028, now seen corresponding path program 1 times [2023-11-06 21:54:20,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:20,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420081947] [2023-11-06 21:54:20,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:20,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:20,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:20,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420081947] [2023-11-06 21:54:20,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420081947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:20,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:20,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:54:20,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026778785] [2023-11-06 21:54:20,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:20,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:54:20,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:54:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:54:20,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-11-06 21:54:20,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 169 transitions, 2547 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 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) [2023-11-06 21:54:20,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:20,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-11-06 21:54:20,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:21,191 INFO L124 PetriNetUnfolderBase]: 2421/3574 cut-off events. [2023-11-06 21:54:21,191 INFO L125 PetriNetUnfolderBase]: For 34370/35120 co-relation queries the response was YES. [2023-11-06 21:54:21,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26134 conditions, 3574 events. 2421/3574 cut-off events. For 34370/35120 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 17945 event pairs, 364 based on Foata normal form. 271/3680 useless extension candidates. Maximal degree in co-relation 26093. Up to 1856 conditions per place. [2023-11-06 21:54:21,222 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 238 selfloop transitions, 13 changer transitions 0/303 dead transitions. [2023-11-06 21:54:21,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 303 transitions, 5060 flow [2023-11-06 21:54:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:54:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:54:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-11-06 21:54:21,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5239669421487604 [2023-11-06 21:54:21,225 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-11-06 21:54:21,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-11-06 21:54:21,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:21,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-11-06 21:54:21,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 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) [2023-11-06 21:54:21,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:21,231 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:21,232 INFO L175 Difference]: Start difference. First operand has 83 places, 169 transitions, 2547 flow. Second operand 5 states and 634 transitions. [2023-11-06 21:54:21,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 303 transitions, 5060 flow [2023-11-06 21:54:21,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 303 transitions, 5030 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-06 21:54:21,358 INFO L231 Difference]: Finished difference. Result has 85 places, 167 transitions, 2483 flow [2023-11-06 21:54:21,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=2415, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2483, PETRI_PLACES=85, PETRI_TRANSITIONS=167} [2023-11-06 21:54:21,359 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 41 predicate places. [2023-11-06 21:54:21,359 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 167 transitions, 2483 flow [2023-11-06 21:54:21,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 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) [2023-11-06 21:54:21,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:21,360 INFO L208 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] [2023-11-06 21:54:21,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:54:21,360 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:54:21,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:21,361 INFO L85 PathProgramCache]: Analyzing trace with hash -930294406, now seen corresponding path program 1 times [2023-11-06 21:54:21,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:21,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905638692] [2023-11-06 21:54:21,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:21,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:22,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:22,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:22,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905638692] [2023-11-06 21:54:22,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905638692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:22,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:22,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:54:22,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315285437] [2023-11-06 21:54:22,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:22,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:22,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:22,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:22,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:22,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 242 [2023-11-06 21:54:22,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 167 transitions, 2483 flow. Second operand has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 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) [2023-11-06 21:54:22,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:22,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 242 [2023-11-06 21:54:22,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:24,113 INFO L124 PetriNetUnfolderBase]: 3859/5657 cut-off events. [2023-11-06 21:54:24,113 INFO L125 PetriNetUnfolderBase]: For 53306/53710 co-relation queries the response was YES. [2023-11-06 21:54:24,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40595 conditions, 5657 events. 3859/5657 cut-off events. For 53306/53710 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 28594 event pairs, 354 based on Foata normal form. 201/5803 useless extension candidates. Maximal degree in co-relation 40554. Up to 2918 conditions per place. [2023-11-06 21:54:24,163 INFO L140 encePairwiseOnDemand]: 228/242 looper letters, 179 selfloop transitions, 144 changer transitions 115/442 dead transitions. [2023-11-06 21:54:24,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 442 transitions, 7306 flow [2023-11-06 21:54:24,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:54:24,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:54:24,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 818 transitions. [2023-11-06 21:54:24,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48288075560802834 [2023-11-06 21:54:24,168 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 818 transitions. [2023-11-06 21:54:24,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 818 transitions. [2023-11-06 21:54:24,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:24,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 818 transitions. [2023-11-06 21:54:24,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 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) [2023-11-06 21:54:24,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-11-06 21:54:24,176 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 242.0) internal successors, (1936), 8 states have internal predecessors, (1936), 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) [2023-11-06 21:54:24,176 INFO L175 Difference]: Start difference. First operand has 85 places, 167 transitions, 2483 flow. Second operand 7 states and 818 transitions. [2023-11-06 21:54:24,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 442 transitions, 7306 flow [2023-11-06 21:54:24,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 442 transitions, 7186 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-11-06 21:54:24,471 INFO L231 Difference]: Finished difference. Result has 93 places, 234 transitions, 4176 flow [2023-11-06 21:54:24,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=2449, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4176, PETRI_PLACES=93, PETRI_TRANSITIONS=234} [2023-11-06 21:54:24,472 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 49 predicate places. [2023-11-06 21:54:24,472 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 234 transitions, 4176 flow [2023-11-06 21:54:24,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 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) [2023-11-06 21:54:24,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:24,472 INFO L208 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] [2023-11-06 21:54:24,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:54:24,473 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:54:24,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:24,473 INFO L85 PathProgramCache]: Analyzing trace with hash -689797422, now seen corresponding path program 2 times [2023-11-06 21:54:24,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:24,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799946833] [2023-11-06 21:54:24,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:24,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:25,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:25,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:25,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799946833] [2023-11-06 21:54:25,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799946833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:25,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:25,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:54:25,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044528696] [2023-11-06 21:54:25,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:25,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:54:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:25,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:54:25,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:54:25,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 242 [2023-11-06 21:54:25,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 234 transitions, 4176 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 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) [2023-11-06 21:54:25,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:25,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 242 [2023-11-06 21:54:25,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:27,182 INFO L124 PetriNetUnfolderBase]: 4480/6740 cut-off events. [2023-11-06 21:54:27,182 INFO L125 PetriNetUnfolderBase]: For 62496/63005 co-relation queries the response was YES. [2023-11-06 21:54:27,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48664 conditions, 6740 events. 4480/6740 cut-off events. For 62496/63005 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 36412 event pairs, 538 based on Foata normal form. 260/6937 useless extension candidates. Maximal degree in co-relation 48618. Up to 3334 conditions per place. [2023-11-06 21:54:27,255 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 143 selfloop transitions, 29 changer transitions 128/304 dead transitions. [2023-11-06 21:54:27,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 304 transitions, 5539 flow [2023-11-06 21:54:27,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:54:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:54:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 585 transitions. [2023-11-06 21:54:27,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4834710743801653 [2023-11-06 21:54:27,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 585 transitions. [2023-11-06 21:54:27,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 585 transitions. [2023-11-06 21:54:27,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:27,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 585 transitions. [2023-11-06 21:54:27,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 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) [2023-11-06 21:54:27,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:27,264 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:27,265 INFO L175 Difference]: Start difference. First operand has 93 places, 234 transitions, 4176 flow. Second operand 5 states and 585 transitions. [2023-11-06 21:54:27,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 304 transitions, 5539 flow [2023-11-06 21:54:27,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 304 transitions, 5509 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-11-06 21:54:27,623 INFO L231 Difference]: Finished difference. Result has 97 places, 140 transitions, 2136 flow [2023-11-06 21:54:27,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=4148, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2136, PETRI_PLACES=97, PETRI_TRANSITIONS=140} [2023-11-06 21:54:27,624 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2023-11-06 21:54:27,624 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 140 transitions, 2136 flow [2023-11-06 21:54:27,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 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) [2023-11-06 21:54:27,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:27,625 INFO L208 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] [2023-11-06 21:54:27,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:54:27,625 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:54:27,626 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:27,626 INFO L85 PathProgramCache]: Analyzing trace with hash 676869094, now seen corresponding path program 3 times [2023-11-06 21:54:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:27,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79919060] [2023-11-06 21:54:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:27,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:27,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:27,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79919060] [2023-11-06 21:54:27,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79919060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:27,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:27,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:54:27,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435505766] [2023-11-06 21:54:27,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:27,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:27,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:27,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:27,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:27,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 242 [2023-11-06 21:54:27,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 140 transitions, 2136 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 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) [2023-11-06 21:54:27,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:27,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 242 [2023-11-06 21:54:27,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:28,699 INFO L124 PetriNetUnfolderBase]: 2494/3900 cut-off events. [2023-11-06 21:54:28,699 INFO L125 PetriNetUnfolderBase]: For 44604/45354 co-relation queries the response was YES. [2023-11-06 21:54:28,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26457 conditions, 3900 events. 2494/3900 cut-off events. For 44604/45354 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 22120 event pairs, 259 based on Foata normal form. 238/4006 useless extension candidates. Maximal degree in co-relation 26416. Up to 1699 conditions per place. [2023-11-06 21:54:28,726 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 91 selfloop transitions, 17 changer transitions 121/240 dead transitions. [2023-11-06 21:54:28,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 240 transitions, 4009 flow [2023-11-06 21:54:28,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:54:28,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:54:28,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 747 transitions. [2023-11-06 21:54:28,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5144628099173554 [2023-11-06 21:54:28,729 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 747 transitions. [2023-11-06 21:54:28,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 747 transitions. [2023-11-06 21:54:28,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:28,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 747 transitions. [2023-11-06 21:54:28,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 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) [2023-11-06 21:54:28,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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) [2023-11-06 21:54:28,736 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 242.0) internal successors, (1694), 7 states have internal predecessors, (1694), 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) [2023-11-06 21:54:28,736 INFO L175 Difference]: Start difference. First operand has 97 places, 140 transitions, 2136 flow. Second operand 6 states and 747 transitions. [2023-11-06 21:54:28,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 240 transitions, 4009 flow [2023-11-06 21:54:28,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 240 transitions, 3804 flow, removed 57 selfloop flow, removed 6 redundant places. [2023-11-06 21:54:28,904 INFO L231 Difference]: Finished difference. Result has 96 places, 75 transitions, 925 flow [2023-11-06 21:54:28,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=1954, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=925, PETRI_PLACES=96, PETRI_TRANSITIONS=75} [2023-11-06 21:54:28,905 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2023-11-06 21:54:28,905 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 75 transitions, 925 flow [2023-11-06 21:54:28,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 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) [2023-11-06 21:54:28,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:28,906 INFO L208 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] [2023-11-06 21:54:28,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 21:54:28,906 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:54:28,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:28,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1680291585, now seen corresponding path program 1 times [2023-11-06 21:54:28,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:28,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755807519] [2023-11-06 21:54:28,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:28,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:30,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:30,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:30,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755807519] [2023-11-06 21:54:30,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755807519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:30,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:30,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:54:30,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601831839] [2023-11-06 21:54:30,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:30,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 21:54:30,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:30,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 21:54:30,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:54:30,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 242 [2023-11-06 21:54:30,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 75 transitions, 925 flow. Second operand has 10 states, 10 states have (on average 101.7) internal successors, (1017), 10 states have internal predecessors, (1017), 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) [2023-11-06 21:54:30,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:30,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 242 [2023-11-06 21:54:30,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:31,499 INFO L124 PetriNetUnfolderBase]: 1614/2539 cut-off events. [2023-11-06 21:54:31,499 INFO L125 PetriNetUnfolderBase]: For 23506/23637 co-relation queries the response was YES. [2023-11-06 21:54:31,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16138 conditions, 2539 events. 1614/2539 cut-off events. For 23506/23637 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 12663 event pairs, 210 based on Foata normal form. 70/2588 useless extension candidates. Maximal degree in co-relation 16107. Up to 1205 conditions per place. [2023-11-06 21:54:31,515 INFO L140 encePairwiseOnDemand]: 232/242 looper letters, 58 selfloop transitions, 6 changer transitions 152/218 dead transitions. [2023-11-06 21:54:31,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 218 transitions, 2969 flow [2023-11-06 21:54:31,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:54:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 21:54:31,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1191 transitions. [2023-11-06 21:54:31,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44740796393688953 [2023-11-06 21:54:31,520 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1191 transitions. [2023-11-06 21:54:31,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1191 transitions. [2023-11-06 21:54:31,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:31,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1191 transitions. [2023-11-06 21:54:31,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 108.27272727272727) internal successors, (1191), 11 states have internal predecessors, (1191), 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) [2023-11-06 21:54:31,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:31,531 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 242.0) internal successors, (2904), 12 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:31,531 INFO L175 Difference]: Start difference. First operand has 96 places, 75 transitions, 925 flow. Second operand 11 states and 1191 transitions. [2023-11-06 21:54:31,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 218 transitions, 2969 flow [2023-11-06 21:54:31,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 218 transitions, 2375 flow, removed 162 selfloop flow, removed 21 redundant places. [2023-11-06 21:54:31,604 INFO L231 Difference]: Finished difference. Result has 87 places, 51 transitions, 413 flow [2023-11-06 21:54:31,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=413, PETRI_PLACES=87, PETRI_TRANSITIONS=51} [2023-11-06 21:54:31,605 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2023-11-06 21:54:31,605 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 51 transitions, 413 flow [2023-11-06 21:54:31,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 101.7) internal successors, (1017), 10 states have internal predecessors, (1017), 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) [2023-11-06 21:54:31,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:31,606 INFO L208 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] [2023-11-06 21:54:31,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 21:54:31,607 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-06 21:54:31,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:31,607 INFO L85 PathProgramCache]: Analyzing trace with hash -2028878019, now seen corresponding path program 2 times [2023-11-06 21:54:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:31,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443379996] [2023-11-06 21:54:31,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:31,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:54:31,652 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:54:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:54:31,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:54:31,748 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:54:31,750 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-06 21:54:31,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-06 21:54:31,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-06 21:54:31,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-06 21:54:31,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-06 21:54:31,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-06 21:54:31,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-06 21:54:31,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 21:54:31,754 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:31,761 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 21:54:31,761 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:54:31,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:54:31 BasicIcfg [2023-11-06 21:54:31,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:54:31,874 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:54:31,874 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:54:31,875 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:54:31,875 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:32" (3/4) ... [2023-11-06 21:54:31,876 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 21:54:31,988 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 21:54:31,988 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:54:31,989 INFO L158 Benchmark]: Toolchain (without parser) took 60956.70ms. Allocated memory was 132.1MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 84.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 882.2MB. Max. memory is 16.1GB. [2023-11-06 21:54:31,989 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 132.1MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:54:31,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.20ms. Allocated memory is still 132.1MB. Free memory was 84.4MB in the beginning and 100.4MB in the end (delta: -16.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2023-11-06 21:54:31,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 117.79ms. Allocated memory was 132.1MB in the beginning and 180.4MB in the end (delta: 48.2MB). Free memory was 100.3MB in the beginning and 149.6MB in the end (delta: -49.2MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2023-11-06 21:54:31,990 INFO L158 Benchmark]: Boogie Preprocessor took 39.32ms. Allocated memory is still 180.4MB. Free memory was 149.6MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:54:31,991 INFO L158 Benchmark]: RCFGBuilder took 908.11ms. Allocated memory is still 180.4MB. Free memory was 147.4MB in the beginning and 109.6MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-06 21:54:31,991 INFO L158 Benchmark]: TraceAbstraction took 59039.68ms. Allocated memory was 180.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 108.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 839.9MB. Max. memory is 16.1GB. [2023-11-06 21:54:31,991 INFO L158 Benchmark]: Witness Printer took 113.85ms. Allocated memory is still 2.9GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 21:54:31,994 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 132.1MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 728.20ms. Allocated memory is still 132.1MB. Free memory was 84.4MB in the beginning and 100.4MB in the end (delta: -16.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 117.79ms. Allocated memory was 132.1MB in the beginning and 180.4MB in the end (delta: 48.2MB). Free memory was 100.3MB in the beginning and 149.6MB in the end (delta: -49.2MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.32ms. Allocated memory is still 180.4MB. Free memory was 149.6MB in the beginning and 147.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 908.11ms. Allocated memory is still 180.4MB. Free memory was 147.4MB in the beginning and 109.6MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 59039.68ms. Allocated memory was 180.4MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 108.6MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 839.9MB. Max. memory is 16.1GB. * Witness Printer took 113.85ms. Allocated memory is still 2.9GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 139 PlacesBefore, 44 PlacesAfterwards, 128 TransitionsBefore, 32 TransitionsAfterwards, 3218 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 8831 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3408, independent: 3176, independent conditional: 0, independent unconditional: 3176, dependent: 232, dependent conditional: 0, dependent unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1654, independent: 1624, independent conditional: 0, independent unconditional: 1624, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3408, independent: 1552, independent conditional: 0, independent unconditional: 1552, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 1654, unknown conditional: 0, unknown unconditional: 1654] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t773; [L847] FCALL, FORK 0 pthread_create(&t773, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t773, ((void *)0), P0, ((void *)0))=-2, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t774; [L849] FCALL, FORK 0 pthread_create(&t774, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t774, ((void *)0), P1, ((void *)0))=-1, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t775; [L851] FCALL, FORK 0 pthread_create(&t775, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t775, ((void *)0), P2, ((void *)0))=0, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t776; [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L789] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L789] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L853] FCALL, FORK 0 pthread_create(&t776, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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(&t776, ((void *)0), P3, ((void *)0))=1, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 168 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: 58.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 37.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1293 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1024 mSDsluCounter, 992 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 796 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2811 IncrementalHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 196 mSDtfsCounter, 2811 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4176occurred in iteration=13, InterpolantAutomatonStates: 102, 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.7s SatisfiabilityAnalysisTime, 14.9s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 265 ConstructedInterpolants, 0 QuantifiedInterpolants, 2779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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! [2023-11-06 21:54:32,026 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a5806cb-de36-49c1-8c5f-1f07c9694c32/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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