./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix038.opt.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/mix038.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:33:40,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:33:40,583 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:40,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:33:40,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:33:40,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:33:40,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:33:40,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:33:40,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:33:40,615 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:33:40,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:33:40,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:33:40,617 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:33:40,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:33:40,617 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:33:40,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:33:40,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:33:40,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:33:40,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:33:40,619 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:33:40,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:33:40,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:33:40,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:33:40,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:33:40,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:33:40,621 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:33:40,621 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:33:40,622 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:33:40,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:33:40,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:33:40,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:33:40,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:33:40,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:33:40,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:33:40,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:33:40,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:33:40,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:33:40,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:33:40,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:33:40,629 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:33:40,629 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:33:40,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:33:40,632 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 -> 8aba011b4454b6464ed30c6424ccbb7bc43e89a3e2bf826373810de7cb8fe97a [2024-11-19 01:33:40,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:33:40,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:33:40,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:33:40,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:33:40,966 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:33:40,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix038.opt.i [2024-11-19 01:33:42,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:33:42,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:33:42,675 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix038.opt.i [2024-11-19 01:33:42,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a2c0177/d110b380e0ad43efbc5beb9546d55917/FLAG7d2ef5949 [2024-11-19 01:33:42,705 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22a2c0177/d110b380e0ad43efbc5beb9546d55917 [2024-11-19 01:33:42,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:33:42,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:33:42,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:33:42,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:33:42,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:33:42,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:33:42" (1/1) ... [2024-11-19 01:33:42,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f1ecc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:42, skipping insertion in model container [2024-11-19 01:33:42,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:33:42" (1/1) ... [2024-11-19 01:33:42,768 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:33:42,986 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/mix038.opt.i[944,957] [2024-11-19 01:33:43,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:33:43,192 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:33:43,205 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/mix038.opt.i[944,957] [2024-11-19 01:33:43,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:33:43,311 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:33:43,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:43 WrapperNode [2024-11-19 01:33:43,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:33:43,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:33:43,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:33:43,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:33:43,321 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:43" (1/1) ... [2024-11-19 01:33:43,337 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:43" (1/1) ... [2024-11-19 01:33:43,379 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2024-11-19 01:33:43,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:33:43,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:33:43,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:33:43,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:33:43,398 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:43" (1/1) ... [2024-11-19 01:33:43,399 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:43" (1/1) ... [2024-11-19 01:33:43,402 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:43" (1/1) ... [2024-11-19 01:33:43,432 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:43,433 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:43" (1/1) ... [2024-11-19 01:33:43,433 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:43" (1/1) ... [2024-11-19 01:33:43,438 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:43" (1/1) ... [2024-11-19 01:33:43,444 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:43" (1/1) ... [2024-11-19 01:33:43,448 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:43" (1/1) ... [2024-11-19 01:33:43,452 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:43" (1/1) ... [2024-11-19 01:33:43,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:33:43,463 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:33:43,463 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:33:43,463 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:33:43,464 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:43" (1/1) ... [2024-11-19 01:33:43,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:33:43,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:33:43,502 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:43,504 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:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 01:33:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:33:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-19 01:33:43,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-19 01:33:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-19 01:33:43,549 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-19 01:33:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-19 01:33:43,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-19 01:33:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:33:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 01:33:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:33:43,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:33:43,558 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:43,727 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:33:43,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:33:43,998 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 01:33:43,998 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:33:44,164 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:33:44,164 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 01:33:44,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:33:44 BoogieIcfgContainer [2024-11-19 01:33:44,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:33:44,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:33:44,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:33:44,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:33:44,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:33:42" (1/3) ... [2024-11-19 01:33:44,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd77b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:33:44, skipping insertion in model container [2024-11-19 01:33:44,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:33:43" (2/3) ... [2024-11-19 01:33:44,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd77b5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:33:44, skipping insertion in model container [2024-11-19 01:33:44,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:33:44" (3/3) ... [2024-11-19 01:33:44,179 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038.opt.i [2024-11-19 01:33:44,193 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:33:44,194 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 01:33:44,194 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 01:33:44,251 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 01:33:44,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2024-11-19 01:33:44,313 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-11-19 01:33:44,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:33:44,318 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 5. Compared 73 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:44,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2024-11-19 01:33:44,324 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2024-11-19 01:33:44,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:33:44,340 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;@4489c64d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:33:44,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-19 01:33:44,351 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 01:33:44,352 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2024-11-19 01:33:44,352 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:33:44,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:44,353 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:44,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:33:44,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:44,361 INFO L85 PathProgramCache]: Analyzing trace with hash 326105579, now seen corresponding path program 1 times [2024-11-19 01:33:44,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:44,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010257431] [2024-11-19 01:33:44,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:44,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:44,946 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:44,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:44,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010257431] [2024-11-19 01:33:44,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010257431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:44,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:44,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 01:33:44,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735509312] [2024-11-19 01:33:44,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:44,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:33:44,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:45,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:33:45,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:33:45,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 41 [2024-11-19 01:33:45,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:45,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:45,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 41 [2024-11-19 01:33:45,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:45,388 INFO L124 PetriNetUnfolderBase]: 269/623 cut-off events. [2024-11-19 01:33:45,389 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 01:33:45,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 623 events. 269/623 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4134 event pairs, 53 based on Foata normal form. 24/631 useless extension candidates. Maximal degree in co-relation 1065. Up to 325 conditions per place. [2024-11-19 01:33:45,398 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 21 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2024-11-19 01:33:45,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 147 flow [2024-11-19 01:33:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:33:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 01:33:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-19 01:33:45,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7642276422764228 [2024-11-19 01:33:45,413 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 94 transitions. [2024-11-19 01:33:45,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 147 flow [2024-11-19 01:33:45,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 144 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 01:33:45,419 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-11-19 01:33:45,422 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:33:45,428 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-11-19 01:33:45,428 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-11-19 01:33:45,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:45,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:45,429 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:33:45,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:33:45,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:33:45,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash -2062977654, now seen corresponding path program 1 times [2024-11-19 01:33:45,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:45,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217137710] [2024-11-19 01:33:45,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:45,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:45,636 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:45,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:45,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217137710] [2024-11-19 01:33:45,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217137710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:45,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:45,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:33:45,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380994194] [2024-11-19 01:33:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:45,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:33:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:45,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:33:45,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:33:45,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-11-19 01:33:45,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:45,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:45,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-11-19 01:33:45,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:45,959 INFO L124 PetriNetUnfolderBase]: 784/1442 cut-off events. [2024-11-19 01:33:45,959 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-19 01:33:45,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2765 conditions, 1442 events. 784/1442 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9204 event pairs, 94 based on Foata normal form. 60/1437 useless extension candidates. Maximal degree in co-relation 2755. Up to 677 conditions per place. [2024-11-19 01:33:45,972 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 35 selfloop transitions, 5 changer transitions 1/56 dead transitions. [2024-11-19 01:33:45,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 212 flow [2024-11-19 01:33:45,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:33:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 01:33:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-11-19 01:33:45,975 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7012195121951219 [2024-11-19 01:33:45,975 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 4 states and 115 transitions. [2024-11-19 01:33:45,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 212 flow [2024-11-19 01:33:45,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 01:33:45,978 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 110 flow [2024-11-19 01:33:45,979 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:33:45,980 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 0 predicate places. [2024-11-19 01:33:45,980 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 110 flow [2024-11-19 01:33:45,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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:45,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:45,981 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:33:45,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:33:45,981 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:33:45,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:45,982 INFO L85 PathProgramCache]: Analyzing trace with hash -432857706, now seen corresponding path program 1 times [2024-11-19 01:33:45,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:45,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450053300] [2024-11-19 01:33:45,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:45,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:46,182 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:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:46,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450053300] [2024-11-19 01:33:46,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450053300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:46,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:46,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:33:46,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972519737] [2024-11-19 01:33:46,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:46,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:33:46,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:46,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:33:46,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:33:46,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-11-19 01:33:46,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:46,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:46,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-11-19 01:33:46,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:46,464 INFO L124 PetriNetUnfolderBase]: 568/1044 cut-off events. [2024-11-19 01:33:46,465 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2024-11-19 01:33:46,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2379 conditions, 1044 events. 568/1044 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 5969 event pairs, 34 based on Foata normal form. 54/1057 useless extension candidates. Maximal degree in co-relation 2367. Up to 369 conditions per place. [2024-11-19 01:33:46,472 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 44 selfloop transitions, 8 changer transitions 1/68 dead transitions. [2024-11-19 01:33:46,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 68 transitions, 297 flow [2024-11-19 01:33:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:33:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:33:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-19 01:33:46,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2024-11-19 01:33:46,478 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 110 flow. Second operand 5 states and 145 transitions. [2024-11-19 01:33:46,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 68 transitions, 297 flow [2024-11-19 01:33:46,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 287 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-19 01:33:46,483 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 150 flow [2024-11-19 01:33:46,483 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:33:46,484 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2024-11-19 01:33:46,484 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 150 flow [2024-11-19 01:33:46,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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:46,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:46,485 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:33:46,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:33:46,486 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:33:46,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:46,486 INFO L85 PathProgramCache]: Analyzing trace with hash -370780988, now seen corresponding path program 1 times [2024-11-19 01:33:46,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:46,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306042928] [2024-11-19 01:33:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:46,786 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:46,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:46,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306042928] [2024-11-19 01:33:46,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306042928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:46,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:46,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:33:46,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208396407] [2024-11-19 01:33:46,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:46,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:33:46,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:46,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:33:46,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:33:46,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-11-19 01:33:46,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:46,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:46,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-11-19 01:33:46,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:47,018 INFO L124 PetriNetUnfolderBase]: 345/607 cut-off events. [2024-11-19 01:33:47,020 INFO L125 PetriNetUnfolderBase]: For 604/604 co-relation queries the response was YES. [2024-11-19 01:33:47,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1625 conditions, 607 events. 345/607 cut-off events. For 604/604 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2681 event pairs, 23 based on Foata normal form. 32/622 useless extension candidates. Maximal degree in co-relation 1611. Up to 228 conditions per place. [2024-11-19 01:33:47,025 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 39 selfloop transitions, 11 changer transitions 1/66 dead transitions. [2024-11-19 01:33:47,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 312 flow [2024-11-19 01:33:47,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:33:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:33:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2024-11-19 01:33:47,028 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6544715447154471 [2024-11-19 01:33:47,028 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 150 flow. Second operand 6 states and 161 transitions. [2024-11-19 01:33:47,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 312 flow [2024-11-19 01:33:47,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 287 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-19 01:33:47,035 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 164 flow [2024-11-19 01:33:47,035 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:33:47,036 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2024-11-19 01:33:47,037 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 164 flow [2024-11-19 01:33:47,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 6 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 01:33:47,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:47,038 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:33:47,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:33:47,040 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:33:47,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:47,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2031194507, now seen corresponding path program 1 times [2024-11-19 01:33:47,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:47,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306127061] [2024-11-19 01:33:47,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:33:47,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:33:47,394 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:47,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:47,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306127061] [2024-11-19 01:33:47,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306127061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:47,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:47,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:33:47,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825105362] [2024-11-19 01:33:47,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:47,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:33:47,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:47,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:33:47,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:33:47,406 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-11-19 01:33:47,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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:47,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:47,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-11-19 01:33:47,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:47,647 INFO L124 PetriNetUnfolderBase]: 476/956 cut-off events. [2024-11-19 01:33:47,648 INFO L125 PetriNetUnfolderBase]: For 457/475 co-relation queries the response was YES. [2024-11-19 01:33:47,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 956 events. 476/956 cut-off events. For 457/475 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5046 event pairs, 209 based on Foata normal form. 8/907 useless extension candidates. Maximal degree in co-relation 2206. Up to 391 conditions per place. [2024-11-19 01:33:47,655 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 27 selfloop transitions, 2 changer transitions 13/63 dead transitions. [2024-11-19 01:33:47,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 63 transitions, 304 flow [2024-11-19 01:33:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:33:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 01:33:47,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2024-11-19 01:33:47,657 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6487804878048781 [2024-11-19 01:33:47,657 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 164 flow. Second operand 5 states and 133 transitions. [2024-11-19 01:33:47,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 63 transitions, 304 flow [2024-11-19 01:33:47,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 240 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-11-19 01:33:47,662 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 120 flow [2024-11-19 01:33:47,663 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2024-11-19 01:33:47,664 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2024-11-19 01:33:47,665 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 120 flow [2024-11-19 01:33:47,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 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:47,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:47,666 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:33:47,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:33:47,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:33:47,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash -540457277, now seen corresponding path program 2 times [2024-11-19 01:33:47,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:47,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371612738] [2024-11-19 01:33:47,667 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 01:33:47,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:47,739 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:33:47,740 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:33:48,575 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:48,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371612738] [2024-11-19 01:33:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371612738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:48,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:48,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:33:48,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196093765] [2024-11-19 01:33:48,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:48,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:33:48,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:48,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:33:48,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:33:48,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2024-11-19 01:33:48,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 120 flow. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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:48,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:48,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2024-11-19 01:33:48,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:49,202 INFO L124 PetriNetUnfolderBase]: 602/1188 cut-off events. [2024-11-19 01:33:49,202 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-19 01:33:49,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2526 conditions, 1188 events. 602/1188 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6439 event pairs, 150 based on Foata normal form. 8/1166 useless extension candidates. Maximal degree in co-relation 2513. Up to 402 conditions per place. [2024-11-19 01:33:49,208 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 27 selfloop transitions, 6 changer transitions 56/107 dead transitions. [2024-11-19 01:33:49,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 476 flow [2024-11-19 01:33:49,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 01:33:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 01:33:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 270 transitions. [2024-11-19 01:33:49,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5487804878048781 [2024-11-19 01:33:49,211 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 120 flow. Second operand 12 states and 270 transitions. [2024-11-19 01:33:49,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 476 flow [2024-11-19 01:33:49,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 107 transitions, 438 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-19 01:33:49,214 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 176 flow [2024-11-19 01:33:49,214 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=12, PETRI_FLOW=176, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2024-11-19 01:33:49,217 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2024-11-19 01:33:49,218 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 176 flow [2024-11-19 01:33:49,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 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:49,218 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:49,218 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:33:49,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:33:49,219 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:33:49,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:49,219 INFO L85 PathProgramCache]: Analyzing trace with hash 885429409, now seen corresponding path program 3 times [2024-11-19 01:33:49,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:49,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832157383] [2024-11-19 01:33:49,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 01:33:49,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:49,285 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 01:33:49,285 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:33:49,489 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:49,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:49,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832157383] [2024-11-19 01:33:49,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832157383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:49,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:49,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:33:49,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906379280] [2024-11-19 01:33:49,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:49,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:33:49,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:49,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:33:49,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:33:49,501 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 41 [2024-11-19 01:33:49,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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:49,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:49,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 41 [2024-11-19 01:33:49,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:49,770 INFO L124 PetriNetUnfolderBase]: 346/742 cut-off events. [2024-11-19 01:33:49,770 INFO L125 PetriNetUnfolderBase]: For 206/211 co-relation queries the response was YES. [2024-11-19 01:33:49,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 742 events. 346/742 cut-off events. For 206/211 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3863 event pairs, 114 based on Foata normal form. 11/714 useless extension candidates. Maximal degree in co-relation 1649. Up to 269 conditions per place. [2024-11-19 01:33:49,775 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 22 selfloop transitions, 1 changer transitions 21/65 dead transitions. [2024-11-19 01:33:49,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 65 transitions, 314 flow [2024-11-19 01:33:49,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:33:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 01:33:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-19 01:33:49,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6056910569105691 [2024-11-19 01:33:49,777 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 176 flow. Second operand 6 states and 149 transitions. [2024-11-19 01:33:49,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 65 transitions, 314 flow [2024-11-19 01:33:49,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 276 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-11-19 01:33:49,780 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 143 flow [2024-11-19 01:33:49,781 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=143, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-11-19 01:33:49,781 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2024-11-19 01:33:49,781 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 143 flow [2024-11-19 01:33:49,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 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:49,782 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:49,782 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:33:49,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:33:49,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:33:49,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:49,783 INFO L85 PathProgramCache]: Analyzing trace with hash 606398249, now seen corresponding path program 4 times [2024-11-19 01:33:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:49,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206609611] [2024-11-19 01:33:49,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 01:33:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:49,818 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 01:33:49,818 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 01:33:50,465 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:50,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:33:50,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206609611] [2024-11-19 01:33:50,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206609611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:33:50,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:33:50,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:33:50,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155138126] [2024-11-19 01:33:50,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:33:50,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:33:50,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:33:50,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:33:50,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:33:50,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 41 [2024-11-19 01:33:50,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 143 flow. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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:50,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 01:33:50,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 41 [2024-11-19 01:33:50,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 01:33:50,768 INFO L124 PetriNetUnfolderBase]: 273/557 cut-off events. [2024-11-19 01:33:50,768 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-19 01:33:50,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 557 events. 273/557 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2483 event pairs, 109 based on Foata normal form. 8/525 useless extension candidates. Maximal degree in co-relation 1141. Up to 217 conditions per place. [2024-11-19 01:33:50,772 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 18 selfloop transitions, 2 changer transitions 27/69 dead transitions. [2024-11-19 01:33:50,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 69 transitions, 297 flow [2024-11-19 01:33:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 01:33:50,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 01:33:50,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 219 transitions. [2024-11-19 01:33:50,773 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2024-11-19 01:33:50,773 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 143 flow. Second operand 9 states and 219 transitions. [2024-11-19 01:33:50,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 69 transitions, 297 flow [2024-11-19 01:33:50,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 69 transitions, 278 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-11-19 01:33:50,776 INFO L231 Difference]: Finished difference. Result has 65 places, 40 transitions, 142 flow [2024-11-19 01:33:50,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=142, PETRI_PLACES=65, PETRI_TRANSITIONS=40} [2024-11-19 01:33:50,777 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2024-11-19 01:33:50,777 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 40 transitions, 142 flow [2024-11-19 01:33:50,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 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:50,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 01:33:50,778 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:33:50,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:33:50,778 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-19 01:33:50,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:33:50,782 INFO L85 PathProgramCache]: Analyzing trace with hash -527762231, now seen corresponding path program 5 times [2024-11-19 01:33:50,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:33:50,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945175846] [2024-11-19 01:33:50,782 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 01:33:50,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:33:50,825 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 01:33:50,826 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 01:33:50,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:33:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:33:50,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:33:50,910 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:33:50,912 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-19 01:33:50,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-19 01:33:50,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-19 01:33:50,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-19 01:33:50,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-19 01:33:50,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-19 01:33:50,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:33:50,915 INFO L407 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-11-19 01:33:51,011 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 01:33:51,012 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:33:51,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:33:51 BasicIcfg [2024-11-19 01:33:51,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:33:51,018 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:33:51,018 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:33:51,018 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:33:51,019 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:44" (3/4) ... [2024-11-19 01:33:51,020 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 01:33:51,138 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 01:33:51,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:33:51,139 INFO L158 Benchmark]: Toolchain (without parser) took 8430.55ms. Allocated memory was 174.1MB in the beginning and 325.1MB in the end (delta: 151.0MB). Free memory was 91.3MB in the beginning and 286.2MB in the end (delta: -194.9MB). Peak memory consumption was 145.6MB. Max. memory is 16.1GB. [2024-11-19 01:33:51,139 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 174.1MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:33:51,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.95ms. Allocated memory is still 174.1MB. Free memory was 91.0MB in the beginning and 125.4MB in the end (delta: -34.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-11-19 01:33:51,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.98ms. Allocated memory is still 174.1MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:33:51,140 INFO L158 Benchmark]: Boogie Preprocessor took 81.88ms. Allocated memory is still 174.1MB. Free memory was 123.3MB in the beginning and 120.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:33:51,140 INFO L158 Benchmark]: RCFGBuilder took 702.76ms. Allocated memory is still 174.1MB. Free memory was 120.1MB in the beginning and 104.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 01:33:51,140 INFO L158 Benchmark]: TraceAbstraction took 6849.86ms. Allocated memory was 174.1MB in the beginning and 325.1MB in the end (delta: 151.0MB). Free memory was 103.4MB in the beginning and 109.5MB in the end (delta: -6.1MB). Peak memory consumption was 147.0MB. Max. memory is 16.1GB. [2024-11-19 01:33:51,141 INFO L158 Benchmark]: Witness Printer took 120.58ms. Allocated memory is still 325.1MB. Free memory was 109.5MB in the beginning and 286.2MB in the end (delta: -176.8MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-11-19 01:33:51,145 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.23ms. Allocated memory is still 174.1MB. Free memory is still 137.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 601.95ms. Allocated memory is still 174.1MB. Free memory was 91.0MB in the beginning and 125.4MB in the end (delta: -34.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.98ms. Allocated memory is still 174.1MB. Free memory was 125.4MB in the beginning and 123.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.88ms. Allocated memory is still 174.1MB. Free memory was 123.3MB in the beginning and 120.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 702.76ms. Allocated memory is still 174.1MB. Free memory was 120.1MB in the beginning and 104.4MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6849.86ms. Allocated memory was 174.1MB in the beginning and 325.1MB in the end (delta: 151.0MB). Free memory was 103.4MB in the beginning and 109.5MB in the end (delta: -6.1MB). Peak memory consumption was 147.0MB. Max. memory is 16.1GB. * Witness Printer took 120.58ms. Allocated memory is still 325.1MB. Free memory was 109.5MB in the beginning and 286.2MB in the end (delta: -176.8MB). Peak memory consumption was 12.0MB. 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_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1004; [L834] FCALL, FORK 0 pthread_create(&t1004, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-3, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L835] 0 pthread_t t1005; [L836] FCALL, FORK 0 pthread_create(&t1005, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-3, t1005=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L837] 0 pthread_t t1006; [L838] FCALL, FORK 0 pthread_create(&t1006, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1004=-3, t1005=-2, t1006=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L805] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L808] 3 __unbuffered_p2_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L747] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L750] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L840] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-3, t1005=-2, t1006=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L842] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L842] RET 0 assume_abort_if_not(main$tmp_guard0) [L844] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L846] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L847] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L848] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-3, t1005=-2, t1006=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L851] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1004=-3, t1005=-2, t1006=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L853] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, 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: 836]: 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: 834]: 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: 838]: 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: 6.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 205 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1008 IncrementalHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 18 mSDtfsCounter, 1008 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=6, InterpolantAutomatonStates: 50, 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.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 1483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:33:51,177 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