./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:26:32,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:26:32,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:26:32,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:26:32,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:26:32,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:26:32,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:26:32,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:26:32,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:26:32,150 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:26:32,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:26:32,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:26:32,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:26:32,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:26:32,153 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:26:32,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:26:32,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:26:32,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:26:32,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:26:32,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:26:32,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:26:32,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:26:32,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:26:32,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:26:32,159 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:26:32,159 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:26:32,174 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:26:32,175 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:26:32,175 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:26:32,175 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:26:32,175 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:26:32,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:26:32,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:26:32,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:26:32,176 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:26:32,176 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:26:32,176 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:26:32,176 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:26:32,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:26:32,176 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:26:32,176 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:26:32,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:26:32,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:26:32,177 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> bf24bf121ebc3ec235b4f1c2077ea9383a107f5a378f2adee68bd8bbb156b315 [2024-06-27 17:26:32,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:26:32,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:26:32,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:26:32,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:26:32,397 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:26:32,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-06-27 17:26:33,419 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:26:33,612 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:26:33,613 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-06-27 17:26:33,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226cd2e0c/9795597d5ca342c0a419315a2dc35794/FLAG5517818bd [2024-06-27 17:26:33,635 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226cd2e0c/9795597d5ca342c0a419315a2dc35794 [2024-06-27 17:26:33,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:26:33,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:26:33,639 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:26:33,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:26:33,649 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:26:33,649 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:26:33" (1/1) ... [2024-06-27 17:26:33,650 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d03562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:33, skipping insertion in model container [2024-06-27 17:26:33,650 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:26:33" (1/1) ... [2024-06-27 17:26:33,706 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:26:33,886 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2024-06-27 17:26:34,105 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:26:34,118 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:26:34,128 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i[986,999] [2024-06-27 17:26:34,184 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:26:34,225 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:26:34,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34 WrapperNode [2024-06-27 17:26:34,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:26:34,227 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:26:34,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:26:34,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:26:34,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,286 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-06-27 17:26:34,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:26:34,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:26:34,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:26:34,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:26:34,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,311 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,324 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 17:26:34,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:26:34,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:26:34,349 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:26:34,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:26:34,350 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (1/1) ... [2024-06-27 17:26:34,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:26:34,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:26:34,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:26:34,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:26:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:26:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:26:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 17:26:34,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 17:26:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 17:26:34,431 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 17:26:34,432 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 17:26:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 17:26:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 17:26:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 17:26:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:26:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:26:34,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:26:34,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:26:34,435 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:26:34,538 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:26:34,539 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:26:34,801 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:26:34,802 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:26:34,949 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:26:34,949 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 17:26:34,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:26:34 BoogieIcfgContainer [2024-06-27 17:26:34,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:26:34,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:26:34,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:26:34,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:26:34,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:26:33" (1/3) ... [2024-06-27 17:26:34,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318b8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:26:34, skipping insertion in model container [2024-06-27 17:26:34,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:26:34" (2/3) ... [2024-06-27 17:26:34,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@318b8c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:26:34, skipping insertion in model container [2024-06-27 17:26:34,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:26:34" (3/3) ... [2024-06-27 17:26:34,994 INFO L112 eAbstractionObserver]: Analyzing ICFG mix029_power.oepc_pso.oepc_rmo.oepc_tso.oepc_tso.opt.i [2024-06-27 17:26:35,000 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:26:35,009 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:26:35,009 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-27 17:26:35,009 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:26:35,051 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 17:26:35,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-06-27 17:26:35,106 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-06-27 17:26:35,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:26:35,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-06-27 17:26:35,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-06-27 17:26:35,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-06-27 17:26:35,123 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:26:35,128 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=LoopHeads, 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;@5f1ccf1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:26:35,128 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 17:26:35,131 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:26:35,131 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 17:26:35,131 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:26:35,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:35,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-06-27 17:26:35,132 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:35,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:35,136 INFO L85 PathProgramCache]: Analyzing trace with hash 11930355, now seen corresponding path program 1 times [2024-06-27 17:26:35,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:35,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70632466] [2024-06-27 17:26:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:35,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:35,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:35,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:35,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70632466] [2024-06-27 17:26:35,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70632466] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:35,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:35,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 17:26:35,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882305486] [2024-06-27 17:26:35,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:35,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:26:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:35,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:26:35,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:26:35,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2024-06-27 17:26:35,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2024-06-27 17:26:35,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:35,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2024-06-27 17:26:35,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:36,095 INFO L124 PetriNetUnfolderBase]: 2495/4136 cut-off events. [2024-06-27 17:26:36,096 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-06-27 17:26:36,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7712 conditions, 4136 events. 2495/4136 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 28511 event pairs, 443 based on Foata normal form. 135/4200 useless extension candidates. Maximal degree in co-relation 7700. Up to 2779 conditions per place. [2024-06-27 17:26:36,124 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 37 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2024-06-27 17:26:36,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 61 transitions, 225 flow [2024-06-27 17:26:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:26:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:26:36,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-06-27 17:26:36,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7891156462585034 [2024-06-27 17:26:36,137 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 116 transitions. [2024-06-27 17:26:36,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 61 transitions, 225 flow [2024-06-27 17:26:36,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 61 transitions, 218 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:26:36,146 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-06-27 17:26:36,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-06-27 17:26:36,152 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-06-27 17:26:36,153 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-06-27 17:26:36,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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) [2024-06-27 17:26:36,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:36,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:36,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:26:36,154 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:36,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:36,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1457321110, now seen corresponding path program 1 times [2024-06-27 17:26:36,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:36,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753584362] [2024-06-27 17:26:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:36,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:36,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:36,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753584362] [2024-06-27 17:26:36,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753584362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:36,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:36,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:26:36,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177893988] [2024-06-27 17:26:36,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:36,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:26:36,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:36,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:26:36,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:26:36,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-06-27 17:26:36,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2024-06-27 17:26:36,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:36,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-06-27 17:26:36,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:37,425 INFO L124 PetriNetUnfolderBase]: 7779/12167 cut-off events. [2024-06-27 17:26:37,425 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2024-06-27 17:26:37,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23583 conditions, 12167 events. 7779/12167 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 702. Compared 86792 event pairs, 1033 based on Foata normal form. 400/12068 useless extension candidates. Maximal degree in co-relation 23573. Up to 5841 conditions per place. [2024-06-27 17:26:37,535 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 52 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2024-06-27 17:26:37,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 74 transitions, 288 flow [2024-06-27 17:26:37,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:26:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:26:37,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions. [2024-06-27 17:26:37,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6989795918367347 [2024-06-27 17:26:37,538 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 137 transitions. [2024-06-27 17:26:37,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 74 transitions, 288 flow [2024-06-27 17:26:37,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 74 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:26:37,540 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2024-06-27 17:26:37,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-06-27 17:26:37,541 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-06-27 17:26:37,541 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2024-06-27 17:26:37,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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) [2024-06-27 17:26:37,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:37,541 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] [2024-06-27 17:26:37,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:26:37,542 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:37,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1264106216, now seen corresponding path program 1 times [2024-06-27 17:26:37,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:37,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512943790] [2024-06-27 17:26:37,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:37,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:37,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:37,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512943790] [2024-06-27 17:26:37,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512943790] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:37,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:37,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:26:37,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804745539] [2024-06-27 17:26:37,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:37,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:26:37,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:37,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:26:37,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:26:37,668 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-06-27 17:26:37,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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) [2024-06-27 17:26:37,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:37,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-06-27 17:26:37,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:38,503 INFO L124 PetriNetUnfolderBase]: 6075/9467 cut-off events. [2024-06-27 17:26:38,504 INFO L125 PetriNetUnfolderBase]: For 2276/2276 co-relation queries the response was YES. [2024-06-27 17:26:38,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21251 conditions, 9467 events. 6075/9467 cut-off events. For 2276/2276 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 63571 event pairs, 451 based on Foata normal form. 364/9470 useless extension candidates. Maximal degree in co-relation 21239. Up to 3681 conditions per place. [2024-06-27 17:26:38,557 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 67 selfloop transitions, 10 changer transitions 1/93 dead transitions. [2024-06-27 17:26:38,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 93 transitions, 413 flow [2024-06-27 17:26:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:26:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:26:38,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-06-27 17:26:38,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2024-06-27 17:26:38,563 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 175 transitions. [2024-06-27 17:26:38,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 93 transitions, 413 flow [2024-06-27 17:26:38,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 402 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 17:26:38,568 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2024-06-27 17:26:38,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-06-27 17:26:38,569 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-06-27 17:26:38,569 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2024-06-27 17:26:38,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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) [2024-06-27 17:26:38,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:38,570 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] [2024-06-27 17:26:38,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:26:38,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:38,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:38,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1510528105, now seen corresponding path program 1 times [2024-06-27 17:26:38,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:38,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299571404] [2024-06-27 17:26:38,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:38,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:38,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:38,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299571404] [2024-06-27 17:26:38,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299571404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:38,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:38,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:26:38,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096020012] [2024-06-27 17:26:38,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:38,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:26:38,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:38,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:26:38,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:26:38,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-06-27 17:26:38,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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) [2024-06-27 17:26:38,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:38,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-06-27 17:26:38,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:39,324 INFO L124 PetriNetUnfolderBase]: 4027/6115 cut-off events. [2024-06-27 17:26:39,324 INFO L125 PetriNetUnfolderBase]: For 4654/4654 co-relation queries the response was YES. [2024-06-27 17:26:39,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15565 conditions, 6115 events. 4027/6115 cut-off events. For 4654/4654 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 35758 event pairs, 289 based on Foata normal form. 244/6151 useless extension candidates. Maximal degree in co-relation 15551. Up to 1788 conditions per place. [2024-06-27 17:26:39,351 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 80 selfloop transitions, 14 changer transitions 1/110 dead transitions. [2024-06-27 17:26:39,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 110 transitions, 544 flow [2024-06-27 17:26:39,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:26:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:26:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 211 transitions. [2024-06-27 17:26:39,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717687074829932 [2024-06-27 17:26:39,353 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 211 transitions. [2024-06-27 17:26:39,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 110 transitions, 544 flow [2024-06-27 17:26:39,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 110 transitions, 514 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 17:26:39,372 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2024-06-27 17:26:39,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-06-27 17:26:39,373 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2024-06-27 17:26:39,373 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2024-06-27 17:26:39,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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) [2024-06-27 17:26:39,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:39,374 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, 1, 1, 1] [2024-06-27 17:26:39,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:26:39,374 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:39,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash 157947390, now seen corresponding path program 1 times [2024-06-27 17:26:39,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:39,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136047163] [2024-06-27 17:26:39,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:39,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:39,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:39,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136047163] [2024-06-27 17:26:39,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136047163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:39,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:39,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:26:39,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657054899] [2024-06-27 17:26:39,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:39,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:26:39,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:39,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:26:39,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:26:39,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 49 [2024-06-27 17:26:39,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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) [2024-06-27 17:26:39,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:39,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 49 [2024-06-27 17:26:39,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:39,974 INFO L124 PetriNetUnfolderBase]: 2863/4163 cut-off events. [2024-06-27 17:26:39,974 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2024-06-27 17:26:39,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11590 conditions, 4163 events. 2863/4163 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21805 event pairs, 231 based on Foata normal form. 96/4131 useless extension candidates. Maximal degree in co-relation 11575. Up to 1316 conditions per place. [2024-06-27 17:26:39,991 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 71 selfloop transitions, 18 changer transitions 1/105 dead transitions. [2024-06-27 17:26:39,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 534 flow [2024-06-27 17:26:39,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:26:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:26:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2024-06-27 17:26:39,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6559766763848397 [2024-06-27 17:26:39,993 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 225 transitions. [2024-06-27 17:26:39,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 534 flow [2024-06-27 17:26:40,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 105 transitions, 488 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 17:26:40,018 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2024-06-27 17:26:40,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-06-27 17:26:40,018 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-06-27 17:26:40,019 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2024-06-27 17:26:40,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 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) [2024-06-27 17:26:40,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:40,019 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:40,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:26:40,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:40,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1391379549, now seen corresponding path program 1 times [2024-06-27 17:26:40,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:40,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547653442] [2024-06-27 17:26:40,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:40,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547653442] [2024-06-27 17:26:40,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547653442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:40,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:40,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 17:26:40,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295244472] [2024-06-27 17:26:40,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:40,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:26:40,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:40,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:26:40,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:26:40,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-27 17:26:40,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 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) [2024-06-27 17:26:40,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:40,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-27 17:26:40,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:43,038 INFO L124 PetriNetUnfolderBase]: 14918/22639 cut-off events. [2024-06-27 17:26:43,039 INFO L125 PetriNetUnfolderBase]: For 9398/9778 co-relation queries the response was YES. [2024-06-27 17:26:43,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53164 conditions, 22639 events. 14918/22639 cut-off events. For 9398/9778 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 161145 event pairs, 1834 based on Foata normal form. 16/21987 useless extension candidates. Maximal degree in co-relation 53148. Up to 5350 conditions per place. [2024-06-27 17:26:43,167 INFO L140 encePairwiseOnDemand]: 33/49 looper letters, 122 selfloop transitions, 37 changer transitions 14/197 dead transitions. [2024-06-27 17:26:43,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 197 transitions, 940 flow [2024-06-27 17:26:43,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 17:26:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 17:26:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 350 transitions. [2024-06-27 17:26:43,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6493506493506493 [2024-06-27 17:26:43,169 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 11 states and 350 transitions. [2024-06-27 17:26:43,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 197 transitions, 940 flow [2024-06-27 17:26:43,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 197 transitions, 814 flow, removed 32 selfloop flow, removed 10 redundant places. [2024-06-27 17:26:43,533 INFO L231 Difference]: Finished difference. Result has 76 places, 92 transitions, 450 flow [2024-06-27 17:26:43,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=450, PETRI_PLACES=76, PETRI_TRANSITIONS=92} [2024-06-27 17:26:43,536 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2024-06-27 17:26:43,536 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 92 transitions, 450 flow [2024-06-27 17:26:43,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 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) [2024-06-27 17:26:43,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:43,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:43,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:26:43,537 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:43,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1036544739, now seen corresponding path program 2 times [2024-06-27 17:26:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:43,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822749412] [2024-06-27 17:26:43,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:43,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:43,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822749412] [2024-06-27 17:26:43,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822749412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:43,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:43,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 17:26:43,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728544979] [2024-06-27 17:26:43,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:43,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 17:26:43,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:43,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 17:26:43,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 17:26:43,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2024-06-27 17:26:43,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 92 transitions, 450 flow. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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) [2024-06-27 17:26:43,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:43,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2024-06-27 17:26:43,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:47,073 INFO L124 PetriNetUnfolderBase]: 26770/40505 cut-off events. [2024-06-27 17:26:47,074 INFO L125 PetriNetUnfolderBase]: For 46748/46754 co-relation queries the response was YES. [2024-06-27 17:26:47,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118999 conditions, 40505 events. 26770/40505 cut-off events. For 46748/46754 co-relation queries the response was YES. Maximal size of possible extension queue 2118. Compared 306779 event pairs, 4299 based on Foata normal form. 22/39155 useless extension candidates. Maximal degree in co-relation 118978. Up to 14193 conditions per place. [2024-06-27 17:26:47,271 INFO L140 encePairwiseOnDemand]: 37/49 looper letters, 71 selfloop transitions, 25 changer transitions 109/228 dead transitions. [2024-06-27 17:26:47,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 228 transitions, 1518 flow [2024-06-27 17:26:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:26:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:26:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 244 transitions. [2024-06-27 17:26:47,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6224489795918368 [2024-06-27 17:26:47,273 INFO L175 Difference]: Start difference. First operand has 76 places, 92 transitions, 450 flow. Second operand 8 states and 244 transitions. [2024-06-27 17:26:47,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 228 transitions, 1518 flow [2024-06-27 17:26:47,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 228 transitions, 1512 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 17:26:47,384 INFO L231 Difference]: Finished difference. Result has 84 places, 85 transitions, 491 flow [2024-06-27 17:26:47,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=491, PETRI_PLACES=84, PETRI_TRANSITIONS=85} [2024-06-27 17:26:47,385 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2024-06-27 17:26:47,385 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 85 transitions, 491 flow [2024-06-27 17:26:47,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 7 states have internal predecessors, (132), 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) [2024-06-27 17:26:47,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:47,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:47,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:26:47,386 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:47,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:47,387 INFO L85 PathProgramCache]: Analyzing trace with hash 508777571, now seen corresponding path program 3 times [2024-06-27 17:26:47,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:47,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486474402] [2024-06-27 17:26:47,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:47,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:47,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:47,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486474402] [2024-06-27 17:26:47,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486474402] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:47,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:47,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 17:26:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98620724] [2024-06-27 17:26:47,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:47,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:26:47,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:47,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:26:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:26:47,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2024-06-27 17:26:47,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 85 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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) [2024-06-27 17:26:47,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:47,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2024-06-27 17:26:47,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:49,444 INFO L124 PetriNetUnfolderBase]: 12896/20848 cut-off events. [2024-06-27 17:26:49,444 INFO L125 PetriNetUnfolderBase]: For 31636/31722 co-relation queries the response was YES. [2024-06-27 17:26:49,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60785 conditions, 20848 events. 12896/20848 cut-off events. For 31636/31722 co-relation queries the response was YES. Maximal size of possible extension queue 1218. Compared 162213 event pairs, 3870 based on Foata normal form. 25/19721 useless extension candidates. Maximal degree in co-relation 60759. Up to 9710 conditions per place. [2024-06-27 17:26:49,542 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 50 selfloop transitions, 11 changer transitions 57/143 dead transitions. [2024-06-27 17:26:49,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 143 transitions, 983 flow [2024-06-27 17:26:49,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:26:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:26:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2024-06-27 17:26:49,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6156462585034014 [2024-06-27 17:26:49,544 INFO L175 Difference]: Start difference. First operand has 84 places, 85 transitions, 491 flow. Second operand 6 states and 181 transitions. [2024-06-27 17:26:49,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 143 transitions, 983 flow [2024-06-27 17:26:49,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 143 transitions, 971 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 17:26:49,619 INFO L231 Difference]: Finished difference. Result has 87 places, 66 transitions, 369 flow [2024-06-27 17:26:49,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=87, PETRI_TRANSITIONS=66} [2024-06-27 17:26:49,622 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places. [2024-06-27 17:26:49,622 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 66 transitions, 369 flow [2024-06-27 17:26:49,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 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) [2024-06-27 17:26:49,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:49,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:49,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:26:49,624 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:49,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:49,625 INFO L85 PathProgramCache]: Analyzing trace with hash 635921997, now seen corresponding path program 4 times [2024-06-27 17:26:49,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:49,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549271249] [2024-06-27 17:26:49,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:49,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:26:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:26:49,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:26:49,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549271249] [2024-06-27 17:26:49,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549271249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:26:49,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:26:49,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:26:49,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342270655] [2024-06-27 17:26:49,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:26:49,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:26:49,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:26:49,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:26:49,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:26:49,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-06-27 17:26:49,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 66 transitions, 369 flow. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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) [2024-06-27 17:26:49,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:26:49,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-06-27 17:26:49,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:26:50,525 INFO L124 PetriNetUnfolderBase]: 4490/7668 cut-off events. [2024-06-27 17:26:50,526 INFO L125 PetriNetUnfolderBase]: For 6467/6566 co-relation queries the response was YES. [2024-06-27 17:26:50,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19801 conditions, 7668 events. 4490/7668 cut-off events. For 6467/6566 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 54522 event pairs, 2231 based on Foata normal form. 36/7205 useless extension candidates. Maximal degree in co-relation 19772. Up to 3267 conditions per place. [2024-06-27 17:26:50,559 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 33 selfloop transitions, 2 changer transitions 28/92 dead transitions. [2024-06-27 17:26:50,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 92 transitions, 579 flow [2024-06-27 17:26:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:26:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:26:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-06-27 17:26:50,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6204081632653061 [2024-06-27 17:26:50,561 INFO L175 Difference]: Start difference. First operand has 87 places, 66 transitions, 369 flow. Second operand 5 states and 152 transitions. [2024-06-27 17:26:50,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 92 transitions, 579 flow [2024-06-27 17:26:50,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 92 transitions, 531 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-06-27 17:26:50,574 INFO L231 Difference]: Finished difference. Result has 83 places, 56 transitions, 249 flow [2024-06-27 17:26:50,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=83, PETRI_TRANSITIONS=56} [2024-06-27 17:26:50,576 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 26 predicate places. [2024-06-27 17:26:50,576 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 56 transitions, 249 flow [2024-06-27 17:26:50,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 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) [2024-06-27 17:26:50,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:26:50,576 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:26:50,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:26:50,577 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:26:50,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:26:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash -759458831, now seen corresponding path program 5 times [2024-06-27 17:26:50,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:26:50,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740380664] [2024-06-27 17:26:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:26:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:26:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:26:50,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:26:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:26:50,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:26:50,707 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:26:50,708 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 17:26:50,712 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 17:26:50,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-06-27 17:26:50,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-06-27 17:26:50,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 17:26:50,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 17:26:50,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 17:26:50,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:26:50,715 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1] [2024-06-27 17:26:50,721 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:26:50,721 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:26:50,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:26:50 BasicIcfg [2024-06-27 17:26:50,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:26:50,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:26:50,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:26:50,796 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:26:50,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:26:34" (3/4) ... [2024-06-27 17:26:50,797 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:26:50,865 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:26:50,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:26:50,866 INFO L158 Benchmark]: Toolchain (without parser) took 17227.23ms. Allocated memory was 109.1MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 55.3MB in the beginning and 7.1GB in the end (delta: -7.1GB). Peak memory consumption was 923.4MB. Max. memory is 16.1GB. [2024-06-27 17:26:50,866 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 109.1MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:26:50,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.67ms. Allocated memory was 109.1MB in the beginning and 174.1MB in the end (delta: 65.0MB). Free memory was 55.2MB in the beginning and 136.0MB in the end (delta: -80.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-06-27 17:26:50,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.05ms. Allocated memory is still 174.1MB. Free memory was 136.0MB in the beginning and 134.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:26:50,866 INFO L158 Benchmark]: Boogie Preprocessor took 56.54ms. Allocated memory is still 174.1MB. Free memory was 134.0MB in the beginning and 130.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:26:50,867 INFO L158 Benchmark]: RCFGBuilder took 605.22ms. Allocated memory is still 174.1MB. Free memory was 129.8MB in the beginning and 80.7MB in the end (delta: 49.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-06-27 17:26:50,867 INFO L158 Benchmark]: TraceAbstraction took 15807.27ms. Allocated memory was 174.1MB in the beginning and 8.1GB in the end (delta: 7.9GB). Free memory was 140.3MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 923.8MB. Max. memory is 16.1GB. [2024-06-27 17:26:50,867 INFO L158 Benchmark]: Witness Printer took 69.23ms. Allocated memory is still 8.1GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-06-27 17:26:50,869 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.28ms. Allocated memory is still 109.1MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.67ms. Allocated memory was 109.1MB in the beginning and 174.1MB in the end (delta: 65.0MB). Free memory was 55.2MB in the beginning and 136.0MB in the end (delta: -80.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.05ms. Allocated memory is still 174.1MB. Free memory was 136.0MB in the beginning and 134.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.54ms. Allocated memory is still 174.1MB. Free memory was 134.0MB in the beginning and 130.7MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 605.22ms. Allocated memory is still 174.1MB. Free memory was 129.8MB in the beginning and 80.7MB in the end (delta: 49.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15807.27ms. Allocated memory was 174.1MB in the beginning and 8.1GB in the end (delta: 7.9GB). Free memory was 140.3MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 923.8MB. Max. memory is 16.1GB. * Witness Printer took 69.23ms. Allocated memory is still 8.1GB. Free memory was 7.1GB in the beginning and 7.1GB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [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 a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t769; [L865] FCALL, FORK 0 pthread_create(&t769, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t770; [L867] FCALL, FORK 0 pthread_create(&t770, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, t770=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L780] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L783] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L868] 0 pthread_t t771; [L869] FCALL, FORK 0 pthread_create(&t771, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L800] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L870] 0 pthread_t t772; [L871] FCALL, FORK 0 pthread_create(&t772, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L803] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, z=1] [L820] 4 z = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, z=2] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=2] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=2] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=2] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=2] [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=2] [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=2] [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=2] [L884] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t769=-3, t770=-2, t771=-1, t772=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=2] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=2, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, 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: 871]: 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: 869]: 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: 867]: 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: 865]: 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, 83 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: 15.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 752 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 721 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 338 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1694 IncrementalHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 68 mSDtfsCounter, 1694 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491occurred in iteration=7, InterpolantAutomatonStates: 55, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 283 NumberOfCodeBlocks, 283 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 1561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 17:26:50,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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