./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe004_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 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:14:35,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:14:35,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:14:35,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:14:35,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:14:35,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:14:35,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:14:35,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:14:35,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:14:35,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:14:35,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:14:35,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:14:35,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:14:35,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:14:35,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:14:35,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:14:35,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:14:35,293 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:14:35,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:14:35,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:14:35,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:14:35,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:14:35,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:14:35,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:14:35,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:14:35,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:14:35,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:14:35,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:14:35,299 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:14:35,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:14:35,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:14:35,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:14:35,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:14:35,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:14:35,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:14:35,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:14:35,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:14:35,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:14:35,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:14:35,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:14:35,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:14:35,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:14:35,303 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 -> 0e4c58396f2f1321fc04aa282f0d0da6b992b027ee8ad0492bbdba2f990191a3 [2024-11-16 19:14:35,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:14:35,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:14:35,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:14:35,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:14:35,601 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:14:35,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-16 19:14:36,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:14:37,278 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:14:37,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-16 19:14:37,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c3987b3/c68619529af54142a7d62f3dda2eb805/FLAGfcc72bc88 [2024-11-16 19:14:37,319 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c3987b3/c68619529af54142a7d62f3dda2eb805 [2024-11-16 19:14:37,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:14:37,324 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:14:37,328 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:14:37,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:14:37,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:14:37,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:37,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1adf75ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37, skipping insertion in model container [2024-11-16 19:14:37,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:37,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:14:37,626 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2024-11-16 19:14:37,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:14:37,846 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:14:37,857 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe004_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2024-11-16 19:14:37,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:14:37,965 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:14:37,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37 WrapperNode [2024-11-16 19:14:37,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:14:37,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:14:37,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:14:37,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:14:37,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:37,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:38,027 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-11-16 19:14:38,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:14:38,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:14:38,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:14:38,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:14:38,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:38,041 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:38,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:38,070 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 19:14:38,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:38,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:38,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:38,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:38,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:38,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:38,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:14:38,092 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:14:38,092 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:14:38,093 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:14:38,093 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (1/1) ... [2024-11-16 19:14:38,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:14:38,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:14:38,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 19:14:38,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 19:14:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:14:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:14:38,193 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-16 19:14:38,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-16 19:14:38,194 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-16 19:14:38,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-16 19:14:38,194 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-16 19:14:38,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-16 19:14:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:14:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:14:38,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:14:38,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:14:38,198 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:14:38,323 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:14:38,325 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:14:38,745 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:14:38,746 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:14:39,028 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:14:39,029 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:14:39,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:14:39 BoogieIcfgContainer [2024-11-16 19:14:39,029 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:14:39,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:14:39,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:14:39,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:14:39,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:14:37" (1/3) ... [2024-11-16 19:14:39,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c3ac10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:14:39, skipping insertion in model container [2024-11-16 19:14:39,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:14:37" (2/3) ... [2024-11-16 19:14:39,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c3ac10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:14:39, skipping insertion in model container [2024-11-16 19:14:39,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:14:39" (3/3) ... [2024-11-16 19:14:39,039 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.oepc_pso.oepc_rmo.oepc.i [2024-11-16 19:14:39,056 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:14:39,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 19:14:39,056 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:14:39,112 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:14:39,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 39 transitions, 90 flow [2024-11-16 19:14:39,180 INFO L124 PetriNetUnfolderBase]: 1/36 cut-off events. [2024-11-16 19:14:39,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:14:39,185 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-11-16 19:14:39,186 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 39 transitions, 90 flow [2024-11-16 19:14:39,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 36 transitions, 81 flow [2024-11-16 19:14:39,199 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:14:39,205 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;@1944cece, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:14:39,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-16 19:14:39,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:14:39,209 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-11-16 19:14:39,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:14:39,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:39,210 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-16 19:14:39,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:14:39,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:39,218 INFO L85 PathProgramCache]: Analyzing trace with hash 13308908, now seen corresponding path program 1 times [2024-11-16 19:14:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:39,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963673692] [2024-11-16 19:14:39,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:39,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:39,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:39,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963673692] [2024-11-16 19:14:39,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963673692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:39,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:39,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-16 19:14:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929382073] [2024-11-16 19:14:39,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:39,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:14:39,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:39,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:14:39,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:14:39,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-16 19:14:39,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:39,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:39,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-16 19:14:39,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:40,957 INFO L124 PetriNetUnfolderBase]: 4775/6874 cut-off events. [2024-11-16 19:14:40,958 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-16 19:14:40,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13769 conditions, 6874 events. 4775/6874 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 37907 event pairs, 515 based on Foata normal form. 216/7080 useless extension candidates. Maximal degree in co-relation 13758. Up to 5951 conditions per place. [2024-11-16 19:14:41,010 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 47 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-16 19:14:41,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 229 flow [2024-11-16 19:14:41,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:14:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:14:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-16 19:14:41,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-16 19:14:41,022 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 78 transitions. [2024-11-16 19:14:41,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 229 flow [2024-11-16 19:14:41,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-16 19:14:41,028 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 76 flow [2024-11-16 19:14:41,030 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-11-16 19:14:41,034 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2024-11-16 19:14:41,035 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 76 flow [2024-11-16 19:14:41,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:41,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:41,035 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:14:41,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:14:41,036 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:14:41,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:41,036 INFO L85 PathProgramCache]: Analyzing trace with hash 332598821, now seen corresponding path program 1 times [2024-11-16 19:14:41,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:41,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599298679] [2024-11-16 19:14:41,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:41,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:41,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:41,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599298679] [2024-11-16 19:14:41,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599298679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:41,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:41,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:14:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151931441] [2024-11-16 19:14:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:41,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:14:41,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:41,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:14:41,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:14:41,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:14:41,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:41,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:41,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:14:41,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:42,910 INFO L124 PetriNetUnfolderBase]: 6055/8893 cut-off events. [2024-11-16 19:14:42,911 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2024-11-16 19:14:42,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18089 conditions, 8893 events. 6055/8893 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 50388 event pairs, 1669 based on Foata normal form. 0/8684 useless extension candidates. Maximal degree in co-relation 18079. Up to 5769 conditions per place. [2024-11-16 19:14:42,957 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 41 selfloop transitions, 3 changer transitions 67/115 dead transitions. [2024-11-16 19:14:42,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 115 transitions, 478 flow [2024-11-16 19:14:42,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:14:42,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:14:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-11-16 19:14:42,960 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-11-16 19:14:42,960 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 76 flow. Second operand 8 states and 169 transitions. [2024-11-16 19:14:42,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 115 transitions, 478 flow [2024-11-16 19:14:42,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 115 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:14:42,965 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 105 flow [2024-11-16 19:14:42,968 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=105, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2024-11-16 19:14:42,969 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-11-16 19:14:42,969 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 105 flow [2024-11-16 19:14:42,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:42,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:42,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:14:42,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:14:42,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:14:42,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:42,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2075841254, now seen corresponding path program 1 times [2024-11-16 19:14:42,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:42,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065948957] [2024-11-16 19:14:42,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:42,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:43,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:43,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065948957] [2024-11-16 19:14:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065948957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:43,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:43,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:14:43,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042221565] [2024-11-16 19:14:43,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:43,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:14:43,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:43,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:14:43,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:14:43,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:14:43,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:43,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:43,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:14:43,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:45,353 INFO L124 PetriNetUnfolderBase]: 5012/7365 cut-off events. [2024-11-16 19:14:45,353 INFO L125 PetriNetUnfolderBase]: For 4224/4224 co-relation queries the response was YES. [2024-11-16 19:14:45,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17781 conditions, 7365 events. 5012/7365 cut-off events. For 4224/4224 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 39240 event pairs, 1085 based on Foata normal form. 228/7584 useless extension candidates. Maximal degree in co-relation 17766. Up to 4004 conditions per place. [2024-11-16 19:14:45,393 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 52 selfloop transitions, 9 changer transitions 73/138 dead transitions. [2024-11-16 19:14:45,393 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 138 transitions, 689 flow [2024-11-16 19:14:45,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:14:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:14:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 203 transitions. [2024-11-16 19:14:45,395 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5205128205128206 [2024-11-16 19:14:45,395 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 105 flow. Second operand 10 states and 203 transitions. [2024-11-16 19:14:45,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 138 transitions, 689 flow [2024-11-16 19:14:45,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 138 transitions, 670 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-11-16 19:14:45,446 INFO L231 Difference]: Finished difference. Result has 61 places, 41 transitions, 212 flow [2024-11-16 19:14:45,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=212, PETRI_PLACES=61, PETRI_TRANSITIONS=41} [2024-11-16 19:14:45,447 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-11-16 19:14:45,447 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 41 transitions, 212 flow [2024-11-16 19:14:45,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:45,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:45,447 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:14:45,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:14:45,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:14:45,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash -281242795, now seen corresponding path program 1 times [2024-11-16 19:14:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:45,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093697845] [2024-11-16 19:14:45,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:45,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:46,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:46,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:46,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093697845] [2024-11-16 19:14:46,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093697845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:46,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:46,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:14:46,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805592230] [2024-11-16 19:14:46,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:46,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:14:46,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:46,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:14:46,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:14:46,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:14:46,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 41 transitions, 212 flow. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:46,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:46,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:14:46,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:47,362 INFO L124 PetriNetUnfolderBase]: 6909/10088 cut-off events. [2024-11-16 19:14:47,362 INFO L125 PetriNetUnfolderBase]: For 21964/21964 co-relation queries the response was YES. [2024-11-16 19:14:47,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33553 conditions, 10088 events. 6909/10088 cut-off events. For 21964/21964 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 55229 event pairs, 1498 based on Foata normal form. 156/10240 useless extension candidates. Maximal degree in co-relation 33530. Up to 4871 conditions per place. [2024-11-16 19:14:47,430 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 60 selfloop transitions, 4 changer transitions 62/130 dead transitions. [2024-11-16 19:14:47,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 130 transitions, 900 flow [2024-11-16 19:14:47,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:14:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:14:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-11-16 19:14:47,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2024-11-16 19:14:47,434 INFO L175 Difference]: Start difference. First operand has 61 places, 41 transitions, 212 flow. Second operand 8 states and 160 transitions. [2024-11-16 19:14:47,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 130 transitions, 900 flow [2024-11-16 19:14:47,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 130 transitions, 868 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-11-16 19:14:47,540 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 238 flow [2024-11-16 19:14:47,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=238, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2024-11-16 19:14:47,542 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-11-16 19:14:47,543 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 238 flow [2024-11-16 19:14:47,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:47,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:47,544 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-11-16 19:14:47,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:14:47,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:14:47,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:47,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1098525850, now seen corresponding path program 1 times [2024-11-16 19:14:47,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:47,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349298644] [2024-11-16 19:14:47,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:47,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:48,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:48,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349298644] [2024-11-16 19:14:48,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349298644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:48,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:48,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:14:48,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108669128] [2024-11-16 19:14:48,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:48,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:14:48,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:48,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:14:48,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:14:48,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:14:48,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 238 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:48,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:48,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:14:48,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:49,894 INFO L124 PetriNetUnfolderBase]: 6283/9271 cut-off events. [2024-11-16 19:14:49,895 INFO L125 PetriNetUnfolderBase]: For 22775/22775 co-relation queries the response was YES. [2024-11-16 19:14:49,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32929 conditions, 9271 events. 6283/9271 cut-off events. For 22775/22775 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 50975 event pairs, 1804 based on Foata normal form. 176/9445 useless extension candidates. Maximal degree in co-relation 32903. Up to 4207 conditions per place. [2024-11-16 19:14:49,956 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 61 selfloop transitions, 9 changer transitions 46/120 dead transitions. [2024-11-16 19:14:49,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 120 transitions, 834 flow [2024-11-16 19:14:49,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:14:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:14:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-11-16 19:14:49,959 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2024-11-16 19:14:49,959 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 238 flow. Second operand 8 states and 164 transitions. [2024-11-16 19:14:49,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 120 transitions, 834 flow [2024-11-16 19:14:49,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 120 transitions, 802 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-11-16 19:14:50,000 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 269 flow [2024-11-16 19:14:50,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=269, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2024-11-16 19:14:50,002 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 23 predicate places. [2024-11-16 19:14:50,003 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 269 flow [2024-11-16 19:14:50,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:50,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:50,003 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-11-16 19:14:50,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:14:50,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:14:50,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:50,004 INFO L85 PathProgramCache]: Analyzing trace with hash -231235009, now seen corresponding path program 1 times [2024-11-16 19:14:50,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:50,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408659765] [2024-11-16 19:14:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:50,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:50,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:50,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:50,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408659765] [2024-11-16 19:14:50,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408659765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:50,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:50,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:14:50,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307783298] [2024-11-16 19:14:50,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:50,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:14:50,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:50,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:14:50,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:14:50,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:14:50,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 269 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:50,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:50,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:14:50,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:51,959 INFO L124 PetriNetUnfolderBase]: 5322/8000 cut-off events. [2024-11-16 19:14:51,960 INFO L125 PetriNetUnfolderBase]: For 25233/25233 co-relation queries the response was YES. [2024-11-16 19:14:51,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28691 conditions, 8000 events. 5322/8000 cut-off events. For 25233/25233 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 43227 event pairs, 3212 based on Foata normal form. 111/8109 useless extension candidates. Maximal degree in co-relation 28661. Up to 6736 conditions per place. [2024-11-16 19:14:52,008 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 67 selfloop transitions, 22 changer transitions 44/137 dead transitions. [2024-11-16 19:14:52,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 137 transitions, 979 flow [2024-11-16 19:14:52,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:14:52,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:14:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 187 transitions. [2024-11-16 19:14:52,012 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4794871794871795 [2024-11-16 19:14:52,012 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 269 flow. Second operand 10 states and 187 transitions. [2024-11-16 19:14:52,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 137 transitions, 979 flow [2024-11-16 19:14:52,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 137 transitions, 932 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-11-16 19:14:52,057 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 441 flow [2024-11-16 19:14:52,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=441, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2024-11-16 19:14:52,059 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2024-11-16 19:14:52,060 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 441 flow [2024-11-16 19:14:52,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:52,060 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:52,061 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-11-16 19:14:52,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:14:52,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:14:52,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:52,061 INFO L85 PathProgramCache]: Analyzing trace with hash 178281865, now seen corresponding path program 1 times [2024-11-16 19:14:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:52,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642705878] [2024-11-16 19:14:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:52,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642705878] [2024-11-16 19:14:52,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642705878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:52,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:52,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 19:14:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993267329] [2024-11-16 19:14:52,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:52,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 19:14:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:52,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 19:14:52,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 19:14:52,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:14:52,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 441 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:52,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:52,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:14:52,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:54,026 INFO L124 PetriNetUnfolderBase]: 8015/11960 cut-off events. [2024-11-16 19:14:54,026 INFO L125 PetriNetUnfolderBase]: For 38736/38736 co-relation queries the response was YES. [2024-11-16 19:14:54,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44421 conditions, 11960 events. 8015/11960 cut-off events. For 38736/38736 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 69322 event pairs, 2127 based on Foata normal form. 198/12152 useless extension candidates. Maximal degree in co-relation 44388. Up to 5872 conditions per place. [2024-11-16 19:14:54,102 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 79 selfloop transitions, 10 changer transitions 51/144 dead transitions. [2024-11-16 19:14:54,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 144 transitions, 1232 flow [2024-11-16 19:14:54,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:14:54,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:14:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2024-11-16 19:14:54,104 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5512820512820513 [2024-11-16 19:14:54,104 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 441 flow. Second operand 6 states and 129 transitions. [2024-11-16 19:14:54,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 144 transitions, 1232 flow [2024-11-16 19:14:54,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 144 transitions, 1170 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-11-16 19:14:54,196 INFO L231 Difference]: Finished difference. Result has 75 places, 66 transitions, 468 flow [2024-11-16 19:14:54,196 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=468, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2024-11-16 19:14:54,197 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2024-11-16 19:14:54,197 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 468 flow [2024-11-16 19:14:54,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:54,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:54,197 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-11-16 19:14:54,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:14:54,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:14:54,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:54,199 INFO L85 PathProgramCache]: Analyzing trace with hash 289561591, now seen corresponding path program 2 times [2024-11-16 19:14:54,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:54,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059999345] [2024-11-16 19:14:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:54,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:55,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:55,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:55,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059999345] [2024-11-16 19:14:55,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059999345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:55,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:55,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:14:55,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981139139] [2024-11-16 19:14:55,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:55,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:14:55,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:55,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:14:55,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:14:55,016 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:14:55,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 468 flow. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:55,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:55,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:14:55,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:56,599 INFO L124 PetriNetUnfolderBase]: 6116/9290 cut-off events. [2024-11-16 19:14:56,599 INFO L125 PetriNetUnfolderBase]: For 35185/35185 co-relation queries the response was YES. [2024-11-16 19:14:56,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36547 conditions, 9290 events. 6116/9290 cut-off events. For 35185/35185 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 52781 event pairs, 1171 based on Foata normal form. 198/9486 useless extension candidates. Maximal degree in co-relation 36512. Up to 5413 conditions per place. [2024-11-16 19:14:56,662 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 94 selfloop transitions, 15 changer transitions 49/162 dead transitions. [2024-11-16 19:14:56,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 162 transitions, 1395 flow [2024-11-16 19:14:56,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 19:14:56,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-16 19:14:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2024-11-16 19:14:56,664 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.532051282051282 [2024-11-16 19:14:56,665 INFO L175 Difference]: Start difference. First operand has 75 places, 66 transitions, 468 flow. Second operand 8 states and 166 transitions. [2024-11-16 19:14:56,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 162 transitions, 1395 flow [2024-11-16 19:14:56,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 162 transitions, 1364 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-11-16 19:14:56,735 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 540 flow [2024-11-16 19:14:56,735 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=540, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2024-11-16 19:14:56,737 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places. [2024-11-16 19:14:56,738 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 540 flow [2024-11-16 19:14:56,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:56,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:56,742 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-11-16 19:14:56,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 19:14:56,743 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-11-16 19:14:56,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:56,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1941137651, now seen corresponding path program 3 times [2024-11-16 19:14:56,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:56,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106443829] [2024-11-16 19:14:56,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:56,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:14:57,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:14:57,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:14:57,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106443829] [2024-11-16 19:14:57,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106443829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:14:57,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:14:57,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 19:14:57,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991544893] [2024-11-16 19:14:57,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:14:57,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 19:14:57,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:14:57,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 19:14:57,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 19:14:57,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:14:57,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 540 flow. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:57,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:14:57,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:14:57,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:14:58,473 INFO L124 PetriNetUnfolderBase]: 4998/7661 cut-off events. [2024-11-16 19:14:58,473 INFO L125 PetriNetUnfolderBase]: For 37602/37602 co-relation queries the response was YES. [2024-11-16 19:14:58,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32112 conditions, 7661 events. 4998/7661 cut-off events. For 37602/37602 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 42503 event pairs, 1083 based on Foata normal form. 198/7857 useless extension candidates. Maximal degree in co-relation 32075. Up to 5023 conditions per place. [2024-11-16 19:14:58,519 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 84 selfloop transitions, 14 changer transitions 41/143 dead transitions. [2024-11-16 19:14:58,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 143 transitions, 1307 flow [2024-11-16 19:14:58,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:14:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:14:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 144 transitions. [2024-11-16 19:14:58,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5274725274725275 [2024-11-16 19:14:58,521 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 540 flow. Second operand 7 states and 144 transitions. [2024-11-16 19:14:58,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 143 transitions, 1307 flow [2024-11-16 19:14:58,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 143 transitions, 1246 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-16 19:14:58,579 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 548 flow [2024-11-16 19:14:58,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=548, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-11-16 19:14:58,581 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2024-11-16 19:14:58,581 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 548 flow [2024-11-16 19:14:58,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:14:58,581 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:14:58,582 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-11-16 19:14:58,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:14:58,582 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-11-16 19:14:58,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:14:58,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1655163693, now seen corresponding path program 1 times [2024-11-16 19:14:58,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:14:58,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360028854] [2024-11-16 19:14:58,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:14:58,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:14:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:00,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-11-16 19:15:00,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:00,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360028854] [2024-11-16 19:15:00,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360028854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:00,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:00,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:15:00,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568366446] [2024-11-16 19:15:00,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:00,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:15:00,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:00,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:15:00,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:15:00,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:15:00,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 548 flow. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:00,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:00,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:15:00,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:02,795 INFO L124 PetriNetUnfolderBase]: 9519/14431 cut-off events. [2024-11-16 19:15:02,795 INFO L125 PetriNetUnfolderBase]: For 70234/70234 co-relation queries the response was YES. [2024-11-16 19:15:02,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60170 conditions, 14431 events. 9519/14431 cut-off events. For 70234/70234 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 89922 event pairs, 869 based on Foata normal form. 378/14807 useless extension candidates. Maximal degree in co-relation 60132. Up to 5255 conditions per place. [2024-11-16 19:15:02,874 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 149 selfloop transitions, 60 changer transitions 109/322 dead transitions. [2024-11-16 19:15:02,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 322 transitions, 2992 flow [2024-11-16 19:15:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 19:15:02,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-16 19:15:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 396 transitions. [2024-11-16 19:15:02,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5344129554655871 [2024-11-16 19:15:02,880 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 548 flow. Second operand 19 states and 396 transitions. [2024-11-16 19:15:02,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 322 transitions, 2992 flow [2024-11-16 19:15:03,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 322 transitions, 2726 flow, removed 86 selfloop flow, removed 7 redundant places. [2024-11-16 19:15:03,039 INFO L231 Difference]: Finished difference. Result has 105 places, 115 transitions, 1227 flow [2024-11-16 19:15:03,040 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1227, PETRI_PLACES=105, PETRI_TRANSITIONS=115} [2024-11-16 19:15:03,041 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 60 predicate places. [2024-11-16 19:15:03,041 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 115 transitions, 1227 flow [2024-11-16 19:15:03,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:03,043 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:03,043 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-11-16 19:15:03,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:15:03,044 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-11-16 19:15:03,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1939214091, now seen corresponding path program 2 times [2024-11-16 19:15:03,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:03,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095336709] [2024-11-16 19:15:03,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:03,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:03,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095336709] [2024-11-16 19:15:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095336709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:03,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:03,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 19:15:03,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205148479] [2024-11-16 19:15:03,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:03,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 19:15:03,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:03,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 19:15:03,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-16 19:15:03,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:15:03,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 115 transitions, 1227 flow. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:03,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:03,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:15:03,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:05,836 INFO L124 PetriNetUnfolderBase]: 9257/14253 cut-off events. [2024-11-16 19:15:05,836 INFO L125 PetriNetUnfolderBase]: For 111107/111107 co-relation queries the response was YES. [2024-11-16 19:15:05,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66335 conditions, 14253 events. 9257/14253 cut-off events. For 111107/111107 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 89013 event pairs, 3383 based on Foata normal form. 354/14605 useless extension candidates. Maximal degree in co-relation 66287. Up to 10401 conditions per place. [2024-11-16 19:15:05,947 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 143 selfloop transitions, 79 changer transitions 87/313 dead transitions. [2024-11-16 19:15:05,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 313 transitions, 3489 flow [2024-11-16 19:15:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 19:15:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-16 19:15:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 294 transitions. [2024-11-16 19:15:05,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5025641025641026 [2024-11-16 19:15:05,951 INFO L175 Difference]: Start difference. First operand has 105 places, 115 transitions, 1227 flow. Second operand 15 states and 294 transitions. [2024-11-16 19:15:05,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 313 transitions, 3489 flow [2024-11-16 19:15:06,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 313 transitions, 3096 flow, removed 189 selfloop flow, removed 8 redundant places. [2024-11-16 19:15:06,405 INFO L231 Difference]: Finished difference. Result has 112 places, 157 transitions, 1776 flow [2024-11-16 19:15:06,405 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1776, PETRI_PLACES=112, PETRI_TRANSITIONS=157} [2024-11-16 19:15:06,405 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 67 predicate places. [2024-11-16 19:15:06,406 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 157 transitions, 1776 flow [2024-11-16 19:15:06,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:06,406 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:06,406 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-11-16 19:15:06,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 19:15:06,406 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-11-16 19:15:06,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:06,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1933197088, now seen corresponding path program 1 times [2024-11-16 19:15:06,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:06,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612436351] [2024-11-16 19:15:06,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:06,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:07,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:07,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612436351] [2024-11-16 19:15:07,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612436351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:07,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:07,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 19:15:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662146447] [2024-11-16 19:15:07,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:07,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 19:15:07,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:07,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 19:15:07,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 19:15:07,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:15:07,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 157 transitions, 1776 flow. Second operand has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 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-11-16 19:15:07,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:07,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:15:07,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:09,335 INFO L124 PetriNetUnfolderBase]: 7855/12227 cut-off events. [2024-11-16 19:15:09,335 INFO L125 PetriNetUnfolderBase]: For 76172/76172 co-relation queries the response was YES. [2024-11-16 19:15:09,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53722 conditions, 12227 events. 7855/12227 cut-off events. For 76172/76172 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 76022 event pairs, 2737 based on Foata normal form. 258/12483 useless extension candidates. Maximal degree in co-relation 53671. Up to 8627 conditions per place. [2024-11-16 19:15:09,409 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 143 selfloop transitions, 56 changer transitions 71/274 dead transitions. [2024-11-16 19:15:09,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 274 transitions, 3338 flow [2024-11-16 19:15:09,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:15:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:15:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-11-16 19:15:09,411 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5051282051282051 [2024-11-16 19:15:09,411 INFO L175 Difference]: Start difference. First operand has 112 places, 157 transitions, 1776 flow. Second operand 10 states and 197 transitions. [2024-11-16 19:15:09,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 274 transitions, 3338 flow [2024-11-16 19:15:09,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 274 transitions, 3122 flow, removed 96 selfloop flow, removed 7 redundant places. [2024-11-16 19:15:09,668 INFO L231 Difference]: Finished difference. Result has 116 places, 166 transitions, 1996 flow [2024-11-16 19:15:09,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1996, PETRI_PLACES=116, PETRI_TRANSITIONS=166} [2024-11-16 19:15:09,670 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 71 predicate places. [2024-11-16 19:15:09,671 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 166 transitions, 1996 flow [2024-11-16 19:15:09,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.11111111111111) internal successors, (82), 9 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-11-16 19:15:09,671 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:09,672 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-11-16 19:15:09,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 19:15:09,672 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-11-16 19:15:09,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:09,672 INFO L85 PathProgramCache]: Analyzing trace with hash 690205714, now seen corresponding path program 1 times [2024-11-16 19:15:09,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890829016] [2024-11-16 19:15:09,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:09,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:11,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:11,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890829016] [2024-11-16 19:15:11,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890829016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:11,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:11,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 19:15:11,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973108867] [2024-11-16 19:15:11,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:11,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 19:15:11,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:11,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 19:15:11,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-16 19:15:11,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:15:11,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 166 transitions, 1996 flow. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:11,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:11,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:15:11,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:14,029 INFO L124 PetriNetUnfolderBase]: 9853/15229 cut-off events. [2024-11-16 19:15:14,029 INFO L125 PetriNetUnfolderBase]: For 119038/119038 co-relation queries the response was YES. [2024-11-16 19:15:14,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70839 conditions, 15229 events. 9853/15229 cut-off events. For 119038/119038 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 97382 event pairs, 1887 based on Foata normal form. 372/15599 useless extension candidates. Maximal degree in co-relation 70785. Up to 7105 conditions per place. [2024-11-16 19:15:14,184 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 129 selfloop transitions, 31 changer transitions 217/381 dead transitions. [2024-11-16 19:15:14,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 381 transitions, 4936 flow [2024-11-16 19:15:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 19:15:14,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-16 19:15:14,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 251 transitions. [2024-11-16 19:15:14,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49506903353057197 [2024-11-16 19:15:14,185 INFO L175 Difference]: Start difference. First operand has 116 places, 166 transitions, 1996 flow. Second operand 13 states and 251 transitions. [2024-11-16 19:15:14,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 381 transitions, 4936 flow [2024-11-16 19:15:14,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 381 transitions, 4769 flow, removed 69 selfloop flow, removed 5 redundant places. [2024-11-16 19:15:14,516 INFO L231 Difference]: Finished difference. Result has 128 places, 126 transitions, 1598 flow [2024-11-16 19:15:14,517 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1925, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1598, PETRI_PLACES=128, PETRI_TRANSITIONS=126} [2024-11-16 19:15:14,517 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 83 predicate places. [2024-11-16 19:15:14,517 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 126 transitions, 1598 flow [2024-11-16 19:15:14,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:14,517 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:14,518 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-11-16 19:15:14,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 19:15:14,518 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-11-16 19:15:14,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:14,519 INFO L85 PathProgramCache]: Analyzing trace with hash -793492856, now seen corresponding path program 2 times [2024-11-16 19:15:14,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:14,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404810692] [2024-11-16 19:15:14,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:14,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:14,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:14,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404810692] [2024-11-16 19:15:14,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404810692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:14,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:14,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:15:14,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345898936] [2024-11-16 19:15:14,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:14,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:15:14,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:14,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:15:14,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:15:14,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-16 19:15:14,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 126 transitions, 1598 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:14,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:14,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-16 19:15:14,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:15,688 INFO L124 PetriNetUnfolderBase]: 5246/8517 cut-off events. [2024-11-16 19:15:15,688 INFO L125 PetriNetUnfolderBase]: For 76525/76525 co-relation queries the response was YES. [2024-11-16 19:15:15,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38152 conditions, 8517 events. 5246/8517 cut-off events. For 76525/76525 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 55005 event pairs, 804 based on Foata normal form. 456/8970 useless extension candidates. Maximal degree in co-relation 38092. Up to 4837 conditions per place. [2024-11-16 19:15:15,737 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 153 selfloop transitions, 5 changer transitions 22/184 dead transitions. [2024-11-16 19:15:15,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 184 transitions, 2664 flow [2024-11-16 19:15:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:15:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:15:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-11-16 19:15:15,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5705128205128205 [2024-11-16 19:15:15,739 INFO L175 Difference]: Start difference. First operand has 128 places, 126 transitions, 1598 flow. Second operand 4 states and 89 transitions. [2024-11-16 19:15:15,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 184 transitions, 2664 flow [2024-11-16 19:15:15,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 184 transitions, 2356 flow, removed 120 selfloop flow, removed 18 redundant places. [2024-11-16 19:15:15,847 INFO L231 Difference]: Finished difference. Result has 108 places, 101 transitions, 1072 flow [2024-11-16 19:15:15,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1066, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1072, PETRI_PLACES=108, PETRI_TRANSITIONS=101} [2024-11-16 19:15:15,848 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 63 predicate places. [2024-11-16 19:15:15,848 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 101 transitions, 1072 flow [2024-11-16 19:15:15,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:15,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:15,848 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:15,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 19:15:15,849 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-11-16 19:15:15,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:15,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1560553402, now seen corresponding path program 1 times [2024-11-16 19:15:15,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:15,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490676856] [2024-11-16 19:15:15,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:15,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:17,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:17,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490676856] [2024-11-16 19:15:17,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490676856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:17,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:17,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 19:15:17,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671922398] [2024-11-16 19:15:17,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:17,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 19:15:17,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:17,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 19:15:17,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-16 19:15:17,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:15:17,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 101 transitions, 1072 flow. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:17,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:17,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:15:17,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:18,725 INFO L124 PetriNetUnfolderBase]: 4059/6472 cut-off events. [2024-11-16 19:15:18,725 INFO L125 PetriNetUnfolderBase]: For 47162/47162 co-relation queries the response was YES. [2024-11-16 19:15:18,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29877 conditions, 6472 events. 4059/6472 cut-off events. For 47162/47162 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 37305 event pairs, 1484 based on Foata normal form. 46/6516 useless extension candidates. Maximal degree in co-relation 29828. Up to 5250 conditions per place. [2024-11-16 19:15:18,765 INFO L140 encePairwiseOnDemand]: 27/39 looper letters, 114 selfloop transitions, 29 changer transitions 50/197 dead transitions. [2024-11-16 19:15:18,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 197 transitions, 2320 flow [2024-11-16 19:15:18,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 19:15:18,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-16 19:15:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 217 transitions. [2024-11-16 19:15:18,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4280078895463511 [2024-11-16 19:15:18,767 INFO L175 Difference]: Start difference. First operand has 108 places, 101 transitions, 1072 flow. Second operand 13 states and 217 transitions. [2024-11-16 19:15:18,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 197 transitions, 2320 flow [2024-11-16 19:15:18,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 197 transitions, 2178 flow, removed 55 selfloop flow, removed 4 redundant places. [2024-11-16 19:15:18,823 INFO L231 Difference]: Finished difference. Result has 123 places, 111 transitions, 1214 flow [2024-11-16 19:15:18,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1006, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1214, PETRI_PLACES=123, PETRI_TRANSITIONS=111} [2024-11-16 19:15:18,824 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 78 predicate places. [2024-11-16 19:15:18,824 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 111 transitions, 1214 flow [2024-11-16 19:15:18,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:18,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:18,824 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:18,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 19:15:18,825 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:18,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:18,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1091901528, now seen corresponding path program 1 times [2024-11-16 19:15:18,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:18,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863766018] [2024-11-16 19:15:18,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:20,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:20,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863766018] [2024-11-16 19:15:20,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863766018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:20,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:20,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 19:15:20,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852877621] [2024-11-16 19:15:20,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:20,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 19:15:20,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:20,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 19:15:20,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-16 19:15:20,478 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:15:20,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 111 transitions, 1214 flow. Second operand has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:20,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:20,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:15:20,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:21,486 INFO L124 PetriNetUnfolderBase]: 3913/6222 cut-off events. [2024-11-16 19:15:21,487 INFO L125 PetriNetUnfolderBase]: For 52181/52181 co-relation queries the response was YES. [2024-11-16 19:15:21,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28759 conditions, 6222 events. 3913/6222 cut-off events. For 52181/52181 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 35530 event pairs, 1226 based on Foata normal form. 86/6306 useless extension candidates. Maximal degree in co-relation 28704. Up to 4449 conditions per place. [2024-11-16 19:15:21,526 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 111 selfloop transitions, 19 changer transitions 90/224 dead transitions. [2024-11-16 19:15:21,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 224 transitions, 2434 flow [2024-11-16 19:15:21,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 19:15:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-16 19:15:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 240 transitions. [2024-11-16 19:15:21,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43956043956043955 [2024-11-16 19:15:21,527 INFO L175 Difference]: Start difference. First operand has 123 places, 111 transitions, 1214 flow. Second operand 14 states and 240 transitions. [2024-11-16 19:15:21,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 224 transitions, 2434 flow [2024-11-16 19:15:21,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 224 transitions, 2343 flow, removed 40 selfloop flow, removed 5 redundant places. [2024-11-16 19:15:21,615 INFO L231 Difference]: Finished difference. Result has 132 places, 97 transitions, 1052 flow [2024-11-16 19:15:21,616 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1052, PETRI_PLACES=132, PETRI_TRANSITIONS=97} [2024-11-16 19:15:21,616 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 87 predicate places. [2024-11-16 19:15:21,616 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 97 transitions, 1052 flow [2024-11-16 19:15:21,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:21,617 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:21,617 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] [2024-11-16 19:15:21,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 19:15:21,617 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash -226484798, now seen corresponding path program 1 times [2024-11-16 19:15:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:21,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742354459] [2024-11-16 19:15:21,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:21,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:21,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742354459] [2024-11-16 19:15:21,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742354459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:21,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:21,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:15:21,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192183931] [2024-11-16 19:15:21,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:21,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:15:21,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:21,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:15:21,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:15:21,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-16 19:15:21,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 97 transitions, 1052 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:21,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:21,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-16 19:15:21,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:22,200 INFO L124 PetriNetUnfolderBase]: 1861/3103 cut-off events. [2024-11-16 19:15:22,200 INFO L125 PetriNetUnfolderBase]: For 25496/25496 co-relation queries the response was YES. [2024-11-16 19:15:22,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13402 conditions, 3103 events. 1861/3103 cut-off events. For 25496/25496 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 16395 event pairs, 201 based on Foata normal form. 192/3293 useless extension candidates. Maximal degree in co-relation 13345. Up to 1289 conditions per place. [2024-11-16 19:15:22,219 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 117 selfloop transitions, 8 changer transitions 7/136 dead transitions. [2024-11-16 19:15:22,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 136 transitions, 1773 flow [2024-11-16 19:15:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:15:22,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:15:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-11-16 19:15:22,220 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2024-11-16 19:15:22,220 INFO L175 Difference]: Start difference. First operand has 132 places, 97 transitions, 1052 flow. Second operand 5 states and 105 transitions. [2024-11-16 19:15:22,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 136 transitions, 1773 flow [2024-11-16 19:15:22,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 136 transitions, 1539 flow, removed 46 selfloop flow, removed 26 redundant places. [2024-11-16 19:15:22,248 INFO L231 Difference]: Finished difference. Result has 104 places, 80 transitions, 724 flow [2024-11-16 19:15:22,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=724, PETRI_PLACES=104, PETRI_TRANSITIONS=80} [2024-11-16 19:15:22,249 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 59 predicate places. [2024-11-16 19:15:22,249 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 80 transitions, 724 flow [2024-11-16 19:15:22,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:22,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:22,249 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-11-16 19:15:22,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 19:15:22,250 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:22,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:22,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1167038845, now seen corresponding path program 1 times [2024-11-16 19:15:22,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:22,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050806136] [2024-11-16 19:15:22,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:22,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:23,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:23,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050806136] [2024-11-16 19:15:23,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050806136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 19:15:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945637766] [2024-11-16 19:15:23,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:23,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 19:15:23,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:23,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 19:15:23,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-16 19:15:23,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:15:23,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 80 transitions, 724 flow. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:23,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:23,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:15:23,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:24,483 INFO L124 PetriNetUnfolderBase]: 1537/2544 cut-off events. [2024-11-16 19:15:24,483 INFO L125 PetriNetUnfolderBase]: For 14882/14882 co-relation queries the response was YES. [2024-11-16 19:15:24,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11039 conditions, 2544 events. 1537/2544 cut-off events. For 14882/14882 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 12391 event pairs, 737 based on Foata normal form. 20/2562 useless extension candidates. Maximal degree in co-relation 10996. Up to 2090 conditions per place. [2024-11-16 19:15:24,495 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 78 selfloop transitions, 12 changer transitions 33/127 dead transitions. [2024-11-16 19:15:24,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 127 transitions, 1243 flow [2024-11-16 19:15:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 19:15:24,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 19:15:24,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 165 transitions. [2024-11-16 19:15:24,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2024-11-16 19:15:24,497 INFO L175 Difference]: Start difference. First operand has 104 places, 80 transitions, 724 flow. Second operand 11 states and 165 transitions. [2024-11-16 19:15:24,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 127 transitions, 1243 flow [2024-11-16 19:15:24,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 127 transitions, 1178 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-11-16 19:15:24,515 INFO L231 Difference]: Finished difference. Result has 115 places, 75 transitions, 677 flow [2024-11-16 19:15:24,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=677, PETRI_PLACES=115, PETRI_TRANSITIONS=75} [2024-11-16 19:15:24,515 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 70 predicate places. [2024-11-16 19:15:24,516 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 75 transitions, 677 flow [2024-11-16 19:15:24,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 11 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:24,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:24,516 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-11-16 19:15:24,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 19:15:24,516 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:24,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1678265821, now seen corresponding path program 2 times [2024-11-16 19:15:24,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:24,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711828072] [2024-11-16 19:15:24,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:24,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:25,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711828072] [2024-11-16 19:15:25,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711828072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:25,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:25,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 19:15:25,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333026599] [2024-11-16 19:15:25,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:25,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 19:15:25,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:25,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 19:15:25,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-16 19:15:25,833 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:15:25,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 75 transitions, 677 flow. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:25,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:25,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:15:25,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:26,371 INFO L124 PetriNetUnfolderBase]: 1299/2174 cut-off events. [2024-11-16 19:15:26,371 INFO L125 PetriNetUnfolderBase]: For 13389/13389 co-relation queries the response was YES. [2024-11-16 19:15:26,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9339 conditions, 2174 events. 1299/2174 cut-off events. For 13389/13389 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10291 event pairs, 479 based on Foata normal form. 20/2192 useless extension candidates. Maximal degree in co-relation 9292. Up to 1640 conditions per place. [2024-11-16 19:15:26,382 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 73 selfloop transitions, 10 changer transitions 43/130 dead transitions. [2024-11-16 19:15:26,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 130 transitions, 1240 flow [2024-11-16 19:15:26,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 19:15:26,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-16 19:15:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 175 transitions. [2024-11-16 19:15:26,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37393162393162394 [2024-11-16 19:15:26,384 INFO L175 Difference]: Start difference. First operand has 115 places, 75 transitions, 677 flow. Second operand 12 states and 175 transitions. [2024-11-16 19:15:26,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 130 transitions, 1240 flow [2024-11-16 19:15:26,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 130 transitions, 1122 flow, removed 29 selfloop flow, removed 16 redundant places. [2024-11-16 19:15:26,403 INFO L231 Difference]: Finished difference. Result has 109 places, 72 transitions, 596 flow [2024-11-16 19:15:26,403 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=596, PETRI_PLACES=109, PETRI_TRANSITIONS=72} [2024-11-16 19:15:26,404 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 64 predicate places. [2024-11-16 19:15:26,404 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 72 transitions, 596 flow [2024-11-16 19:15:26,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:26,404 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:26,404 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-11-16 19:15:26,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 19:15:26,405 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:26,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash 411342299, now seen corresponding path program 3 times [2024-11-16 19:15:26,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:26,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615325850] [2024-11-16 19:15:26,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:26,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:28,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:28,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615325850] [2024-11-16 19:15:28,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615325850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:28,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:28,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 19:15:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714254440] [2024-11-16 19:15:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:28,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 19:15:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 19:15:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-16 19:15:28,045 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-11-16 19:15:28,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 72 transitions, 596 flow. Second operand has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:28,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:28,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-11-16 19:15:28,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:28,558 INFO L124 PetriNetUnfolderBase]: 1200/2005 cut-off events. [2024-11-16 19:15:28,558 INFO L125 PetriNetUnfolderBase]: For 10145/10145 co-relation queries the response was YES. [2024-11-16 19:15:28,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8256 conditions, 2005 events. 1200/2005 cut-off events. For 10145/10145 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9212 event pairs, 463 based on Foata normal form. 20/2023 useless extension candidates. Maximal degree in co-relation 8214. Up to 1562 conditions per place. [2024-11-16 19:15:28,566 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 71 selfloop transitions, 11 changer transitions 30/116 dead transitions. [2024-11-16 19:15:28,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 116 transitions, 1091 flow [2024-11-16 19:15:28,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 19:15:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-16 19:15:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 150 transitions. [2024-11-16 19:15:28,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2024-11-16 19:15:28,567 INFO L175 Difference]: Start difference. First operand has 109 places, 72 transitions, 596 flow. Second operand 10 states and 150 transitions. [2024-11-16 19:15:28,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 116 transitions, 1091 flow [2024-11-16 19:15:28,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 116 transitions, 1018 flow, removed 28 selfloop flow, removed 11 redundant places. [2024-11-16 19:15:28,579 INFO L231 Difference]: Finished difference. Result has 105 places, 70 transitions, 578 flow [2024-11-16 19:15:28,579 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=578, PETRI_PLACES=105, PETRI_TRANSITIONS=70} [2024-11-16 19:15:28,580 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 60 predicate places. [2024-11-16 19:15:28,580 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 70 transitions, 578 flow [2024-11-16 19:15:28,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.833333333333334) internal successors, (106), 12 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:15:28,580 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:28,580 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-11-16 19:15:28,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 19:15:28,580 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:28,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash -408134817, now seen corresponding path program 4 times [2024-11-16 19:15:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:28,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848880059] [2024-11-16 19:15:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:28,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:15:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:15:28,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:15:28,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848880059] [2024-11-16 19:15:28,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848880059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:15:28,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:15:28,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 19:15:28,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564350050] [2024-11-16 19:15:28,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:15:28,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 19:15:28,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:15:28,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 19:15:28,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 19:15:28,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-11-16 19:15:28,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 70 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-11-16 19:15:28,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:15:28,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-11-16 19:15:28,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:15:28,956 INFO L124 PetriNetUnfolderBase]: 658/1106 cut-off events. [2024-11-16 19:15:28,956 INFO L125 PetriNetUnfolderBase]: For 4173/4173 co-relation queries the response was YES. [2024-11-16 19:15:28,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4132 conditions, 1106 events. 658/1106 cut-off events. For 4173/4173 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4568 event pairs, 74 based on Foata normal form. 56/1160 useless extension candidates. Maximal degree in co-relation 4091. Up to 420 conditions per place. [2024-11-16 19:15:28,962 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 81 selfloop transitions, 11 changer transitions 12/108 dead transitions. [2024-11-16 19:15:28,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 108 transitions, 1058 flow [2024-11-16 19:15:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:15:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:15:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-11-16 19:15:28,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4658119658119658 [2024-11-16 19:15:28,963 INFO L175 Difference]: Start difference. First operand has 105 places, 70 transitions, 578 flow. Second operand 6 states and 109 transitions. [2024-11-16 19:15:28,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 108 transitions, 1058 flow [2024-11-16 19:15:28,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 108 transitions, 918 flow, removed 44 selfloop flow, removed 17 redundant places. [2024-11-16 19:15:28,968 INFO L231 Difference]: Finished difference. Result has 91 places, 58 transitions, 404 flow [2024-11-16 19:15:28,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=91, PETRI_TRANSITIONS=58} [2024-11-16 19:15:28,968 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 46 predicate places. [2024-11-16 19:15:28,968 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 58 transitions, 404 flow [2024-11-16 19:15:28,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-11-16 19:15:28,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:15:28,969 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-11-16 19:15:28,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 19:15:28,969 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-16 19:15:28,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:15:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1233721672, now seen corresponding path program 1 times [2024-11-16 19:15:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:15:28,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133918535] [2024-11-16 19:15:28,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:15:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:15:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:15:29,053 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:15:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:15:29,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:15:29,203 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:15:29,204 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-16 19:15:29,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-16 19:15:29,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-16 19:15:29,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-16 19:15:29,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-16 19:15:29,207 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-16 19:15:29,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 19:15:29,208 INFO L407 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:15:29,310 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:15:29,310 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:15:29,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:15:29 BasicIcfg [2024-11-16 19:15:29,317 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:15:29,318 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:15:29,318 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:15:29,318 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:15:29,319 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:14:39" (3/4) ... [2024-11-16 19:15:29,319 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 19:15:29,420 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:15:29,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:15:29,421 INFO L158 Benchmark]: Toolchain (without parser) took 52097.01ms. Allocated memory was 159.4MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 89.0MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 509.6MB. Max. memory is 16.1GB. [2024-11-16 19:15:29,421 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:15:29,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 638.36ms. Allocated memory is still 159.4MB. Free memory was 88.8MB in the beginning and 107.2MB in the end (delta: -18.4MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-11-16 19:15:29,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.90ms. Allocated memory is still 159.4MB. Free memory was 107.2MB in the beginning and 104.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:15:29,422 INFO L158 Benchmark]: Boogie Preprocessor took 63.08ms. Allocated memory is still 159.4MB. Free memory was 104.5MB in the beginning and 99.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 19:15:29,422 INFO L158 Benchmark]: IcfgBuilder took 937.20ms. Allocated memory is still 159.4MB. Free memory was 99.6MB in the beginning and 99.3MB in the end (delta: 261.1kB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. [2024-11-16 19:15:29,422 INFO L158 Benchmark]: TraceAbstraction took 50286.22ms. Allocated memory was 159.4MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 98.4MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 503.8MB. Max. memory is 16.1GB. [2024-11-16 19:15:29,423 INFO L158 Benchmark]: Witness Printer took 102.43ms. Allocated memory is still 3.2GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 19:15:29,424 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.18ms. Allocated memory is still 109.1MB. Free memory is still 68.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 638.36ms. Allocated memory is still 159.4MB. Free memory was 88.8MB in the beginning and 107.2MB in the end (delta: -18.4MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.90ms. Allocated memory is still 159.4MB. Free memory was 107.2MB in the beginning and 104.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.08ms. Allocated memory is still 159.4MB. Free memory was 104.5MB in the beginning and 99.6MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 937.20ms. Allocated memory is still 159.4MB. Free memory was 99.6MB in the beginning and 99.3MB in the end (delta: 261.1kB). Peak memory consumption was 61.7MB. Max. memory is 16.1GB. * TraceAbstraction took 50286.22ms. Allocated memory was 159.4MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 98.4MB in the beginning and 2.6GB in the end (delta: -2.5GB). Peak memory consumption was 503.8MB. Max. memory is 16.1GB. * Witness Printer took 102.43ms. Allocated memory is still 3.2GB. Free memory was 2.6GB in the beginning and 2.6GB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1873; [L845] FCALL, FORK 0 pthread_create(&t1873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 2 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L846] 0 pthread_t t1874; [L847] FCALL, FORK 0 pthread_create(&t1874, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L848] 0 pthread_t t1875; [L753] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L849] FCALL, FORK 0 pthread_create(&t1875, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L770] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L780] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EAX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] 3 y$mem_tmp = y [L810] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L811] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L812] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L813] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L814] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L816] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EBX = y [L818] 3 y = y$flush_delayed ? y$mem_tmp : y [L819] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L862] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L863] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L864] 0 y$flush_delayed = weak$$choice2 [L865] 0 y$mem_tmp = y [L866] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L867] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L868] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L869] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L870] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L871] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L872] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L874] 0 y = y$flush_delayed ? y$mem_tmp : y [L875] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1873=-2, t1874=-1, t1875=0, weak$$choice0=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L877] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 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: 50.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2158 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2155 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 383 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6152 IncrementalHoareTripleChecker+Invalid, 6535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 383 mSolverCounterUnsat, 0 mSDtfsCounter, 6152 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 256 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1996occurred in iteration=12, InterpolantAutomatonStates: 200, 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.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 475 NumberOfCodeBlocks, 475 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 425 ConstructedInterpolants, 0 QuantifiedInterpolants, 5875 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-16 19:15:29,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE