./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/safe030_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:59:23,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:59:23,373 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:59:23,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:59:23,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:59:23,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:59:23,410 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:59:23,410 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:59:23,411 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:59:23,412 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:59:23,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:59:23,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:59:23,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:59:23,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:59:23,415 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:59:23,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:59:23,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:59:23,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:59:23,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:59:23,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:59:23,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:59:23,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:59:23,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:59:23,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:59:23,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:59:23,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:59:23,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:59:23,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:59:23,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:59:23,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:59:23,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:59:23,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:59:23,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:59:23,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:59:23,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:59:23,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:59:23,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:59:23,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:59:23,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:59:23,425 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:59:23,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:59:23,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:59:23,426 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2024-10-13 06:59:23,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:59:23,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:59:23,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:59:23,750 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:59:23,750 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:59:23,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 06:59:25,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:59:25,533 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:59:25,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 06:59:25,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767c58eb0/eeadc3af710b4658925ee7192792b9c1/FLAGd72cd2b6c [2024-10-13 06:59:25,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767c58eb0/eeadc3af710b4658925ee7192792b9c1 [2024-10-13 06:59:25,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:59:25,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:59:25,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:59:25,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:59:25,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:59:25,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:59:25" (1/1) ... [2024-10-13 06:59:25,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6271b786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:25, skipping insertion in model container [2024-10-13 06:59:25,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:59:25" (1/1) ... [2024-10-13 06:59:25,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:59:25,816 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2024-10-13 06:59:26,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:59:26,052 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:59:26,067 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/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2024-10-13 06:59:26,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:59:26,180 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:59:26,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26 WrapperNode [2024-10-13 06:59:26,181 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:59:26,182 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:59:26,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:59:26,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:59:26,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,250 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-10-13 06:59:26,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:59:26,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:59:26,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:59:26,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:59:26,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,295 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-13 06:59:26,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,322 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,325 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:59:26,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:59:26,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:59:26,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:59:26,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (1/1) ... [2024-10-13 06:59:26,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:59:26,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:59:26,367 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:59:26,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:59:26,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 06:59:26,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:59:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-13 06:59:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-13 06:59:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-13 06:59:26,420 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-13 06:59:26,420 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-13 06:59:26,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-13 06:59:26,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:59:26,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 06:59:26,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:59:26,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:59:26,424 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 06:59:26,570 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:59:26,571 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:59:26,899 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 06:59:26,900 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:59:27,098 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:59:27,098 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 06:59:27,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:59:27 BoogieIcfgContainer [2024-10-13 06:59:27,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:59:27,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:59:27,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:59:27,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:59:27,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:59:25" (1/3) ... [2024-10-13 06:59:27,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476c986a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:59:27, skipping insertion in model container [2024-10-13 06:59:27,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:59:26" (2/3) ... [2024-10-13 06:59:27,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@476c986a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:59:27, skipping insertion in model container [2024-10-13 06:59:27,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:59:27" (3/3) ... [2024-10-13 06:59:27,110 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2024-10-13 06:59:27,125 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:59:27,125 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-13 06:59:27,125 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 06:59:27,167 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 06:59:27,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-10-13 06:59:27,229 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-10-13 06:59:27,229 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 06:59:27,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 1/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2024-10-13 06:59:27,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-10-13 06:59:27,238 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-10-13 06:59:27,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:59:27,255 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;@19e4b52e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:59:27,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-13 06:59:27,262 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 06:59:27,262 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-13 06:59:27,262 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 06:59:27,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:27,263 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-13 06:59:27,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:27,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:27,269 INFO L85 PathProgramCache]: Analyzing trace with hash 10861020, now seen corresponding path program 1 times [2024-10-13 06:59:27,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:27,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781905184] [2024-10-13 06:59:27,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:27,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:27,780 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-13 06:59:27,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:27,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781905184] [2024-10-13 06:59:27,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781905184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:27,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:27,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 06:59:27,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722265134] [2024-10-13 06:59:27,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:27,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:59:27,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:27,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:59:27,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:59:27,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 39 [2024-10-13 06:59:27,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-13 06:59:27,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:27,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 39 [2024-10-13 06:59:27,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:28,198 INFO L124 PetriNetUnfolderBase]: 530/980 cut-off events. [2024-10-13 06:59:28,200 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 06:59:28,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 980 events. 530/980 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5543 event pairs, 284 based on Foata normal form. 36/996 useless extension candidates. Maximal degree in co-relation 1823. Up to 664 conditions per place. [2024-10-13 06:59:28,213 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 29 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2024-10-13 06:59:28,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 48 transitions, 177 flow [2024-10-13 06:59:28,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:59:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 06:59:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-10-13 06:59:28,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2024-10-13 06:59:28,231 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 90 transitions. [2024-10-13 06:59:28,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 48 transitions, 177 flow [2024-10-13 06:59:28,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 06:59:28,238 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-10-13 06:59:28,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2024-10-13 06:59:28,246 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-10-13 06:59:28,248 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-10-13 06:59:28,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-13 06:59:28,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:28,248 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:59:28,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:59:28,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:28,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:28,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1859281397, now seen corresponding path program 1 times [2024-10-13 06:59:28,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:28,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087083791] [2024-10-13 06:59:28,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:28,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:29,332 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-13 06:59:29,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:29,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087083791] [2024-10-13 06:59:29,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087083791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:29,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:29,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:59:29,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740833263] [2024-10-13 06:59:29,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:29,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:59:29,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:29,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:59:29,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:59:29,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-10-13 06:59:29,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-13 06:59:29,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:29,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-10-13 06:59:29,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:30,719 INFO L124 PetriNetUnfolderBase]: 3181/5108 cut-off events. [2024-10-13 06:59:30,719 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2024-10-13 06:59:30,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10100 conditions, 5108 events. 3181/5108 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 32514 event pairs, 392 based on Foata normal form. 0/4981 useless extension candidates. Maximal degree in co-relation 10090. Up to 2283 conditions per place. [2024-10-13 06:59:30,757 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 41 selfloop transitions, 12 changer transitions 90/152 dead transitions. [2024-10-13 06:59:30,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 152 transitions, 624 flow [2024-10-13 06:59:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:59:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-13 06:59:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 290 transitions. [2024-10-13 06:59:30,760 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6196581196581197 [2024-10-13 06:59:30,760 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 12 states and 290 transitions. [2024-10-13 06:59:30,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 152 transitions, 624 flow [2024-10-13 06:59:30,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 152 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 06:59:30,767 INFO L231 Difference]: Finished difference. Result has 62 places, 43 transitions, 210 flow [2024-10-13 06:59:30,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=210, PETRI_PLACES=62, PETRI_TRANSITIONS=43} [2024-10-13 06:59:30,768 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2024-10-13 06:59:30,769 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 43 transitions, 210 flow [2024-10-13 06:59:30,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 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-13 06:59:30,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:30,769 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:59:30,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:59:30,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:30,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:30,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1342822764, now seen corresponding path program 1 times [2024-10-13 06:59:30,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:30,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935591367] [2024-10-13 06:59:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:31,044 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-13 06:59:31,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:31,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935591367] [2024-10-13 06:59:31,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935591367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:31,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:31,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:59:31,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636483664] [2024-10-13 06:59:31,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:31,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:59:31,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:31,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:59:31,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:59:31,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-10-13 06:59:31,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 43 transitions, 210 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-13 06:59:31,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:31,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-10-13 06:59:31,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:31,845 INFO L124 PetriNetUnfolderBase]: 2044/3422 cut-off events. [2024-10-13 06:59:31,846 INFO L125 PetriNetUnfolderBase]: For 9084/9534 co-relation queries the response was YES. [2024-10-13 06:59:31,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12857 conditions, 3422 events. 2044/3422 cut-off events. For 9084/9534 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 21953 event pairs, 646 based on Foata normal form. 140/3480 useless extension candidates. Maximal degree in co-relation 12836. Up to 2345 conditions per place. [2024-10-13 06:59:31,881 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 37 selfloop transitions, 4 changer transitions 43/99 dead transitions. [2024-10-13 06:59:31,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 99 transitions, 748 flow [2024-10-13 06:59:31,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:59:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 06:59:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2024-10-13 06:59:31,886 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6007326007326007 [2024-10-13 06:59:31,888 INFO L175 Difference]: Start difference. First operand has 62 places, 43 transitions, 210 flow. Second operand 7 states and 164 transitions. [2024-10-13 06:59:31,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 99 transitions, 748 flow [2024-10-13 06:59:31,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 684 flow, removed 32 selfloop flow, removed 4 redundant places. [2024-10-13 06:59:31,916 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 252 flow [2024-10-13 06:59:31,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=252, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2024-10-13 06:59:31,918 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2024-10-13 06:59:31,918 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 252 flow [2024-10-13 06:59:31,919 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-13 06:59:31,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:31,919 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:59:31,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:59:31,920 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:31,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1915055691, now seen corresponding path program 1 times [2024-10-13 06:59:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:31,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138689704] [2024-10-13 06:59:31,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:31,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:32,162 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-13 06:59:32,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:32,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138689704] [2024-10-13 06:59:32,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138689704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:32,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:32,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:59:32,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150316665] [2024-10-13 06:59:32,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:32,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:59:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:32,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:59:32,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:59:32,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-10-13 06:59:32,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:59:32,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:32,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-10-13 06:59:32,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:33,111 INFO L124 PetriNetUnfolderBase]: 2857/4767 cut-off events. [2024-10-13 06:59:33,112 INFO L125 PetriNetUnfolderBase]: For 12596/12937 co-relation queries the response was YES. [2024-10-13 06:59:33,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17293 conditions, 4767 events. 2857/4767 cut-off events. For 12596/12937 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 32145 event pairs, 851 based on Foata normal form. 185/4787 useless extension candidates. Maximal degree in co-relation 17269. Up to 2044 conditions per place. [2024-10-13 06:59:33,157 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 43 selfloop transitions, 5 changer transitions 47/111 dead transitions. [2024-10-13 06:59:33,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 111 transitions, 810 flow [2024-10-13 06:59:33,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:59:33,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-13 06:59:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 169 transitions. [2024-10-13 06:59:33,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2024-10-13 06:59:33,160 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 252 flow. Second operand 7 states and 169 transitions. [2024-10-13 06:59:33,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 111 transitions, 810 flow [2024-10-13 06:59:33,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 790 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-10-13 06:59:33,174 INFO L231 Difference]: Finished difference. Result has 64 places, 46 transitions, 265 flow [2024-10-13 06:59:33,175 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=265, PETRI_PLACES=64, PETRI_TRANSITIONS=46} [2024-10-13 06:59:33,176 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2024-10-13 06:59:33,178 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 46 transitions, 265 flow [2024-10-13 06:59:33,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:59:33,178 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:33,178 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:59:33,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:59:33,179 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:33,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1646685581, now seen corresponding path program 1 times [2024-10-13 06:59:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:33,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903438915] [2024-10-13 06:59:33,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:33,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:34,010 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-13 06:59:34,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:34,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903438915] [2024-10-13 06:59:34,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903438915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:34,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:34,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:59:34,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236232592] [2024-10-13 06:59:34,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:34,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:59:34,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:34,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:59:34,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:59:34,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-10-13 06:59:34,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 46 transitions, 265 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:59:34,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:34,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-10-13 06:59:34,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:35,484 INFO L124 PetriNetUnfolderBase]: 3988/6450 cut-off events. [2024-10-13 06:59:35,484 INFO L125 PetriNetUnfolderBase]: For 21024/21026 co-relation queries the response was YES. [2024-10-13 06:59:35,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24576 conditions, 6450 events. 3988/6450 cut-off events. For 21024/21026 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 42742 event pairs, 910 based on Foata normal form. 180/6629 useless extension candidates. Maximal degree in co-relation 24549. Up to 3818 conditions per place. [2024-10-13 06:59:35,536 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 54 selfloop transitions, 25 changer transitions 69/156 dead transitions. [2024-10-13 06:59:35,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 156 transitions, 1235 flow [2024-10-13 06:59:35,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:59:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 06:59:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 227 transitions. [2024-10-13 06:59:35,539 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5820512820512821 [2024-10-13 06:59:35,539 INFO L175 Difference]: Start difference. First operand has 64 places, 46 transitions, 265 flow. Second operand 10 states and 227 transitions. [2024-10-13 06:59:35,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 156 transitions, 1235 flow [2024-10-13 06:59:35,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 156 transitions, 1188 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-10-13 06:59:35,582 INFO L231 Difference]: Finished difference. Result has 73 places, 62 transitions, 532 flow [2024-10-13 06:59:35,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=532, PETRI_PLACES=73, PETRI_TRANSITIONS=62} [2024-10-13 06:59:35,583 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2024-10-13 06:59:35,583 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 62 transitions, 532 flow [2024-10-13 06:59:35,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 06:59:35,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:35,584 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:59:35,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:59:35,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:35,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1715209529, now seen corresponding path program 1 times [2024-10-13 06:59:35,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:35,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451487544] [2024-10-13 06:59:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:35,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 06:59:36,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:36,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451487544] [2024-10-13 06:59:36,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451487544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:36,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:36,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:59:36,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556675746] [2024-10-13 06:59:36,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:36,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:59:36,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:36,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:59:36,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:59:36,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-10-13 06:59:36,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-13 06:59:36,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:36,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-10-13 06:59:36,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:37,489 INFO L124 PetriNetUnfolderBase]: 4587/7766 cut-off events. [2024-10-13 06:59:37,489 INFO L125 PetriNetUnfolderBase]: For 45728/45813 co-relation queries the response was YES. [2024-10-13 06:59:37,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37361 conditions, 7766 events. 4587/7766 cut-off events. For 45728/45813 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 57210 event pairs, 1009 based on Foata normal form. 241/7962 useless extension candidates. Maximal degree in co-relation 37328. Up to 3012 conditions per place. [2024-10-13 06:59:37,554 INFO L140 encePairwiseOnDemand]: 26/39 looper letters, 62 selfloop transitions, 25 changer transitions 55/152 dead transitions. [2024-10-13 06:59:37,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 152 transitions, 1544 flow [2024-10-13 06:59:37,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:59:37,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 06:59:37,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 226 transitions. [2024-10-13 06:59:37,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5794871794871795 [2024-10-13 06:59:37,557 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 532 flow. Second operand 10 states and 226 transitions. [2024-10-13 06:59:37,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 152 transitions, 1544 flow [2024-10-13 06:59:37,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 152 transitions, 1518 flow, removed 13 selfloop flow, removed 2 redundant places. [2024-10-13 06:59:37,602 INFO L231 Difference]: Finished difference. Result has 83 places, 70 transitions, 748 flow [2024-10-13 06:59:37,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=748, PETRI_PLACES=83, PETRI_TRANSITIONS=70} [2024-10-13 06:59:37,603 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 38 predicate places. [2024-10-13 06:59:37,603 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 70 transitions, 748 flow [2024-10-13 06:59:37,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-13 06:59:37,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:37,603 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:59:37,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:59:37,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:37,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:37,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1147061716, now seen corresponding path program 1 times [2024-10-13 06:59:37,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:37,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198703916] [2024-10-13 06:59:37,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:37,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:37,972 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-13 06:59:37,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:37,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198703916] [2024-10-13 06:59:37,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198703916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:37,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:37,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:59:37,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693926338] [2024-10-13 06:59:37,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:37,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:59:37,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:37,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:59:37,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:59:37,981 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-10-13 06:59:37,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 70 transitions, 748 flow. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-13 06:59:37,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:37,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-10-13 06:59:37,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:39,172 INFO L124 PetriNetUnfolderBase]: 4054/6950 cut-off events. [2024-10-13 06:59:39,173 INFO L125 PetriNetUnfolderBase]: For 63816/64817 co-relation queries the response was YES. [2024-10-13 06:59:39,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37543 conditions, 6950 events. 4054/6950 cut-off events. For 63816/64817 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 50908 event pairs, 1655 based on Foata normal form. 720/7502 useless extension candidates. Maximal degree in co-relation 37501. Up to 4794 conditions per place. [2024-10-13 06:59:39,230 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 47 selfloop transitions, 17 changer transitions 55/148 dead transitions. [2024-10-13 06:59:39,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 148 transitions, 1812 flow [2024-10-13 06:59:39,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:59:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 06:59:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 225 transitions. [2024-10-13 06:59:39,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5769230769230769 [2024-10-13 06:59:39,233 INFO L175 Difference]: Start difference. First operand has 83 places, 70 transitions, 748 flow. Second operand 10 states and 225 transitions. [2024-10-13 06:59:39,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 148 transitions, 1812 flow [2024-10-13 06:59:39,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 148 transitions, 1790 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-10-13 06:59:39,332 INFO L231 Difference]: Finished difference. Result has 92 places, 77 transitions, 913 flow [2024-10-13 06:59:39,333 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=913, PETRI_PLACES=92, PETRI_TRANSITIONS=77} [2024-10-13 06:59:39,333 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2024-10-13 06:59:39,333 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 77 transitions, 913 flow [2024-10-13 06:59:39,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 states have internal predecessors, (118), 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-13 06:59:39,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:39,334 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-13 06:59:39,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:59:39,334 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:39,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:39,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1596872113, now seen corresponding path program 1 times [2024-10-13 06:59:39,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:39,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466387319] [2024-10-13 06:59:39,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:39,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:40,387 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-13 06:59:40,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:40,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466387319] [2024-10-13 06:59:40,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466387319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:40,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:40,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:59:40,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583106349] [2024-10-13 06:59:40,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:40,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:59:40,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:40,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:59:40,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:59:40,412 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 39 [2024-10-13 06:59:40,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 77 transitions, 913 flow. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-13 06:59:40,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:40,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 39 [2024-10-13 06:59:40,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:41,737 INFO L124 PetriNetUnfolderBase]: 5015/8359 cut-off events. [2024-10-13 06:59:41,737 INFO L125 PetriNetUnfolderBase]: For 99090/99094 co-relation queries the response was YES. [2024-10-13 06:59:41,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48940 conditions, 8359 events. 5015/8359 cut-off events. For 99090/99094 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 60271 event pairs, 1360 based on Foata normal form. 245/8603 useless extension candidates. Maximal degree in co-relation 48890. Up to 4809 conditions per place. [2024-10-13 06:59:41,819 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 80 selfloop transitions, 38 changer transitions 96/222 dead transitions. [2024-10-13 06:59:41,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 222 transitions, 3031 flow [2024-10-13 06:59:41,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:59:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 06:59:41,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 249 transitions. [2024-10-13 06:59:41,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5804195804195804 [2024-10-13 06:59:41,822 INFO L175 Difference]: Start difference. First operand has 92 places, 77 transitions, 913 flow. Second operand 11 states and 249 transitions. [2024-10-13 06:59:41,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 222 transitions, 3031 flow [2024-10-13 06:59:42,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 222 transitions, 2990 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-10-13 06:59:42,037 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 1285 flow [2024-10-13 06:59:42,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1285, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2024-10-13 06:59:42,041 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 55 predicate places. [2024-10-13 06:59:42,041 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 1285 flow [2024-10-13 06:59:42,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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-13 06:59:42,046 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:42,046 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] [2024-10-13 06:59:42,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:59:42,046 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:42,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1409180978, now seen corresponding path program 1 times [2024-10-13 06:59:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583625023] [2024-10-13 06:59:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:42,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:42,584 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-13 06:59:42,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:42,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583625023] [2024-10-13 06:59:42,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583625023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:42,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:42,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:59:42,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043147660] [2024-10-13 06:59:42,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:42,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:59:42,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:42,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:59:42,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:59:42,593 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-10-13 06:59:42,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 1285 flow. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 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-13 06:59:42,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:42,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-10-13 06:59:42,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:43,767 INFO L124 PetriNetUnfolderBase]: 3833/6658 cut-off events. [2024-10-13 06:59:43,767 INFO L125 PetriNetUnfolderBase]: For 135381/136673 co-relation queries the response was YES. [2024-10-13 06:59:43,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48045 conditions, 6658 events. 3833/6658 cut-off events. For 135381/136673 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 48885 event pairs, 1258 based on Foata normal form. 886/7420 useless extension candidates. Maximal degree in co-relation 47989. Up to 3824 conditions per place. [2024-10-13 06:59:43,815 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 62 selfloop transitions, 31 changer transitions 61/189 dead transitions. [2024-10-13 06:59:43,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 189 transitions, 3097 flow [2024-10-13 06:59:43,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:59:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 06:59:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 215 transitions. [2024-10-13 06:59:43,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6125356125356125 [2024-10-13 06:59:43,818 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 1285 flow. Second operand 9 states and 215 transitions. [2024-10-13 06:59:43,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 189 transitions, 3097 flow [2024-10-13 06:59:44,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 189 transitions, 2998 flow, removed 47 selfloop flow, removed 5 redundant places. [2024-10-13 06:59:44,019 INFO L231 Difference]: Finished difference. Result has 103 places, 104 transitions, 1652 flow [2024-10-13 06:59:44,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1652, PETRI_PLACES=103, PETRI_TRANSITIONS=104} [2024-10-13 06:59:44,020 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 58 predicate places. [2024-10-13 06:59:44,020 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 1652 flow [2024-10-13 06:59:44,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 8 states have internal predecessors, (134), 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-13 06:59:44,020 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:44,020 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] [2024-10-13 06:59:44,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:59:44,021 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:44,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:44,021 INFO L85 PathProgramCache]: Analyzing trace with hash 721275828, now seen corresponding path program 1 times [2024-10-13 06:59:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:44,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260484648] [2024-10-13 06:59:44,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:44,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 06:59:44,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:44,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260484648] [2024-10-13 06:59:44,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260484648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:44,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:44,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:59:44,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161338658] [2024-10-13 06:59:44,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:44,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:59:44,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:44,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:59:44,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:59:44,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-10-13 06:59:44,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 104 transitions, 1652 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-13 06:59:44,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:44,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-10-13 06:59:44,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:45,610 INFO L124 PetriNetUnfolderBase]: 6639/10612 cut-off events. [2024-10-13 06:59:45,610 INFO L125 PetriNetUnfolderBase]: For 264093/267477 co-relation queries the response was YES. [2024-10-13 06:59:45,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72066 conditions, 10612 events. 6639/10612 cut-off events. For 264093/267477 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 72654 event pairs, 1098 based on Foata normal form. 1727/11885 useless extension candidates. Maximal degree in co-relation 72007. Up to 5414 conditions per place. [2024-10-13 06:59:45,828 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 96 selfloop transitions, 5 changer transitions 13/149 dead transitions. [2024-10-13 06:59:45,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 149 transitions, 2688 flow [2024-10-13 06:59:45,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:59:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 06:59:45,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-10-13 06:59:45,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6602564102564102 [2024-10-13 06:59:45,830 INFO L175 Difference]: Start difference. First operand has 103 places, 104 transitions, 1652 flow. Second operand 4 states and 103 transitions. [2024-10-13 06:59:45,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 149 transitions, 2688 flow [2024-10-13 06:59:46,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 149 transitions, 2527 flow, removed 74 selfloop flow, removed 5 redundant places. [2024-10-13 06:59:46,103 INFO L231 Difference]: Finished difference. Result has 99 places, 99 transitions, 1477 flow [2024-10-13 06:59:46,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1477, PETRI_PLACES=99, PETRI_TRANSITIONS=99} [2024-10-13 06:59:46,104 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 54 predicate places. [2024-10-13 06:59:46,105 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 99 transitions, 1477 flow [2024-10-13 06:59:46,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 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-13 06:59:46,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:46,106 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-13 06:59:46,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:59:46,106 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:46,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1043090615, now seen corresponding path program 1 times [2024-10-13 06:59:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:46,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947394112] [2024-10-13 06:59:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:46,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:46,315 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-13 06:59:46,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947394112] [2024-10-13 06:59:46,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947394112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:46,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:46,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:59:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355856935] [2024-10-13 06:59:46,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:46,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:59:46,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:46,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:59:46,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:59:46,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-10-13 06:59:46,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 99 transitions, 1477 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-13 06:59:46,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:46,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-10-13 06:59:46,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:47,597 INFO L124 PetriNetUnfolderBase]: 4794/7678 cut-off events. [2024-10-13 06:59:47,597 INFO L125 PetriNetUnfolderBase]: For 179056/181152 co-relation queries the response was YES. [2024-10-13 06:59:47,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49785 conditions, 7678 events. 4794/7678 cut-off events. For 179056/181152 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 50381 event pairs, 441 based on Foata normal form. 1196/8523 useless extension candidates. Maximal degree in co-relation 49727. Up to 2777 conditions per place. [2024-10-13 06:59:47,636 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 87 selfloop transitions, 8 changer transitions 29/154 dead transitions. [2024-10-13 06:59:47,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 154 transitions, 2541 flow [2024-10-13 06:59:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:59:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 06:59:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2024-10-13 06:59:47,638 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6717948717948717 [2024-10-13 06:59:47,638 INFO L175 Difference]: Start difference. First operand has 99 places, 99 transitions, 1477 flow. Second operand 5 states and 131 transitions. [2024-10-13 06:59:47,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 154 transitions, 2541 flow [2024-10-13 06:59:47,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 154 transitions, 2519 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-10-13 06:59:47,761 INFO L231 Difference]: Finished difference. Result has 103 places, 87 transitions, 1202 flow [2024-10-13 06:59:47,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1202, PETRI_PLACES=103, PETRI_TRANSITIONS=87} [2024-10-13 06:59:47,761 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 58 predicate places. [2024-10-13 06:59:47,761 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 87 transitions, 1202 flow [2024-10-13 06:59:47,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-13 06:59:47,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:47,762 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-13 06:59:47,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:59:47,762 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:47,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash -642350491, now seen corresponding path program 1 times [2024-10-13 06:59:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:47,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061385227] [2024-10-13 06:59:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:47,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:49,144 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-13 06:59:49,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:49,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061385227] [2024-10-13 06:59:49,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061385227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:49,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:49,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:59:49,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381599129] [2024-10-13 06:59:49,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:49,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:59:49,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:49,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:59:49,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:59:49,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-10-13 06:59:49,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 87 transitions, 1202 flow. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 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-13 06:59:49,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:49,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-10-13 06:59:49,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:50,447 INFO L124 PetriNetUnfolderBase]: 3737/7311 cut-off events. [2024-10-13 06:59:50,447 INFO L125 PetriNetUnfolderBase]: For 83177/84962 co-relation queries the response was YES. [2024-10-13 06:59:50,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38563 conditions, 7311 events. 3737/7311 cut-off events. For 83177/84962 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 61849 event pairs, 1674 based on Foata normal form. 371/7126 useless extension candidates. Maximal degree in co-relation 38520. Up to 2187 conditions per place. [2024-10-13 06:59:50,497 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 64 selfloop transitions, 30 changer transitions 28/160 dead transitions. [2024-10-13 06:59:50,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 160 transitions, 2386 flow [2024-10-13 06:59:50,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:59:50,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-13 06:59:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 257 transitions. [2024-10-13 06:59:50,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5990675990675991 [2024-10-13 06:59:50,499 INFO L175 Difference]: Start difference. First operand has 103 places, 87 transitions, 1202 flow. Second operand 11 states and 257 transitions. [2024-10-13 06:59:50,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 160 transitions, 2386 flow [2024-10-13 06:59:50,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 160 transitions, 2204 flow, removed 71 selfloop flow, removed 6 redundant places. [2024-10-13 06:59:50,599 INFO L231 Difference]: Finished difference. Result has 115 places, 95 transitions, 1437 flow [2024-10-13 06:59:50,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1437, PETRI_PLACES=115, PETRI_TRANSITIONS=95} [2024-10-13 06:59:50,599 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 70 predicate places. [2024-10-13 06:59:50,600 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 95 transitions, 1437 flow [2024-10-13 06:59:50,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 10 states have internal predecessors, (166), 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-13 06:59:50,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:50,600 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-13 06:59:50,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:59:50,600 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:50,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:50,601 INFO L85 PathProgramCache]: Analyzing trace with hash 513528503, now seen corresponding path program 1 times [2024-10-13 06:59:50,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:50,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838477441] [2024-10-13 06:59:50,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:50,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:50,951 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-13 06:59:50,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:50,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838477441] [2024-10-13 06:59:50,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838477441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:50,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:50,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:59:50,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388044115] [2024-10-13 06:59:50,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:50,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:59:50,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:50,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:59:50,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:59:50,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 39 [2024-10-13 06:59:50,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 95 transitions, 1437 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-13 06:59:50,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:50,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 39 [2024-10-13 06:59:50,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:52,135 INFO L124 PetriNetUnfolderBase]: 4147/6923 cut-off events. [2024-10-13 06:59:52,135 INFO L125 PetriNetUnfolderBase]: For 138232/139957 co-relation queries the response was YES. [2024-10-13 06:59:52,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40072 conditions, 6923 events. 4147/6923 cut-off events. For 138232/139957 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 47361 event pairs, 384 based on Foata normal form. 942/7620 useless extension candidates. Maximal degree in co-relation 40024. Up to 2564 conditions per place. [2024-10-13 06:59:52,175 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 64 selfloop transitions, 11 changer transitions 51/148 dead transitions. [2024-10-13 06:59:52,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 148 transitions, 2518 flow [2024-10-13 06:59:52,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:59:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 06:59:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-10-13 06:59:52,178 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-10-13 06:59:52,178 INFO L175 Difference]: Start difference. First operand has 115 places, 95 transitions, 1437 flow. Second operand 6 states and 143 transitions. [2024-10-13 06:59:52,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 148 transitions, 2518 flow [2024-10-13 06:59:52,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 148 transitions, 2206 flow, removed 148 selfloop flow, removed 10 redundant places. [2024-10-13 06:59:52,473 INFO L231 Difference]: Finished difference. Result has 108 places, 67 transitions, 796 flow [2024-10-13 06:59:52,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1251, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=796, PETRI_PLACES=108, PETRI_TRANSITIONS=67} [2024-10-13 06:59:52,474 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 63 predicate places. [2024-10-13 06:59:52,474 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 67 transitions, 796 flow [2024-10-13 06:59:52,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 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-13 06:59:52,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:52,475 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] [2024-10-13 06:59:52,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:59:52,475 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:52,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash -777963541, now seen corresponding path program 1 times [2024-10-13 06:59:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:52,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871669704] [2024-10-13 06:59:52,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:52,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:59:53,776 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-13 06:59:53,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:59:53,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871669704] [2024-10-13 06:59:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871669704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:59:53,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:59:53,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:59:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373531289] [2024-10-13 06:59:53,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:59:53,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:59:53,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:59:53,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:59:53,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:59:53,790 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 39 [2024-10-13 06:59:53,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 67 transitions, 796 flow. Second operand has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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-13 06:59:53,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 06:59:53,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 39 [2024-10-13 06:59:53,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 06:59:54,313 INFO L124 PetriNetUnfolderBase]: 1156/2348 cut-off events. [2024-10-13 06:59:54,313 INFO L125 PetriNetUnfolderBase]: For 16702/17092 co-relation queries the response was YES. [2024-10-13 06:59:54,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9869 conditions, 2348 events. 1156/2348 cut-off events. For 16702/17092 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 16466 event pairs, 342 based on Foata normal form. 79/2164 useless extension candidates. Maximal degree in co-relation 9828. Up to 815 conditions per place. [2024-10-13 06:59:54,325 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 30 selfloop transitions, 11 changer transitions 28/96 dead transitions. [2024-10-13 06:59:54,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 96 transitions, 1060 flow [2024-10-13 06:59:54,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:59:54,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-13 06:59:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 172 transitions. [2024-10-13 06:59:54,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2024-10-13 06:59:54,327 INFO L175 Difference]: Start difference. First operand has 108 places, 67 transitions, 796 flow. Second operand 8 states and 172 transitions. [2024-10-13 06:59:54,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 96 transitions, 1060 flow [2024-10-13 06:59:54,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 96 transitions, 793 flow, removed 73 selfloop flow, removed 26 redundant places. [2024-10-13 06:59:54,363 INFO L231 Difference]: Finished difference. Result has 92 places, 58 transitions, 473 flow [2024-10-13 06:59:54,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=473, PETRI_PLACES=92, PETRI_TRANSITIONS=58} [2024-10-13 06:59:54,364 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2024-10-13 06:59:54,364 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 58 transitions, 473 flow [2024-10-13 06:59:54,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.7) internal successors, (167), 10 states have internal predecessors, (167), 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-13 06:59:54,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 06:59:54,365 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] [2024-10-13 06:59:54,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:59:54,365 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-13 06:59:54,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:59:54,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1006012573, now seen corresponding path program 2 times [2024-10-13 06:59:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:59:54,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319305160] [2024-10-13 06:59:54,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:59:54,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:59:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:59:54,430 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:59:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:59:54,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:59:54,531 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:59:54,532 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-10-13 06:59:54,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-13 06:59:54,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-13 06:59:54,535 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-10-13 06:59:54,536 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-10-13 06:59:54,538 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-13 06:59:54,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:59:54,539 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:59:54,614 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 06:59:54,614 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:59:54,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:59:54 BasicIcfg [2024-10-13 06:59:54,624 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:59:54,625 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:59:54,625 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:59:54,625 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:59:54,626 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:59:27" (3/4) ... [2024-10-13 06:59:54,626 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-13 06:59:54,738 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 06:59:54,738 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:59:54,739 INFO L158 Benchmark]: Toolchain (without parser) took 29173.12ms. Allocated memory was 148.9MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 120.0MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 582.9MB. Max. memory is 16.1GB. [2024-10-13 06:59:54,739 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 148.9MB. Free memory was 120.8MB in the beginning and 120.6MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:59:54,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.63ms. Allocated memory is still 148.9MB. Free memory was 120.0MB in the beginning and 94.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-13 06:59:54,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.63ms. Allocated memory is still 148.9MB. Free memory was 94.3MB in the beginning and 91.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 06:59:54,739 INFO L158 Benchmark]: Boogie Preprocessor took 76.80ms. Allocated memory is still 148.9MB. Free memory was 91.3MB in the beginning and 87.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:59:54,740 INFO L158 Benchmark]: RCFGBuilder took 769.97ms. Allocated memory is still 148.9MB. Free memory was 87.6MB in the beginning and 86.9MB in the end (delta: 648.0kB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2024-10-13 06:59:54,740 INFO L158 Benchmark]: TraceAbstraction took 27521.86ms. Allocated memory was 148.9MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 86.3MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 538.3MB. Max. memory is 16.1GB. [2024-10-13 06:59:54,740 INFO L158 Benchmark]: Witness Printer took 113.43ms. Allocated memory is still 6.1GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 06:59:54,743 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.10ms. Allocated memory is still 148.9MB. Free memory was 120.8MB in the beginning and 120.6MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 614.63ms. Allocated memory is still 148.9MB. Free memory was 120.0MB in the beginning and 94.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.63ms. Allocated memory is still 148.9MB. Free memory was 94.3MB in the beginning and 91.3MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.80ms. Allocated memory is still 148.9MB. Free memory was 91.3MB in the beginning and 87.6MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 769.97ms. Allocated memory is still 148.9MB. Free memory was 87.6MB in the beginning and 86.9MB in the end (delta: 648.0kB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27521.86ms. Allocated memory was 148.9MB in the beginning and 6.1GB in the end (delta: 6.0GB). Free memory was 86.3MB in the beginning and 5.5GB in the end (delta: -5.4GB). Peak memory consumption was 538.3MB. Max. memory is 16.1GB. * Witness Printer took 113.43ms. Allocated memory is still 6.1GB. Free memory was 5.5GB in the beginning and 5.5GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-2, t2490=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L768] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L791] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L794] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L754] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L839] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L840] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L841] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L842] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L844] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489=-2, t2490=-1, t2491=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L849] 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, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 817]: 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: 819]: 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, 64 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: 27.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 849 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 805 mSDsluCounter, 442 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 357 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2335 IncrementalHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 85 mSDtfsCounter, 2335 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1652occurred in iteration=9, InterpolantAutomatonStates: 113, 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.5s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 303 NumberOfCodeBlocks, 303 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 2352 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-13 06:59:54,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE