./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix006.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix006.opt.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:13:45,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:13:45,473 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:13:45,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:13:45,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:13:45,508 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:13:45,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:13:45,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:13:45,510 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:13:45,511 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:13:45,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:13:45,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:13:45,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:13:45,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:13:45,514 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:13:45,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:13:45,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:13:45,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:13:45,515 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:13:45,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:13:45,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:13:45,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:13:45,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:13:45,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:13:45,519 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:13:45,520 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:13:45,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:13:45,520 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:13:45,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:13:45,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:13:45,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:13:45,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:13:45,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:13:45,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:13:45,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:13:45,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:13:45,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:13:45,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:13:45,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:13:45,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:13:45,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:13:45,524 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:13:45,524 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-clean/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-clean/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 -> 557c1f2fab4f7585e181c0a50145e0f2efcca52cad7f093489c012afed407365 [2024-10-11 14:13:45,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:13:45,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:13:45,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:13:45,786 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:13:45,787 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:13:45,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix006.opt.i [2024-10-11 14:13:47,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:13:47,373 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:13:47,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix006.opt.i [2024-10-11 14:13:47,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1be973abf/82242d79bfe141dc993948105b3f5384/FLAGb774ddbd7 [2024-10-11 14:13:47,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1be973abf/82242d79bfe141dc993948105b3f5384 [2024-10-11 14:13:47,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:13:47,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:13:47,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:13:47,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:13:47,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:13:47,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:47,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e87da04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47, skipping insertion in model container [2024-10-11 14:13:47,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:47,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:13:47,612 WARN L248 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/mix006.opt.i[944,957] [2024-10-11 14:13:47,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:13:47,815 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:13:47,829 WARN L248 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/mix006.opt.i[944,957] [2024-10-11 14:13:47,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:13:47,934 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:13:47,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47 WrapperNode [2024-10-11 14:13:47,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:13:47,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:13:47,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:13:47,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:13:47,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,001 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,022 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2024-10-11 14:13:48,023 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:13:48,024 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:13:48,024 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:13:48,024 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:13:48,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,059 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-10-11 14:13:48,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,069 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,073 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:13:48,074 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:13:48,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:13:48,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:13:48,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (1/1) ... [2024-10-11 14:13:48,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:13:48,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:13:48,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:13:48,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:13:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:13:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:13:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 14:13:48,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 14:13:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 14:13:48,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 14:13:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-11 14:13:48,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-11 14:13:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:13:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:13:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:13:48,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:13:48,149 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:13:48,264 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:13:48,266 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:13:48,541 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:13:48,542 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:13:48,726 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:13:48,727 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 14:13:48,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:13:48 BoogieIcfgContainer [2024-10-11 14:13:48,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:13:48,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:13:48,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:13:48,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:13:48,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:13:47" (1/3) ... [2024-10-11 14:13:48,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be924f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:13:48, skipping insertion in model container [2024-10-11 14:13:48,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:13:47" (2/3) ... [2024-10-11 14:13:48,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be924f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:13:48, skipping insertion in model container [2024-10-11 14:13:48,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:13:48" (3/3) ... [2024-10-11 14:13:48,738 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006.opt.i [2024-10-11 14:13:48,753 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:13:48,753 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 14:13:48,754 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:13:48,795 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:13:48,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2024-10-11 14:13:48,841 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-10-11 14:13:48,842 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:13:48,844 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 77 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-10-11 14:13:48,844 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2024-10-11 14:13:48,847 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2024-10-11 14:13:48,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:13:48,857 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;@4e55a392, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:13:48,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 14:13:48,862 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:13:48,862 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-10-11 14:13:48,862 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:13:48,863 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:48,863 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:13:48,864 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-10-11 14:13:48,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:48,868 INFO L85 PathProgramCache]: Analyzing trace with hash -409676766, now seen corresponding path program 1 times [2024-10-11 14:13:48,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:48,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948117361] [2024-10-11 14:13:48,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:48,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:13:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:13:49,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:13:49,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948117361] [2024-10-11 14:13:49,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948117361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:13:49,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:13:49,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 14:13:49,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532686075] [2024-10-11 14:13:49,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:13:49,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:13:49,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:13:49,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:13:49,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:13:49,253 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 41 [2024-10-11 14:13:49,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-10-11 14:13:49,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:13:49,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 41 [2024-10-11 14:13:49,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:13:49,518 INFO L124 PetriNetUnfolderBase]: 341/661 cut-off events. [2024-10-11 14:13:49,519 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:13:49,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 661 events. 341/661 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4195 event pairs, 53 based on Foata normal form. 30/672 useless extension candidates. Maximal degree in co-relation 1211. Up to 433 conditions per place. [2024-10-11 14:13:49,526 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 22 selfloop transitions, 2 changer transitions 2/44 dead transitions. [2024-10-11 14:13:49,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 149 flow [2024-10-11 14:13:49,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:13:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:13:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-10-11 14:13:49,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7479674796747967 [2024-10-11 14:13:49,537 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 92 transitions. [2024-10-11 14:13:49,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 149 flow [2024-10-11 14:13:49,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 44 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 14:13:49,543 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-10-11 14:13:49,544 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-10-11 14:13:49,548 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-10-11 14:13:49,549 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-10-11 14:13:49,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-10-11 14:13:49,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:49,550 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:13:49,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:13:49,550 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-10-11 14:13:49,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1954389064, now seen corresponding path program 1 times [2024-10-11 14:13:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:49,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950764987] [2024-10-11 14:13:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:13:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:13:49,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:13:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950764987] [2024-10-11 14:13:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950764987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:13:49,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:13:49,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:13:49,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580577120] [2024-10-11 14:13:49,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:13:49,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:13:49,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:13:49,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:13:49,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:13:49,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-11 14:13:49,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-10-11 14:13:49,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:13:49,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-11 14:13:49,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:13:50,888 INFO L124 PetriNetUnfolderBase]: 3294/5470 cut-off events. [2024-10-11 14:13:50,888 INFO L125 PetriNetUnfolderBase]: For 241/241 co-relation queries the response was YES. [2024-10-11 14:13:50,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10698 conditions, 5470 events. 3294/5470 cut-off events. For 241/241 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 39706 event pairs, 784 based on Foata normal form. 0/5277 useless extension candidates. Maximal degree in co-relation 10688. Up to 2096 conditions per place. [2024-10-11 14:13:50,917 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 34 selfloop transitions, 7 changer transitions 72/124 dead transitions. [2024-10-11 14:13:50,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 124 transitions, 500 flow [2024-10-11 14:13:50,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:13:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:13:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 241 transitions. [2024-10-11 14:13:50,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6531165311653117 [2024-10-11 14:13:50,922 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 9 states and 241 transitions. [2024-10-11 14:13:50,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 124 transitions, 500 flow [2024-10-11 14:13:50,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 482 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:13:50,928 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 172 flow [2024-10-11 14:13:50,929 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=172, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-10-11 14:13:50,930 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2024-10-11 14:13:50,930 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 172 flow [2024-10-11 14:13:50,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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-10-11 14:13:50,930 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:50,931 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:13:50,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:13:50,931 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-10-11 14:13:50,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:50,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1124890341, now seen corresponding path program 1 times [2024-10-11 14:13:50,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:50,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209817420] [2024-10-11 14:13:50,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:50,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:13:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:13:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:13:51,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209817420] [2024-10-11 14:13:51,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209817420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:13:51,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:13:51,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:13:51,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595391224] [2024-10-11 14:13:51,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:13:51,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:13:51,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:13:51,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:13:51,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:13:51,132 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-11 14:13:51,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 172 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-10-11 14:13:51,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:13:51,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-11 14:13:51,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:13:51,846 INFO L124 PetriNetUnfolderBase]: 2262/4156 cut-off events. [2024-10-11 14:13:51,847 INFO L125 PetriNetUnfolderBase]: For 4989/4989 co-relation queries the response was YES. [2024-10-11 14:13:51,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12027 conditions, 4156 events. 2262/4156 cut-off events. For 4989/4989 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 30885 event pairs, 393 based on Foata normal form. 140/4263 useless extension candidates. Maximal degree in co-relation 12009. Up to 1356 conditions per place. [2024-10-11 14:13:51,870 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 48 selfloop transitions, 7 changer transitions 64/130 dead transitions. [2024-10-11 14:13:51,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 130 transitions, 828 flow [2024-10-11 14:13:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:13:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 14:13:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2024-10-11 14:13:51,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6073170731707317 [2024-10-11 14:13:51,872 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 172 flow. Second operand 10 states and 249 transitions. [2024-10-11 14:13:51,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 130 transitions, 828 flow [2024-10-11 14:13:51,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 130 transitions, 714 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-10-11 14:13:51,896 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 214 flow [2024-10-11 14:13:51,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=214, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2024-10-11 14:13:51,897 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2024-10-11 14:13:51,897 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 214 flow [2024-10-11 14:13:51,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-10-11 14:13:51,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:51,898 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:13:51,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:13:51,899 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-10-11 14:13:51,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:51,899 INFO L85 PathProgramCache]: Analyzing trace with hash -426971363, now seen corresponding path program 1 times [2024-10-11 14:13:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:51,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331679705] [2024-10-11 14:13:51,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:13:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:13:52,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:13:52,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331679705] [2024-10-11 14:13:52,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331679705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:13:52,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:13:52,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:13:52,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133711393] [2024-10-11 14:13:52,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:13:52,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:13:52,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:13:52,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:13:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:13:52,061 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2024-10-11 14:13:52,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-10-11 14:13:52,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:13:52,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2024-10-11 14:13:52,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:13:52,789 INFO L124 PetriNetUnfolderBase]: 1868/3410 cut-off events. [2024-10-11 14:13:52,789 INFO L125 PetriNetUnfolderBase]: For 6641/6641 co-relation queries the response was YES. [2024-10-11 14:13:52,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10379 conditions, 3410 events. 1868/3410 cut-off events. For 6641/6641 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 23962 event pairs, 412 based on Foata normal form. 90/3473 useless extension candidates. Maximal degree in co-relation 10354. Up to 1200 conditions per place. [2024-10-11 14:13:52,840 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 42 selfloop transitions, 11 changer transitions 46/110 dead transitions. [2024-10-11 14:13:52,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 110 transitions, 754 flow [2024-10-11 14:13:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 14:13:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 14:13:52,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 230 transitions. [2024-10-11 14:13:52,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2024-10-11 14:13:52,847 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 214 flow. Second operand 10 states and 230 transitions. [2024-10-11 14:13:52,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 110 transitions, 754 flow [2024-10-11 14:13:52,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 110 transitions, 701 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-10-11 14:13:52,879 INFO L231 Difference]: Finished difference. Result has 72 places, 48 transitions, 306 flow [2024-10-11 14:13:52,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=306, PETRI_PLACES=72, PETRI_TRANSITIONS=48} [2024-10-11 14:13:52,882 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2024-10-11 14:13:52,882 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 48 transitions, 306 flow [2024-10-11 14:13:52,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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-10-11 14:13:52,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:52,883 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] [2024-10-11 14:13:52,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:13:52,887 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-10-11 14:13:52,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:52,888 INFO L85 PathProgramCache]: Analyzing trace with hash 696669597, now seen corresponding path program 1 times [2024-10-11 14:13:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:52,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304384213] [2024-10-11 14:13:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:13:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:13:53,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:13:53,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304384213] [2024-10-11 14:13:53,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304384213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:13:53,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:13:53,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:13:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726287599] [2024-10-11 14:13:53,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:13:53,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:13:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:13:53,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:13:53,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:13:53,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-10-11 14:13:53,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 48 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-11 14:13:53,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:13:53,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-10-11 14:13:53,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:13:53,976 INFO L124 PetriNetUnfolderBase]: 2540/4316 cut-off events. [2024-10-11 14:13:53,976 INFO L125 PetriNetUnfolderBase]: For 8644/9338 co-relation queries the response was YES. [2024-10-11 14:13:53,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12209 conditions, 4316 events. 2540/4316 cut-off events. For 8644/9338 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 28821 event pairs, 348 based on Foata normal form. 235/4384 useless extension candidates. Maximal degree in co-relation 12178. Up to 2088 conditions per place. [2024-10-11 14:13:54,006 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 51 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2024-10-11 14:13:54,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 600 flow [2024-10-11 14:13:54,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:13:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:13:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2024-10-11 14:13:54,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6951219512195121 [2024-10-11 14:13:54,007 INFO L175 Difference]: Start difference. First operand has 72 places, 48 transitions, 306 flow. Second operand 4 states and 114 transitions. [2024-10-11 14:13:54,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 600 flow [2024-10-11 14:13:54,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 79 transitions, 560 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-10-11 14:13:54,019 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 314 flow [2024-10-11 14:13:54,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2024-10-11 14:13:54,020 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2024-10-11 14:13:54,020 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 314 flow [2024-10-11 14:13:54,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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-10-11 14:13:54,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:54,021 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] [2024-10-11 14:13:54,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:13:54,021 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-10-11 14:13:54,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:54,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1441575041, now seen corresponding path program 1 times [2024-10-11 14:13:54,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:54,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566229894] [2024-10-11 14:13:54,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:54,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:54,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:13:54,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:13:54,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:13:54,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566229894] [2024-10-11 14:13:54,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566229894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:13:54,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:13:54,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:13:54,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108906338] [2024-10-11 14:13:54,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:13:54,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:13:54,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:13:54,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:13:54,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:13:54,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-10-11 14:13:54,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-10-11 14:13:54,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:13:54,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-10-11 14:13:54,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:13:54,660 INFO L124 PetriNetUnfolderBase]: 1984/3442 cut-off events. [2024-10-11 14:13:54,660 INFO L125 PetriNetUnfolderBase]: For 5370/6063 co-relation queries the response was YES. [2024-10-11 14:13:54,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10557 conditions, 3442 events. 1984/3442 cut-off events. For 5370/6063 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 22118 event pairs, 187 based on Foata normal form. 239/3553 useless extension candidates. Maximal degree in co-relation 10529. Up to 1112 conditions per place. [2024-10-11 14:13:54,676 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 62 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2024-10-11 14:13:54,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 678 flow [2024-10-11 14:13:54,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:13:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:13:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-10-11 14:13:54,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2024-10-11 14:13:54,677 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 314 flow. Second operand 5 states and 145 transitions. [2024-10-11 14:13:54,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 678 flow [2024-10-11 14:13:54,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 93 transitions, 663 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-10-11 14:13:54,680 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 358 flow [2024-10-11 14:13:54,681 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2024-10-11 14:13:54,681 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2024-10-11 14:13:54,681 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 358 flow [2024-10-11 14:13:54,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 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-10-11 14:13:54,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:54,682 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] [2024-10-11 14:13:54,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:13:54,682 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-10-11 14:13:54,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:54,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1189920451, now seen corresponding path program 1 times [2024-10-11 14:13:54,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:54,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651677056] [2024-10-11 14:13:54,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:54,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:13:55,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:13:55,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:13:55,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651677056] [2024-10-11 14:13:55,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651677056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:13:55,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:13:55,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:13:55,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907533729] [2024-10-11 14:13:55,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:13:55,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:13:55,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:13:55,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:13:55,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:13:55,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2024-10-11 14:13:55,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-10-11 14:13:55,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:13:55,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2024-10-11 14:13:55,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:13:55,736 INFO L124 PetriNetUnfolderBase]: 1612/2774 cut-off events. [2024-10-11 14:13:55,737 INFO L125 PetriNetUnfolderBase]: For 6899/7802 co-relation queries the response was YES. [2024-10-11 14:13:55,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9707 conditions, 2774 events. 1612/2774 cut-off events. For 6899/7802 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 17470 event pairs, 175 based on Foata normal form. 177/2831 useless extension candidates. Maximal degree in co-relation 9680. Up to 1100 conditions per place. [2024-10-11 14:13:55,754 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 55 selfloop transitions, 11 changer transitions 0/89 dead transitions. [2024-10-11 14:13:55,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 650 flow [2024-10-11 14:13:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:13:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:13:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 160 transitions. [2024-10-11 14:13:55,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6504065040650406 [2024-10-11 14:13:55,755 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 358 flow. Second operand 6 states and 160 transitions. [2024-10-11 14:13:55,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 650 flow [2024-10-11 14:13:55,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 616 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-10-11 14:13:55,761 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 374 flow [2024-10-11 14:13:55,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=374, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-10-11 14:13:55,762 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2024-10-11 14:13:55,762 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 374 flow [2024-10-11 14:13:55,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 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-10-11 14:13:55,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:55,763 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-10-11 14:13:55,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:13:55,763 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-10-11 14:13:55,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash -490775481, now seen corresponding path program 1 times [2024-10-11 14:13:55,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:55,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573995416] [2024-10-11 14:13:55,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:55,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:13:56,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:13:56,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:13:56,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573995416] [2024-10-11 14:13:56,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573995416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:13:56,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:13:56,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 14:13:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493568438] [2024-10-11 14:13:56,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:13:56,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:13:56,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:13:56,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:13:56,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:13:56,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-10-11 14:13:56,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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-10-11 14:13:56,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:13:56,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-10-11 14:13:56,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:13:56,438 INFO L124 PetriNetUnfolderBase]: 1333/2864 cut-off events. [2024-10-11 14:13:56,438 INFO L125 PetriNetUnfolderBase]: For 6519/6925 co-relation queries the response was YES. [2024-10-11 14:13:56,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9086 conditions, 2864 events. 1333/2864 cut-off events. For 6519/6925 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22236 event pairs, 414 based on Foata normal form. 43/2615 useless extension candidates. Maximal degree in co-relation 9059. Up to 1049 conditions per place. [2024-10-11 14:13:56,450 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 31 selfloop transitions, 1 changer transitions 25/87 dead transitions. [2024-10-11 14:13:56,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 608 flow [2024-10-11 14:13:56,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 14:13:56,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 14:13:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-10-11 14:13:56,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2024-10-11 14:13:56,451 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 374 flow. Second operand 6 states and 146 transitions. [2024-10-11 14:13:56,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 608 flow [2024-10-11 14:13:56,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 87 transitions, 548 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-10-11 14:13:56,465 INFO L231 Difference]: Finished difference. Result has 72 places, 53 transitions, 299 flow [2024-10-11 14:13:56,465 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=299, PETRI_PLACES=72, PETRI_TRANSITIONS=53} [2024-10-11 14:13:56,465 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2024-10-11 14:13:56,466 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 53 transitions, 299 flow [2024-10-11 14:13:56,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 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-10-11 14:13:56,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:56,466 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-10-11 14:13:56,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:13:56,466 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-10-11 14:13:56,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:56,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1778461505, now seen corresponding path program 2 times [2024-10-11 14:13:56,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:56,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393583237] [2024-10-11 14:13:56,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:56,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:13:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:13:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:13:56,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393583237] [2024-10-11 14:13:56,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393583237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:13:56,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:13:56,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:13:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062806869] [2024-10-11 14:13:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:13:56,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:13:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:13:56,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:13:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:13:56,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 41 [2024-10-11 14:13:56,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 53 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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-10-11 14:13:56,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:13:56,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 41 [2024-10-11 14:13:56,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:13:56,979 INFO L124 PetriNetUnfolderBase]: 1127/2488 cut-off events. [2024-10-11 14:13:56,980 INFO L125 PetriNetUnfolderBase]: For 3641/3818 co-relation queries the response was YES. [2024-10-11 14:13:56,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7104 conditions, 2488 events. 1127/2488 cut-off events. For 3641/3818 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 19218 event pairs, 437 based on Foata normal form. 29/2259 useless extension candidates. Maximal degree in co-relation 7076. Up to 956 conditions per place. [2024-10-11 14:13:56,991 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 23 selfloop transitions, 2 changer transitions 31/78 dead transitions. [2024-10-11 14:13:56,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 78 transitions, 497 flow [2024-10-11 14:13:56,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:13:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:13:56,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-10-11 14:13:56,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2024-10-11 14:13:56,992 INFO L175 Difference]: Start difference. First operand has 72 places, 53 transitions, 299 flow. Second operand 5 states and 125 transitions. [2024-10-11 14:13:56,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 78 transitions, 497 flow [2024-10-11 14:13:57,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 78 transitions, 486 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-11 14:13:57,003 INFO L231 Difference]: Finished difference. Result has 72 places, 43 transitions, 224 flow [2024-10-11 14:13:57,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=72, PETRI_TRANSITIONS=43} [2024-10-11 14:13:57,004 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2024-10-11 14:13:57,004 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 43 transitions, 224 flow [2024-10-11 14:13:57,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 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-10-11 14:13:57,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:13:57,005 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-10-11 14:13:57,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:13:57,005 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:13:57,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:13:57,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1660984849, now seen corresponding path program 3 times [2024-10-11 14:13:57,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:13:57,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249002885] [2024-10-11 14:13:57,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:13:57,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:13:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:13:57,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:13:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:13:57,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:13:57,143 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:13:57,145 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-11 14:13:57,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-11 14:13:57,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-11 14:13:57,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-11 14:13:57,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-11 14:13:57,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-11 14:13:57,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:13:57,151 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:13:57,225 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 14:13:57,226 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:13:57,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:13:57 BasicIcfg [2024-10-11 14:13:57,232 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:13:57,232 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:13:57,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:13:57,233 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:13:57,233 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:13:48" (3/4) ... [2024-10-11 14:13:57,234 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 14:13:57,312 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 14:13:57,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:13:57,314 INFO L158 Benchmark]: Toolchain (without parser) took 9908.35ms. Allocated memory was 159.4MB in the beginning and 650.1MB in the end (delta: 490.7MB). Free memory was 85.8MB in the beginning and 581.7MB in the end (delta: -496.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:13:57,314 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory was 110.5MB in the beginning and 110.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:13:57,314 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.60ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 125.3MB in the end (delta: -39.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2024-10-11 14:13:57,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.00ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 125.3MB in the beginning and 200.6MB in the end (delta: -75.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-11 14:13:57,315 INFO L158 Benchmark]: Boogie Preprocessor took 49.33ms. Allocated memory is still 232.8MB. Free memory was 200.6MB in the beginning and 197.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:13:57,315 INFO L158 Benchmark]: RCFGBuilder took 653.39ms. Allocated memory is still 232.8MB. Free memory was 197.4MB in the beginning and 141.9MB in the end (delta: 55.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. [2024-10-11 14:13:57,315 INFO L158 Benchmark]: TraceAbstraction took 8502.24ms. Allocated memory was 232.8MB in the beginning and 650.1MB in the end (delta: 417.3MB). Free memory was 140.8MB in the beginning and 594.3MB in the end (delta: -453.5MB). Peak memory consumption was 332.9MB. Max. memory is 16.1GB. [2024-10-11 14:13:57,315 INFO L158 Benchmark]: Witness Printer took 81.21ms. Allocated memory is still 650.1MB. Free memory was 594.3MB in the beginning and 581.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 14:13:57,316 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.15ms. Allocated memory is still 159.4MB. Free memory was 110.5MB in the beginning and 110.3MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.60ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 125.3MB in the end (delta: -39.8MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.00ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 125.3MB in the beginning and 200.6MB in the end (delta: -75.3MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.33ms. Allocated memory is still 232.8MB. Free memory was 200.6MB in the beginning and 197.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 653.39ms. Allocated memory is still 232.8MB. Free memory was 197.4MB in the beginning and 141.9MB in the end (delta: 55.6MB). Peak memory consumption was 56.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8502.24ms. Allocated memory was 232.8MB in the beginning and 650.1MB in the end (delta: 417.3MB). Free memory was 140.8MB in the beginning and 594.3MB in the end (delta: -453.5MB). Peak memory consumption was 332.9MB. Max. memory is 16.1GB. * Witness Printer took 81.21ms. Allocated memory is still 650.1MB. Free memory was 594.3MB in the beginning and 581.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 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; [L846] 0 pthread_t t156; [L847] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t156=-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] [L848] 0 pthread_t t157; [L849] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t156=-3, t157=-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] [L850] 0 pthread_t t158; [L851] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t156=-3, t157=-2, t158=-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] [L793] 3 y$w_buff1 = y$w_buff0 [L794] 3 y$w_buff0 = 1 [L795] 3 y$w_buff1_used = y$w_buff0_used [L796] 3 y$w_buff0_used = (_Bool)1 [L797] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L797] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L798] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L799] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L800] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L801] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L802] 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_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EAX = y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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] [L821] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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] [L747] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, 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_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L765] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y [L772] 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) [L773] 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)) [L774] 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)) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 2 __unbuffered_p1_EBX = y [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L824] 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) [L825] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L828] 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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] [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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] [L831] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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] [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156=-3, t157=-2, t158=-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] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 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) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 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 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156=-3, t157=-2, t158=-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] [L864] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t156=-3, t157=-2, t158=-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] [L866] 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - 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: 8.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 429 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 379 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1091 IncrementalHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 64 mSDtfsCounter, 1091 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=374occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 735 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 14:13:57,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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