./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix042.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/pthread-wmm/mix042.oepc.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 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:33:54,985 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:33:55,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:33:55,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:33:55,086 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:33:55,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:33:55,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:33:55,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:33:55,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:33:55,127 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:33:55,127 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:33:55,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:33:55,128 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:33:55,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:33:55,129 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:33:55,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:33:55,129 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:33:55,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:33:55,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:33:55,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:33:55,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:33:55,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:33:55,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:33:55,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:33:55,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:33:55,136 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:33:55,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:33:55,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:33:55,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:33:55,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:33:55,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:33:55,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:33:55,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:33:55,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:33:55,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:33:55,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:33:55,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:33:55,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:33:55,144 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:33:55,144 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:33:55,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:33:55,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:33:55,146 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 -> 65b1f643bcee3322b8ab5a998e6338f6065aa9114a28902f0ff5431bd8cb45ea [2024-11-19 01:33:55,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:33:55,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:33:55,414 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:33:55,416 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:33:55,416 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:33:55,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2024-11-19 01:33:56,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:33:57,204 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:33:57,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix042.oepc.i [2024-11-19 01:33:57,224 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7439a6aaa/2f78a730ebcf475faf619325497c00a2/FLAGe986027f3 [2024-11-19 01:33:57,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7439a6aaa/2f78a730ebcf475faf619325497c00a2 [2024-11-19 01:33:57,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:33:57,521 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:33:57,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:33:57,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:33:57,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:33:57,529 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:33:57" (1/1) ... [2024-11-19 01:33:57,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a61b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:57, skipping insertion in model container [2024-11-19 01:33:57,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:33:57" (1/1) ... [2024-11-19 01:33:57,577 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:33:57,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2024-11-19 01:33:57,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:33:58,019 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:33:58,032 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix042.oepc.i[945,958] [2024-11-19 01:33:58,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:33:58,140 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:33:58,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58 WrapperNode [2024-11-19 01:33:58,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:33:58,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:33:58,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:33:58,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:33:58,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,206 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-11-19 01:33:58,209 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:33:58,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:33:58,210 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:33:58,210 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:33:58,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,249 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-11-19 01:33:58,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,268 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,270 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:33:58,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:33:58,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:33:58,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:33:58,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (1/1) ... [2024-11-19 01:33:58,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:33:58,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:33:58,317 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-11-19 01:33:58,320 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-11-19 01:33:58,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 01:33:58,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:33:58,367 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 01:33:58,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 01:33:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 01:33:58,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 01:33:58,368 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 01:33:58,368 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 01:33:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:33:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 01:33:58,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:33:58,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:33:58,372 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 01:33:58,540 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:33:58,542 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:33:58,839 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:33:58,843 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:33:59,140 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:33:59,140 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 01:33:59,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:33:59 BoogieIcfgContainer [2024-11-19 01:33:59,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:33:59,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:33:59,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:33:59,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:33:59,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:33:57" (1/3) ... [2024-11-19 01:33:59,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe6ea99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:33:59, skipping insertion in model container [2024-11-19 01:33:59,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:58" (2/3) ... [2024-11-19 01:33:59,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe6ea99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:33:59, skipping insertion in model container [2024-11-19 01:33:59,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:33:59" (3/3) ... [2024-11-19 01:33:59,156 INFO L112 eAbstractionObserver]: Analyzing ICFG mix042.oepc.i [2024-11-19 01:33:59,174 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:33:59,175 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 01:33:59,175 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:33:59,241 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:33:59,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2024-11-19 01:33:59,313 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-11-19 01:33:59,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:33:59,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2024-11-19 01:33:59,323 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2024-11-19 01:33:59,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2024-11-19 01:33:59,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:33:59,345 INFO L333 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, 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;@3b54c5fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:33:59,346 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 01:33:59,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:33:59,350 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-19 01:33:59,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:33:59,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:59,351 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 01:33:59,351 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:33:59,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash 11170846, now seen corresponding path program 1 times [2024-11-19 01:33:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:59,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891344851] [2024-11-19 01:33:59,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:59,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:33:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:59,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891344851] [2024-11-19 01:33:59,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891344851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:59,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:59,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 01:33:59,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88091281] [2024-11-19 01:33:59,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:59,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:33:59,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:59,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:33:59,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:33:59,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 41 [2024-11-19 01:33:59,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-11-19 01:33:59,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:59,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 41 [2024-11-19 01:33:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:00,362 INFO L124 PetriNetUnfolderBase]: 617/1109 cut-off events. [2024-11-19 01:34:00,362 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 01:34:00,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2086 conditions, 1109 events. 617/1109 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6399 event pairs, 343 based on Foata normal form. 45/1130 useless extension candidates. Maximal degree in co-relation 2075. Up to 763 conditions per place. [2024-11-19 01:34:00,374 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 29 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2024-11-19 01:34:00,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 181 flow [2024-11-19 01:34:00,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:34:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:34:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-19 01:34:00,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7804878048780488 [2024-11-19 01:34:00,391 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 96 transitions. [2024-11-19 01:34:00,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 181 flow [2024-11-19 01:34:00,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 01:34:00,398 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-11-19 01:34:00,401 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-19 01:34:00,406 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-11-19 01:34:00,406 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-11-19 01:34:00,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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-11-19 01:34:00,407 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:00,407 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:34:00,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:34:00,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:00,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:00,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1925043263, now seen corresponding path program 1 times [2024-11-19 01:34:00,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:00,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053380866] [2024-11-19 01:34:00,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:00,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:00,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-11-19 01:34:00,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:00,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053380866] [2024-11-19 01:34:00,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053380866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:00,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:00,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:34:00,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027278662] [2024-11-19 01:34:00,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:00,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:34:00,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:00,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:34:00,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:34:00,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-11-19 01:34:00,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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-11-19 01:34:00,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:00,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-11-19 01:34:00,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:01,118 INFO L124 PetriNetUnfolderBase]: 1318/2360 cut-off events. [2024-11-19 01:34:01,120 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-19 01:34:01,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4539 conditions, 2360 events. 1318/2360 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15114 event pairs, 188 based on Foata normal form. 100/2311 useless extension candidates. Maximal degree in co-relation 4529. Up to 1053 conditions per place. [2024-11-19 01:34:01,136 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 41 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-11-19 01:34:01,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 232 flow [2024-11-19 01:34:01,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:34:01,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:34:01,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-11-19 01:34:01,140 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6890243902439024 [2024-11-19 01:34:01,140 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 4 states and 113 transitions. [2024-11-19 01:34:01,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 232 flow [2024-11-19 01:34:01,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:34:01,144 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 110 flow [2024-11-19 01:34:01,144 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2024-11-19 01:34:01,145 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2024-11-19 01:34:01,145 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 110 flow [2024-11-19 01:34:01,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 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-11-19 01:34:01,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:01,146 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:34:01,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:34:01,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:01,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash -921502353, now seen corresponding path program 1 times [2024-11-19 01:34:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:01,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949994299] [2024-11-19 01:34:01,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:01,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:34:01,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949994299] [2024-11-19 01:34:01,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949994299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:01,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:01,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:34:01,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300048909] [2024-11-19 01:34:01,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:01,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:34:01,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:01,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:34:01,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:34:01,430 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-11-19 01:34:01,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-11-19 01:34:01,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:01,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-11-19 01:34:01,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:01,787 INFO L124 PetriNetUnfolderBase]: 886/1574 cut-off events. [2024-11-19 01:34:01,788 INFO L125 PetriNetUnfolderBase]: For 411/411 co-relation queries the response was YES. [2024-11-19 01:34:01,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3551 conditions, 1574 events. 886/1574 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 8804 event pairs, 100 based on Foata normal form. 82/1568 useless extension candidates. Maximal degree in co-relation 3539. Up to 465 conditions per place. [2024-11-19 01:34:01,796 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 52 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2024-11-19 01:34:01,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 325 flow [2024-11-19 01:34:01,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:34:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:34:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 143 transitions. [2024-11-19 01:34:01,799 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.697560975609756 [2024-11-19 01:34:01,799 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 110 flow. Second operand 5 states and 143 transitions. [2024-11-19 01:34:01,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 325 flow [2024-11-19 01:34:01,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 315 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 01:34:01,801 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 150 flow [2024-11-19 01:34:01,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2024-11-19 01:34:01,802 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2024-11-19 01:34:01,802 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 150 flow [2024-11-19 01:34:01,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 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-11-19 01:34:01,803 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:01,803 INFO L204 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] [2024-11-19 01:34:01,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:34:01,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:01,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1574827714, now seen corresponding path program 1 times [2024-11-19 01:34:01,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:01,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727146825] [2024-11-19 01:34:01,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:01,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:02,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:34:02,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:02,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727146825] [2024-11-19 01:34:02,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727146825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:02,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:02,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:34:02,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726453803] [2024-11-19 01:34:02,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:02,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:34:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:02,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:34:02,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:34:02,124 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-11-19 01:34:02,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-11-19 01:34:02,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:02,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-11-19 01:34:02,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:02,394 INFO L124 PetriNetUnfolderBase]: 557/947 cut-off events. [2024-11-19 01:34:02,396 INFO L125 PetriNetUnfolderBase]: For 806/806 co-relation queries the response was YES. [2024-11-19 01:34:02,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2441 conditions, 947 events. 557/947 cut-off events. For 806/806 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4362 event pairs, 83 based on Foata normal form. 40/941 useless extension candidates. Maximal degree in co-relation 2427. Up to 308 conditions per place. [2024-11-19 01:34:02,403 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 45 selfloop transitions, 11 changer transitions 1/70 dead transitions. [2024-11-19 01:34:02,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 332 flow [2024-11-19 01:34:02,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:34:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:34:02,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 155 transitions. [2024-11-19 01:34:02,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6300813008130082 [2024-11-19 01:34:02,405 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 150 flow. Second operand 6 states and 155 transitions. [2024-11-19 01:34:02,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 332 flow [2024-11-19 01:34:02,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 307 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-19 01:34:02,417 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 164 flow [2024-11-19 01:34:02,417 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2024-11-19 01:34:02,418 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2024-11-19 01:34:02,419 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 164 flow [2024-11-19 01:34:02,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 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-11-19 01:34:02,419 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:02,419 INFO L204 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-11-19 01:34:02,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:34:02,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:02,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1965235538, now seen corresponding path program 1 times [2024-11-19 01:34:02,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:02,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097457486] [2024-11-19 01:34:02,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:34:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:34:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:34:04,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:04,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097457486] [2024-11-19 01:34:04,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097457486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:04,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:04,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:34:04,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506257928] [2024-11-19 01:34:04,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:04,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:34:04,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:04,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:34:04,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:34:04,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-11-19 01:34:04,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 164 flow. Second operand has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 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-11-19 01:34:04,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:04,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-11-19 01:34:04,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:04,768 INFO L124 PetriNetUnfolderBase]: 453/879 cut-off events. [2024-11-19 01:34:04,768 INFO L125 PetriNetUnfolderBase]: For 479/503 co-relation queries the response was YES. [2024-11-19 01:34:04,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 879 events. 453/879 cut-off events. For 479/503 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4534 event pairs, 64 based on Foata normal form. 8/842 useless extension candidates. Maximal degree in co-relation 2050. Up to 236 conditions per place. [2024-11-19 01:34:04,775 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 34 selfloop transitions, 4 changer transitions 24/83 dead transitions. [2024-11-19 01:34:04,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 388 flow [2024-11-19 01:34:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:34:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:34:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 225 transitions. [2024-11-19 01:34:04,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-11-19 01:34:04,778 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 164 flow. Second operand 9 states and 225 transitions. [2024-11-19 01:34:04,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 388 flow [2024-11-19 01:34:04,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 324 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-19 01:34:04,785 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 126 flow [2024-11-19 01:34:04,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-11-19 01:34:04,787 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2024-11-19 01:34:04,787 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 126 flow [2024-11-19 01:34:04,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 19.88888888888889) internal successors, (179), 9 states have internal predecessors, (179), 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-11-19 01:34:04,787 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:04,787 INFO L204 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-11-19 01:34:04,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:34:04,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:04,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1624811860, now seen corresponding path program 2 times [2024-11-19 01:34:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:04,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464036847] [2024-11-19 01:34:04,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:34:04,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:04,898 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:34:04,899 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:34:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:34:05,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:05,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464036847] [2024-11-19 01:34:05,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464036847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:05,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:05,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:34:05,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706056853] [2024-11-19 01:34:05,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:05,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:34:05,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:05,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:34:05,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:34:05,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-11-19 01:34:05,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 126 flow. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-11-19 01:34:05,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:05,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-11-19 01:34:05,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:05,473 INFO L124 PetriNetUnfolderBase]: 697/1328 cut-off events. [2024-11-19 01:34:05,474 INFO L125 PetriNetUnfolderBase]: For 239/240 co-relation queries the response was YES. [2024-11-19 01:34:05,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 1328 events. 697/1328 cut-off events. For 239/240 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7190 event pairs, 182 based on Foata normal form. 8/1285 useless extension candidates. Maximal degree in co-relation 2861. Up to 562 conditions per place. [2024-11-19 01:34:05,480 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 29 selfloop transitions, 1 changer transitions 22/71 dead transitions. [2024-11-19 01:34:05,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 71 transitions, 313 flow [2024-11-19 01:34:05,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:34:05,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:34:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-19 01:34:05,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6056910569105691 [2024-11-19 01:34:05,482 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 126 flow. Second operand 6 states and 149 transitions. [2024-11-19 01:34:05,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 71 transitions, 313 flow [2024-11-19 01:34:05,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 287 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-19 01:34:05,485 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 123 flow [2024-11-19 01:34:05,485 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2024-11-19 01:34:05,486 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2024-11-19 01:34:05,486 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 123 flow [2024-11-19 01:34:05,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 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-11-19 01:34:05,487 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:05,487 INFO L204 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-11-19 01:34:05,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:34:05,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:05,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:05,488 INFO L85 PathProgramCache]: Analyzing trace with hash 540936110, now seen corresponding path program 3 times [2024-11-19 01:34:05,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:05,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895824683] [2024-11-19 01:34:05,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:34:05,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:05,548 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 01:34:05,548 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:34:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 01:34:05,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:34:05,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895824683] [2024-11-19 01:34:05,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895824683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:34:05,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:34:05,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:34:05,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213702308] [2024-11-19 01:34:05,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:34:05,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:34:05,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:34:05,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:34:05,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:34:05,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-11-19 01:34:05,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-11-19 01:34:05,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:34:05,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-11-19 01:34:05,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:34:06,114 INFO L124 PetriNetUnfolderBase]: 930/1749 cut-off events. [2024-11-19 01:34:06,115 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-11-19 01:34:06,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3603 conditions, 1749 events. 930/1749 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10149 event pairs, 351 based on Foata normal form. 8/1701 useless extension candidates. Maximal degree in co-relation 3588. Up to 756 conditions per place. [2024-11-19 01:34:06,123 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 30 selfloop transitions, 6 changer transitions 15/68 dead transitions. [2024-11-19 01:34:06,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 293 flow [2024-11-19 01:34:06,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:34:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:34:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-11-19 01:34:06,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5951219512195122 [2024-11-19 01:34:06,125 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 123 flow. Second operand 5 states and 122 transitions. [2024-11-19 01:34:06,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 293 flow [2024-11-19 01:34:06,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 282 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 01:34:06,127 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 160 flow [2024-11-19 01:34:06,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-11-19 01:34:06,128 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2024-11-19 01:34:06,129 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 160 flow [2024-11-19 01:34:06,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-11-19 01:34:06,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:34:06,129 INFO L204 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-11-19 01:34:06,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:34:06,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:34:06,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:34:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1015483482, now seen corresponding path program 4 times [2024-11-19 01:34:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:34:06,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137872775] [2024-11-19 01:34:06,130 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:34:06,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:34:06,193 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:34:06,193 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 01:34:06,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:34:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:34:06,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:34:06,311 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:34:06,312 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-19 01:34:06,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-19 01:34:06,314 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-19 01:34:06,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-19 01:34:06,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-19 01:34:06,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-19 01:34:06,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:34:06,316 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-11-19 01:34:06,404 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:34:06,405 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:34:06,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:34:06 BasicIcfg [2024-11-19 01:34:06,410 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:34:06,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:34:06,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:34:06,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:34:06,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:33:59" (3/4) ... [2024-11-19 01:34:06,412 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 01:34:06,504 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:34:06,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:34:06,504 INFO L158 Benchmark]: Toolchain (without parser) took 8983.36ms. Allocated memory was 163.6MB in the beginning and 331.4MB in the end (delta: 167.8MB). Free memory was 104.2MB in the beginning and 146.1MB in the end (delta: -41.9MB). Peak memory consumption was 126.6MB. Max. memory is 16.1GB. [2024-11-19 01:34:06,505 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory was 125.2MB in the beginning and 124.9MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:34:06,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.64ms. Allocated memory is still 163.6MB. Free memory was 103.8MB in the beginning and 77.3MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 01:34:06,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.64ms. Allocated memory is still 163.6MB. Free memory was 77.3MB in the beginning and 74.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:34:06,506 INFO L158 Benchmark]: Boogie Preprocessor took 72.65ms. Allocated memory is still 163.6MB. Free memory was 74.8MB in the beginning and 71.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:34:06,506 INFO L158 Benchmark]: RCFGBuilder took 859.19ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 71.4MB in the beginning and 165.0MB in the end (delta: -93.7MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2024-11-19 01:34:06,506 INFO L158 Benchmark]: TraceAbstraction took 7265.91ms. Allocated memory was 222.3MB in the beginning and 331.4MB in the end (delta: 109.1MB). Free memory was 165.0MB in the beginning and 159.7MB in the end (delta: 5.3MB). Peak memory consumption was 115.4MB. Max. memory is 16.1GB. [2024-11-19 01:34:06,507 INFO L158 Benchmark]: Witness Printer took 93.22ms. Allocated memory is still 331.4MB. Free memory was 159.7MB in the beginning and 146.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 01:34:06,508 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.21ms. Allocated memory is still 163.6MB. Free memory was 125.2MB in the beginning and 124.9MB in the end (delta: 293.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.64ms. Allocated memory is still 163.6MB. Free memory was 103.8MB in the beginning and 77.3MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.64ms. Allocated memory is still 163.6MB. Free memory was 77.3MB in the beginning and 74.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.65ms. Allocated memory is still 163.6MB. Free memory was 74.8MB in the beginning and 71.4MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 859.19ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 71.4MB in the beginning and 165.0MB in the end (delta: -93.7MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7265.91ms. Allocated memory was 222.3MB in the beginning and 331.4MB in the end (delta: 109.1MB). Free memory was 165.0MB in the beginning and 159.7MB in the end (delta: 5.3MB). Peak memory consumption was 115.4MB. Max. memory is 16.1GB. * Witness Printer took 93.22ms. Allocated memory is still 331.4MB. Free memory was 159.7MB in the beginning and 146.1MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1105; [L844] FCALL, FORK 0 pthread_create(&t1105, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t1105=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L845] 0 pthread_t t1106; [L846] FCALL, FORK 0 pthread_create(&t1106, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t1105=-2, t1106=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L776] 2 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L779] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L847] 0 pthread_t t1107; [L848] FCALL, FORK 0 pthread_create(&t1107, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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, t1105=-2, t1106=-1, t1107=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 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) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 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 [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 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}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, z=0] [L796] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L799] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L802] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, weak$$choice2=1, x=1, y=2, z=1] [L762] 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) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 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 [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, x=1, y=2, z=1] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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=1, x=1, y=2, z=1] [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L821] 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) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 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 [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1105=-2, t1106=-1, t1107=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 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 [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1105=-2, t1106=-1, t1107=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L861] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, main$tmp_guard0=1, main$tmp_guard1=0, t1105=-2, t1106=-1, t1107=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L863] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=2, z=1] - 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: 846]: 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: 844]: 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: 848]: 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 7 procedures, 68 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 319 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 295 mSDsluCounter, 112 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 940 IncrementalHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 14 mSDtfsCounter, 940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=4, InterpolantAutomatonStates: 38, 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.6s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 147 ConstructedInterpolants, 0 QuantifiedInterpolants, 965 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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-11-19 01:34:06,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE