./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:19:59,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:19:59,699 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:19:59,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:19:59,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:19:59,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:19:59,742 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:19:59,743 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:19:59,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:19:59,744 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:19:59,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:19:59,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:19:59,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:19:59,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:19:59,748 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:19:59,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:19:59,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:19:59,764 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:19:59,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:19:59,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:19:59,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:19:59,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:19:59,769 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:19:59,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:19:59,769 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:19:59,769 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:19:59,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:19:59,770 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:19:59,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:19:59,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:19:59,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:19:59,771 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:19:59,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:19:59,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:19:59,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:19:59,772 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:19:59,772 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:19:59,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:19:59,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:19:59,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:19:59,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:19:59,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:19:59,776 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 -> 8e0bd33ffca0122f84e298c52bb9fdae01e72661c94f68aaa49ed0f187d88b87 [2024-11-10 10:20:00,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:20:00,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:20:00,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:20:00,090 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:20:00,090 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:20:00,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 10:20:01,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:20:01,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:20:01,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 10:20:01,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e131f9e0/e8be7b1af79d4a35b989c060adc74ad6/FLAG497ddab39 [2024-11-10 10:20:01,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e131f9e0/e8be7b1af79d4a35b989c060adc74ad6 [2024-11-10 10:20:01,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:20:01,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:20:01,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:20:01,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:20:01,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:20:01,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:20:01" (1/1) ... [2024-11-10 10:20:01,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bb86936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:01, skipping insertion in model container [2024-11-10 10:20:01,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:20:01" (1/1) ... [2024-11-10 10:20:01,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:20:02,215 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-10 10:20:02,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:20:02,456 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:20:02,474 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-11-10 10:20:02,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:20:02,586 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:20:02,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02 WrapperNode [2024-11-10 10:20:02,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:20:02,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:20:02,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:20:02,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:20:02,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,620 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,662 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-11-10 10:20:02,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:20:02,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:20:02,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:20:02,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:20:02,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,700 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-10 10:20:02,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,714 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:20:02,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:20:02,736 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:20:02,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:20:02,737 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (1/1) ... [2024-11-10 10:20:02,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:20:02,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:20:02,791 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-10 10:20:02,794 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-10 10:20:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 10:20:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:20:02,850 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 10:20:02,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 10:20:02,851 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 10:20:02,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 10:20:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 10:20:02,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 10:20:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:20:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 10:20:02,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:20:02,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:20:02,856 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:20:02,994 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:20:02,996 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:20:03,397 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:20:03,397 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:20:03,673 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:20:03,674 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:20:03,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:20:03 BoogieIcfgContainer [2024-11-10 10:20:03,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:20:03,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:20:03,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:20:03,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:20:03,681 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:20:01" (1/3) ... [2024-11-10 10:20:03,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dede31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:20:03, skipping insertion in model container [2024-11-10 10:20:03,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:20:02" (2/3) ... [2024-11-10 10:20:03,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dede31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:20:03, skipping insertion in model container [2024-11-10 10:20:03,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:20:03" (3/3) ... [2024-11-10 10:20:03,684 INFO L112 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-11-10 10:20:03,699 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:20:03,699 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 10:20:03,700 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:20:03,759 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:20:03,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 41 transitions, 94 flow [2024-11-10 10:20:03,832 INFO L124 PetriNetUnfolderBase]: 1/38 cut-off events. [2024-11-10 10:20:03,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:20:03,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 1/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 76 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2024-11-10 10:20:03,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 41 transitions, 94 flow [2024-11-10 10:20:03,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 85 flow [2024-11-10 10:20:03,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:20:03,863 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;@486a36d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:20:03,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 10:20:03,873 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:20:03,873 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-10 10:20:03,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:20:03,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:03,874 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:03,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:03,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:03,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1383149526, now seen corresponding path program 1 times [2024-11-10 10:20:03,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:03,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114143830] [2024-11-10 10:20:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:04,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:04,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:04,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114143830] [2024-11-10 10:20:04,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114143830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:04,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:04,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 10:20:04,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900481150] [2024-11-10 10:20:04,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:04,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:20:04,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:04,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:20:04,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:20:04,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-11-10 10:20:04,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-10 10:20:04,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:04,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-11-10 10:20:04,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:05,924 INFO L124 PetriNetUnfolderBase]: 6628/9496 cut-off events. [2024-11-10 10:20:05,924 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-10 10:20:05,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19002 conditions, 9496 events. 6628/9496 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 51227 event pairs, 888 based on Foata normal form. 294/9777 useless extension candidates. Maximal degree in co-relation 18991. Up to 7946 conditions per place. [2024-11-10 10:20:05,985 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 47 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2024-11-10 10:20:05,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 223 flow [2024-11-10 10:20:05,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:20:05,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:20:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2024-11-10 10:20:05,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2024-11-10 10:20:05,999 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 85 flow. Second operand 3 states and 78 transitions. [2024-11-10 10:20:06,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 223 flow [2024-11-10 10:20:06,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 220 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 10:20:06,005 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 80 flow [2024-11-10 10:20:06,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-10 10:20:06,014 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, -2 predicate places. [2024-11-10 10:20:06,015 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 80 flow [2024-11-10 10:20:06,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-10 10:20:06,015 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:06,015 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:06,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:20:06,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:06,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:06,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1273871481, now seen corresponding path program 1 times [2024-11-10 10:20:06,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:06,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807011214] [2024-11-10 10:20:06,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:06,641 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-10 10:20:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:06,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807011214] [2024-11-10 10:20:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807011214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:06,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:06,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:20:06,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509001263] [2024-11-10 10:20:06,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:06,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:20:06,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:06,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:20:06,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:20:06,650 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:06,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-10 10:20:06,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:06,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:06,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:08,828 INFO L124 PetriNetUnfolderBase]: 8171/11823 cut-off events. [2024-11-10 10:20:08,828 INFO L125 PetriNetUnfolderBase]: For 504/504 co-relation queries the response was YES. [2024-11-10 10:20:08,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24089 conditions, 11823 events. 8171/11823 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 66427 event pairs, 1814 based on Foata normal form. 0/11614 useless extension candidates. Maximal degree in co-relation 24079. Up to 4975 conditions per place. [2024-11-10 10:20:08,903 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 55 selfloop transitions, 8 changer transitions 110/177 dead transitions. [2024-11-10 10:20:08,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 177 transitions, 724 flow [2024-11-10 10:20:08,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:20:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:20:08,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 260 transitions. [2024-11-10 10:20:08,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5284552845528455 [2024-11-10 10:20:08,910 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 80 flow. Second operand 12 states and 260 transitions. [2024-11-10 10:20:08,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 177 transitions, 724 flow [2024-11-10 10:20:08,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 177 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:20:08,919 INFO L231 Difference]: Finished difference. Result has 64 places, 40 transitions, 176 flow [2024-11-10 10:20:08,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=176, PETRI_PLACES=64, PETRI_TRANSITIONS=40} [2024-11-10 10:20:08,920 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2024-11-10 10:20:08,920 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 40 transitions, 176 flow [2024-11-10 10:20:08,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-10 10:20:08,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:08,921 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:08,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:20:08,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:08,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash 740667477, now seen corresponding path program 1 times [2024-11-10 10:20:08,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:08,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433513709] [2024-11-10 10:20:08,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:09,361 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-10 10:20:09,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:09,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433513709] [2024-11-10 10:20:09,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433513709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:09,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:09,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:20:09,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090965545] [2024-11-10 10:20:09,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:09,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:20:09,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:09,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:20:09,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:20:09,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:09,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 40 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-10 10:20:09,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:09,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:09,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:10,656 INFO L124 PetriNetUnfolderBase]: 6068/8921 cut-off events. [2024-11-10 10:20:10,656 INFO L125 PetriNetUnfolderBase]: For 17230/17230 co-relation queries the response was YES. [2024-11-10 10:20:10,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28268 conditions, 8921 events. 6068/8921 cut-off events. For 17230/17230 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 48524 event pairs, 1722 based on Foata normal form. 195/9113 useless extension candidates. Maximal degree in co-relation 28247. Up to 7390 conditions per place. [2024-11-10 10:20:10,730 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 50 selfloop transitions, 4 changer transitions 51/109 dead transitions. [2024-11-10 10:20:10,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 109 transitions, 722 flow [2024-11-10 10:20:10,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:20:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:20:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-11-10 10:20:10,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4912891986062718 [2024-11-10 10:20:10,735 INFO L175 Difference]: Start difference. First operand has 64 places, 40 transitions, 176 flow. Second operand 7 states and 141 transitions. [2024-11-10 10:20:10,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 109 transitions, 722 flow [2024-11-10 10:20:10,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 663 flow, removed 28 selfloop flow, removed 5 redundant places. [2024-11-10 10:20:10,812 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 214 flow [2024-11-10 10:20:10,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=214, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2024-11-10 10:20:10,813 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 14 predicate places. [2024-11-10 10:20:10,813 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 214 flow [2024-11-10 10:20:10,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-10 10:20:10,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:10,814 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-10 10:20:10,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:20:10,815 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:10,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1018345106, now seen corresponding path program 1 times [2024-11-10 10:20:10,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:10,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615427268] [2024-11-10 10:20:10,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:10,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:10,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:11,675 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-10 10:20:11,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:11,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615427268] [2024-11-10 10:20:11,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615427268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:11,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:11,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:20:11,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19313697] [2024-11-10 10:20:11,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:11,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:20:11,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:11,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:20:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:20:11,681 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:11,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 214 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-10 10:20:11,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:11,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:11,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:12,918 INFO L124 PetriNetUnfolderBase]: 5852/8591 cut-off events. [2024-11-10 10:20:12,919 INFO L125 PetriNetUnfolderBase]: For 15815/15815 co-relation queries the response was YES. [2024-11-10 10:20:12,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27347 conditions, 8591 events. 5852/8591 cut-off events. For 15815/15815 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 45054 event pairs, 800 based on Foata normal form. 166/8744 useless extension candidates. Maximal degree in co-relation 27324. Up to 6426 conditions per place. [2024-11-10 10:20:12,976 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 75 selfloop transitions, 10 changer transitions 52/141 dead transitions. [2024-11-10 10:20:12,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 141 transitions, 884 flow [2024-11-10 10:20:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:20:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:20:12,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 187 transitions. [2024-11-10 10:20:12,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5067750677506775 [2024-11-10 10:20:12,979 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 214 flow. Second operand 9 states and 187 transitions. [2024-11-10 10:20:12,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 141 transitions, 884 flow [2024-11-10 10:20:13,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 141 transitions, 861 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-11-10 10:20:13,013 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 289 flow [2024-11-10 10:20:13,014 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=289, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2024-11-10 10:20:13,014 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2024-11-10 10:20:13,015 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 289 flow [2024-11-10 10:20:13,015 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-10 10:20:13,015 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:13,015 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-10 10:20:13,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:20:13,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:13,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1700504951, now seen corresponding path program 1 times [2024-11-10 10:20:13,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:13,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644576192] [2024-11-10 10:20:13,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:13,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:13,542 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-10 10:20:13,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:13,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644576192] [2024-11-10 10:20:13,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644576192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:13,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:13,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:20:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830243858] [2024-11-10 10:20:13,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:13,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:20:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:13,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:20:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:20:13,549 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:13,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-10 10:20:13,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:13,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:13,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:15,385 INFO L124 PetriNetUnfolderBase]: 8382/12230 cut-off events. [2024-11-10 10:20:15,386 INFO L125 PetriNetUnfolderBase]: For 28536/28536 co-relation queries the response was YES. [2024-11-10 10:20:15,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41466 conditions, 12230 events. 8382/12230 cut-off events. For 28536/28536 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 68548 event pairs, 1588 based on Foata normal form. 208/12435 useless extension candidates. Maximal degree in co-relation 41439. Up to 5882 conditions per place. [2024-11-10 10:20:15,488 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 68 selfloop transitions, 12 changer transitions 50/134 dead transitions. [2024-11-10 10:20:15,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 134 transitions, 934 flow [2024-11-10 10:20:15,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:20:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:20:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2024-11-10 10:20:15,490 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5182926829268293 [2024-11-10 10:20:15,490 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 289 flow. Second operand 8 states and 170 transitions. [2024-11-10 10:20:15,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 134 transitions, 934 flow [2024-11-10 10:20:15,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 134 transitions, 904 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-11-10 10:20:15,584 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 367 flow [2024-11-10 10:20:15,585 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=367, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2024-11-10 10:20:15,586 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2024-11-10 10:20:15,587 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 367 flow [2024-11-10 10:20:15,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 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-10 10:20:15,588 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:15,588 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-10 10:20:15,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:20:15,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:15,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash 526906408, now seen corresponding path program 1 times [2024-11-10 10:20:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:15,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771091801] [2024-11-10 10:20:15,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:15,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:15,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-10 10:20:15,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:15,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771091801] [2024-11-10 10:20:15,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771091801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:15,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:15,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:20:15,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755498557] [2024-11-10 10:20:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:15,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:20:15,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:20:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:20:15,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-11-10 10:20:15,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 367 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-10 10:20:15,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:15,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-11-10 10:20:15,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:16,671 INFO L124 PetriNetUnfolderBase]: 5626/8579 cut-off events. [2024-11-10 10:20:16,671 INFO L125 PetriNetUnfolderBase]: For 21120/21120 co-relation queries the response was YES. [2024-11-10 10:20:16,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28961 conditions, 8579 events. 5626/8579 cut-off events. For 21120/21120 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 48532 event pairs, 831 based on Foata normal form. 420/8988 useless extension candidates. Maximal degree in co-relation 28930. Up to 4439 conditions per place. [2024-11-10 10:20:16,740 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 98 selfloop transitions, 5 changer transitions 6/113 dead transitions. [2024-11-10 10:20:16,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 113 transitions, 945 flow [2024-11-10 10:20:16,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:20:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:20:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-11-10 10:20:16,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6158536585365854 [2024-11-10 10:20:16,742 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 367 flow. Second operand 4 states and 101 transitions. [2024-11-10 10:20:16,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 113 transitions, 945 flow [2024-11-10 10:20:16,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 113 transitions, 901 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-11-10 10:20:16,771 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 353 flow [2024-11-10 10:20:16,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=353, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2024-11-10 10:20:16,773 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2024-11-10 10:20:16,774 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 353 flow [2024-11-10 10:20:16,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-10 10:20:16,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:16,774 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-10 10:20:16,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:20:16,775 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:16,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:16,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1287490633, now seen corresponding path program 1 times [2024-11-10 10:20:16,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:16,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287799545] [2024-11-10 10:20:16,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:16,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:18,166 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-10 10:20:18,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:18,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287799545] [2024-11-10 10:20:18,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287799545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:18,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:18,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 10:20:18,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110538576] [2024-11-10 10:20:18,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:18,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:20:18,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:18,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:20:18,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:20:18,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:18,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 353 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-10 10:20:18,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:18,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:18,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:19,497 INFO L124 PetriNetUnfolderBase]: 6548/9939 cut-off events. [2024-11-10 10:20:19,497 INFO L125 PetriNetUnfolderBase]: For 22170/22173 co-relation queries the response was YES. [2024-11-10 10:20:19,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35726 conditions, 9939 events. 6548/9939 cut-off events. For 22170/22173 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 55638 event pairs, 1446 based on Foata normal form. 160/10093 useless extension candidates. Maximal degree in co-relation 35696. Up to 6569 conditions per place. [2024-11-10 10:20:19,605 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 96 selfloop transitions, 23 changer transitions 74/197 dead transitions. [2024-11-10 10:20:19,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 197 transitions, 1531 flow [2024-11-10 10:20:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 10:20:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 10:20:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 217 transitions. [2024-11-10 10:20:19,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5292682926829269 [2024-11-10 10:20:19,608 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 353 flow. Second operand 10 states and 217 transitions. [2024-11-10 10:20:19,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 197 transitions, 1531 flow [2024-11-10 10:20:19,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 197 transitions, 1499 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-10 10:20:19,630 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 568 flow [2024-11-10 10:20:19,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=568, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2024-11-10 10:20:19,632 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2024-11-10 10:20:19,734 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 568 flow [2024-11-10 10:20:19,734 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-10 10:20:19,735 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:19,735 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-10 10:20:19,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:20:19,735 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:19,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:19,736 INFO L85 PathProgramCache]: Analyzing trace with hash 346547671, now seen corresponding path program 2 times [2024-11-10 10:20:19,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:19,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445002486] [2024-11-10 10:20:19,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:19,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:21,715 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-10 10:20:21,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:21,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445002486] [2024-11-10 10:20:21,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445002486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:21,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:21,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 10:20:21,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475131129] [2024-11-10 10:20:21,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:21,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:20:21,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:21,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:20:21,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:20:21,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:21,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 568 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-10 10:20:21,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:21,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:21,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:23,381 INFO L124 PetriNetUnfolderBase]: 6785/10271 cut-off events. [2024-11-10 10:20:23,381 INFO L125 PetriNetUnfolderBase]: For 42083/42083 co-relation queries the response was YES. [2024-11-10 10:20:23,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41955 conditions, 10271 events. 6785/10271 cut-off events. For 42083/42083 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 57556 event pairs, 1703 based on Foata normal form. 158/10421 useless extension candidates. Maximal degree in co-relation 41919. Up to 5950 conditions per place. [2024-11-10 10:20:23,453 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 72 selfloop transitions, 14 changer transitions 92/182 dead transitions. [2024-11-10 10:20:23,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 182 transitions, 1684 flow [2024-11-10 10:20:23,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:20:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:20:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2024-11-10 10:20:23,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5257452574525745 [2024-11-10 10:20:23,459 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 568 flow. Second operand 9 states and 194 transitions. [2024-11-10 10:20:23,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 182 transitions, 1684 flow [2024-11-10 10:20:23,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 182 transitions, 1674 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-10 10:20:23,533 INFO L231 Difference]: Finished difference. Result has 88 places, 64 transitions, 554 flow [2024-11-10 10:20:23,534 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=554, PETRI_PLACES=88, PETRI_TRANSITIONS=64} [2024-11-10 10:20:23,534 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 41 predicate places. [2024-11-10 10:20:23,535 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 64 transitions, 554 flow [2024-11-10 10:20:23,535 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-10 10:20:23,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:23,535 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-10 10:20:23,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:20:23,536 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:23,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1048587917, now seen corresponding path program 1 times [2024-11-10 10:20:23,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:23,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322645793] [2024-11-10 10:20:23,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:23,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:23,844 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-10 10:20:23,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:23,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322645793] [2024-11-10 10:20:23,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322645793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:23,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:23,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:20:23,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130116956] [2024-11-10 10:20:23,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:23,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:20:23,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:23,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:20:23,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:20:23,848 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-11-10 10:20:23,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 64 transitions, 554 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-10 10:20:23,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:23,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-11-10 10:20:23,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:24,561 INFO L124 PetriNetUnfolderBase]: 3165/4907 cut-off events. [2024-11-10 10:20:24,561 INFO L125 PetriNetUnfolderBase]: For 27937/27937 co-relation queries the response was YES. [2024-11-10 10:20:24,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20454 conditions, 4907 events. 3165/4907 cut-off events. For 27937/27937 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 25314 event pairs, 403 based on Foata normal form. 288/5186 useless extension candidates. Maximal degree in co-relation 20413. Up to 1664 conditions per place. [2024-11-10 10:20:24,597 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 104 selfloop transitions, 8 changer transitions 9/125 dead transitions. [2024-11-10 10:20:24,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 125 transitions, 1344 flow [2024-11-10 10:20:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:20:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:20:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-11-10 10:20:24,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-10 10:20:24,600 INFO L175 Difference]: Start difference. First operand has 88 places, 64 transitions, 554 flow. Second operand 5 states and 123 transitions. [2024-11-10 10:20:24,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 125 transitions, 1344 flow [2024-11-10 10:20:24,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 125 transitions, 1304 flow, removed 7 selfloop flow, removed 7 redundant places. [2024-11-10 10:20:24,627 INFO L231 Difference]: Finished difference. Result has 82 places, 66 transitions, 566 flow [2024-11-10 10:20:24,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=566, PETRI_PLACES=82, PETRI_TRANSITIONS=66} [2024-11-10 10:20:24,628 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 35 predicate places. [2024-11-10 10:20:24,628 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 66 transitions, 566 flow [2024-11-10 10:20:24,628 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-10 10:20:24,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:24,629 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] [2024-11-10 10:20:24,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 10:20:24,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:24,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:24,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1874749878, now seen corresponding path program 1 times [2024-11-10 10:20:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:24,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134612543] [2024-11-10 10:20:24,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:24,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:24,965 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-10 10:20:24,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:24,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134612543] [2024-11-10 10:20:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134612543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:24,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:24,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:20:24,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364226555] [2024-11-10 10:20:24,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:24,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:20:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:24,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:20:24,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:20:24,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-11-10 10:20:24,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 66 transitions, 566 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-10 10:20:24,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:24,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-11-10 10:20:24,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:25,483 INFO L124 PetriNetUnfolderBase]: 1993/3079 cut-off events. [2024-11-10 10:20:25,483 INFO L125 PetriNetUnfolderBase]: For 18513/18513 co-relation queries the response was YES. [2024-11-10 10:20:25,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13538 conditions, 3079 events. 1993/3079 cut-off events. For 18513/18513 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 14678 event pairs, 299 based on Foata normal form. 104/3174 useless extension candidates. Maximal degree in co-relation 13499. Up to 1120 conditions per place. [2024-11-10 10:20:25,499 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 87 selfloop transitions, 11 changer transitions 12/114 dead transitions. [2024-11-10 10:20:25,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 114 transitions, 1192 flow [2024-11-10 10:20:25,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:20:25,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:20:25,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 122 transitions. [2024-11-10 10:20:25,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4959349593495935 [2024-11-10 10:20:25,500 INFO L175 Difference]: Start difference. First operand has 82 places, 66 transitions, 566 flow. Second operand 6 states and 122 transitions. [2024-11-10 10:20:25,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 114 transitions, 1192 flow [2024-11-10 10:20:25,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 114 transitions, 1051 flow, removed 59 selfloop flow, removed 9 redundant places. [2024-11-10 10:20:25,536 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 464 flow [2024-11-10 10:20:25,536 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=73, 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=464, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2024-11-10 10:20:25,537 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2024-11-10 10:20:25,537 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 464 flow [2024-11-10 10:20:25,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-10 10:20:25,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:25,537 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:25,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 10:20:25,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:25,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:25,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1103838132, now seen corresponding path program 1 times [2024-11-10 10:20:25,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:25,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402466112] [2024-11-10 10:20:25,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:25,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:27,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:27,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402466112] [2024-11-10 10:20:27,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402466112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:27,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:27,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:20:27,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553759526] [2024-11-10 10:20:27,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:27,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:20:27,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:27,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:20:27,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:20:27,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:27,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 464 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-10 10:20:27,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:27,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:27,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:27,762 INFO L124 PetriNetUnfolderBase]: 1451/2251 cut-off events. [2024-11-10 10:20:27,763 INFO L125 PetriNetUnfolderBase]: For 9524/9524 co-relation queries the response was YES. [2024-11-10 10:20:27,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9124 conditions, 2251 events. 1451/2251 cut-off events. For 9524/9524 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 9823 event pairs, 146 based on Foata normal form. 8/2257 useless extension candidates. Maximal degree in co-relation 9089. Up to 1557 conditions per place. [2024-11-10 10:20:27,775 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 68 selfloop transitions, 16 changer transitions 14/102 dead transitions. [2024-11-10 10:20:27,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 102 transitions, 900 flow [2024-11-10 10:20:27,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:20:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:20:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-11-10 10:20:27,776 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-11-10 10:20:27,776 INFO L175 Difference]: Start difference. First operand has 80 places, 61 transitions, 464 flow. Second operand 8 states and 126 transitions. [2024-11-10 10:20:27,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 102 transitions, 900 flow [2024-11-10 10:20:27,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 102 transitions, 685 flow, removed 64 selfloop flow, removed 15 redundant places. [2024-11-10 10:20:27,792 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 467 flow [2024-11-10 10:20:27,793 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=467, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2024-11-10 10:20:27,793 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2024-11-10 10:20:27,793 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 467 flow [2024-11-10 10:20:27,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-10 10:20:27,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:27,794 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:27,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 10:20:27,794 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:27,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:27,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1157454394, now seen corresponding path program 2 times [2024-11-10 10:20:27,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:27,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143979961] [2024-11-10 10:20:27,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:27,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:29,702 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-10 10:20:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:29,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143979961] [2024-11-10 10:20:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143979961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:29,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:29,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 10:20:29,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233940311] [2024-11-10 10:20:29,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:29,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:20:29,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:29,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:20:29,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:20:29,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:29,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 467 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-10 10:20:29,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:29,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:29,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:30,367 INFO L124 PetriNetUnfolderBase]: 1939/3003 cut-off events. [2024-11-10 10:20:30,367 INFO L125 PetriNetUnfolderBase]: For 7370/7370 co-relation queries the response was YES. [2024-11-10 10:20:30,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10301 conditions, 3003 events. 1939/3003 cut-off events. For 7370/7370 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 13947 event pairs, 472 based on Foata normal form. 8/3009 useless extension candidates. Maximal degree in co-relation 10273. Up to 2078 conditions per place. [2024-11-10 10:20:30,380 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 62 selfloop transitions, 12 changer transitions 48/126 dead transitions. [2024-11-10 10:20:30,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 126 transitions, 971 flow [2024-11-10 10:20:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:20:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:20:30,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-11-10 10:20:30,381 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4037940379403794 [2024-11-10 10:20:30,381 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 467 flow. Second operand 9 states and 149 transitions. [2024-11-10 10:20:30,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 126 transitions, 971 flow [2024-11-10 10:20:30,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 126 transitions, 942 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-11-10 10:20:30,388 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 499 flow [2024-11-10 10:20:30,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=499, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2024-11-10 10:20:30,388 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 35 predicate places. [2024-11-10 10:20:30,389 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 499 flow [2024-11-10 10:20:30,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-10 10:20:30,389 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:30,389 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:30,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 10:20:30,390 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:30,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1824502360, now seen corresponding path program 3 times [2024-11-10 10:20:30,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:30,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967695259] [2024-11-10 10:20:30,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:30,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:31,113 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-10 10:20:31,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:31,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967695259] [2024-11-10 10:20:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967695259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:31,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:20:31,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451056462] [2024-11-10 10:20:31,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:31,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:20:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:31,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:20:31,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:20:31,120 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:31,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 499 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-10 10:20:31,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:31,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:31,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:31,682 INFO L124 PetriNetUnfolderBase]: 1991/3082 cut-off events. [2024-11-10 10:20:31,682 INFO L125 PetriNetUnfolderBase]: For 7434/7434 co-relation queries the response was YES. [2024-11-10 10:20:31,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10575 conditions, 3082 events. 1991/3082 cut-off events. For 7434/7434 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14502 event pairs, 673 based on Foata normal form. 8/3087 useless extension candidates. Maximal degree in co-relation 10544. Up to 1955 conditions per place. [2024-11-10 10:20:31,701 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 61 selfloop transitions, 16 changer transitions 45/126 dead transitions. [2024-11-10 10:20:31,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 126 transitions, 1017 flow [2024-11-10 10:20:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:20:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:20:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-11-10 10:20:31,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-11-10 10:20:31,702 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 499 flow. Second operand 8 states and 139 transitions. [2024-11-10 10:20:31,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 126 transitions, 1017 flow [2024-11-10 10:20:31,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 126 transitions, 976 flow, removed 13 selfloop flow, removed 7 redundant places. [2024-11-10 10:20:31,712 INFO L231 Difference]: Finished difference. Result has 82 places, 69 transitions, 528 flow [2024-11-10 10:20:31,712 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=528, PETRI_PLACES=82, PETRI_TRANSITIONS=69} [2024-11-10 10:20:31,712 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 35 predicate places. [2024-11-10 10:20:31,712 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 69 transitions, 528 flow [2024-11-10 10:20:31,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-10 10:20:31,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:31,713 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:31,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 10:20:31,713 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:31,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1831100676, now seen corresponding path program 4 times [2024-11-10 10:20:31,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:31,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614743768] [2024-11-10 10:20:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:34,016 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-10 10:20:34,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:34,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614743768] [2024-11-10 10:20:34,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614743768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:34,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:34,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 10:20:34,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177863470] [2024-11-10 10:20:34,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:34,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:20:34,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:34,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:20:34,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:20:34,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:34,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 69 transitions, 528 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-10 10:20:34,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:34,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:34,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:35,349 INFO L124 PetriNetUnfolderBase]: 1738/2727 cut-off events. [2024-11-10 10:20:35,350 INFO L125 PetriNetUnfolderBase]: For 7281/7281 co-relation queries the response was YES. [2024-11-10 10:20:35,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9423 conditions, 2727 events. 1738/2727 cut-off events. For 7281/7281 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12750 event pairs, 447 based on Foata normal form. 8/2732 useless extension candidates. Maximal degree in co-relation 9392. Up to 1465 conditions per place. [2024-11-10 10:20:35,409 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 96 selfloop transitions, 27 changer transitions 47/174 dead transitions. [2024-11-10 10:20:35,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 174 transitions, 1342 flow [2024-11-10 10:20:35,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 10:20:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-10 10:20:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 245 transitions. [2024-11-10 10:20:35,412 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37347560975609756 [2024-11-10 10:20:35,412 INFO L175 Difference]: Start difference. First operand has 82 places, 69 transitions, 528 flow. Second operand 16 states and 245 transitions. [2024-11-10 10:20:35,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 174 transitions, 1342 flow [2024-11-10 10:20:35,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 174 transitions, 1287 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-11-10 10:20:35,423 INFO L231 Difference]: Finished difference. Result has 93 places, 75 transitions, 636 flow [2024-11-10 10:20:35,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=636, PETRI_PLACES=93, PETRI_TRANSITIONS=75} [2024-11-10 10:20:35,424 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 46 predicate places. [2024-11-10 10:20:35,424 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 75 transitions, 636 flow [2024-11-10 10:20:35,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-10 10:20:35,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:35,425 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:35,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 10:20:35,425 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:35,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1051376238, now seen corresponding path program 5 times [2024-11-10 10:20:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:35,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994479676] [2024-11-10 10:20:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:38,566 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-10 10:20:38,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:38,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994479676] [2024-11-10 10:20:38,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994479676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:38,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:38,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 10:20:38,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25241483] [2024-11-10 10:20:38,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:38,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:20:38,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:38,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:20:38,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:20:38,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:38,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 75 transitions, 636 flow. Second operand has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 13 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:20:38,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:38,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:38,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:39,832 INFO L124 PetriNetUnfolderBase]: 2324/3610 cut-off events. [2024-11-10 10:20:39,832 INFO L125 PetriNetUnfolderBase]: For 12336/12336 co-relation queries the response was YES. [2024-11-10 10:20:39,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13117 conditions, 3610 events. 2324/3610 cut-off events. For 12336/12336 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17741 event pairs, 696 based on Foata normal form. 8/3616 useless extension candidates. Maximal degree in co-relation 13083. Up to 2025 conditions per place. [2024-11-10 10:20:39,848 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 92 selfloop transitions, 18 changer transitions 47/161 dead transitions. [2024-11-10 10:20:39,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 161 transitions, 1451 flow [2024-11-10 10:20:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:20:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:20:39,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 192 transitions. [2024-11-10 10:20:39,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-11-10 10:20:39,850 INFO L175 Difference]: Start difference. First operand has 93 places, 75 transitions, 636 flow. Second operand 12 states and 192 transitions. [2024-11-10 10:20:39,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 161 transitions, 1451 flow [2024-11-10 10:20:39,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 161 transitions, 1303 flow, removed 53 selfloop flow, removed 10 redundant places. [2024-11-10 10:20:39,865 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 649 flow [2024-11-10 10:20:39,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=649, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2024-11-10 10:20:39,866 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 48 predicate places. [2024-11-10 10:20:39,866 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 649 flow [2024-11-10 10:20:39,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.076923076923077) internal successors, (118), 13 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:20:39,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:39,867 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:39,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 10:20:39,867 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:39,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:39,867 INFO L85 PathProgramCache]: Analyzing trace with hash 218062104, now seen corresponding path program 6 times [2024-11-10 10:20:39,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:39,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266655867] [2024-11-10 10:20:39,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:41,363 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-10 10:20:41,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:41,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266655867] [2024-11-10 10:20:41,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266655867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:41,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:41,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 10:20:41,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901968504] [2024-11-10 10:20:41,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:41,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:20:41,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:41,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:20:41,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:20:41,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:41,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 649 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-10 10:20:41,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:41,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:41,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:42,433 INFO L124 PetriNetUnfolderBase]: 3277/5127 cut-off events. [2024-11-10 10:20:42,433 INFO L125 PetriNetUnfolderBase]: For 13718/13718 co-relation queries the response was YES. [2024-11-10 10:20:42,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17054 conditions, 5127 events. 3277/5127 cut-off events. For 13718/13718 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 27529 event pairs, 664 based on Foata normal form. 8/5133 useless extension candidates. Maximal degree in co-relation 17019. Up to 1383 conditions per place. [2024-11-10 10:20:42,459 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 152 selfloop transitions, 43 changer transitions 57/256 dead transitions. [2024-11-10 10:20:42,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 256 transitions, 2026 flow [2024-11-10 10:20:42,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 10:20:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-10 10:20:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 289 transitions. [2024-11-10 10:20:42,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4405487804878049 [2024-11-10 10:20:42,462 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 649 flow. Second operand 16 states and 289 transitions. [2024-11-10 10:20:42,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 256 transitions, 2026 flow [2024-11-10 10:20:42,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 256 transitions, 1935 flow, removed 33 selfloop flow, removed 10 redundant places. [2024-11-10 10:20:42,490 INFO L231 Difference]: Finished difference. Result has 102 places, 90 transitions, 881 flow [2024-11-10 10:20:42,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=881, PETRI_PLACES=102, PETRI_TRANSITIONS=90} [2024-11-10 10:20:42,491 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 55 predicate places. [2024-11-10 10:20:42,491 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 90 transitions, 881 flow [2024-11-10 10:20:42,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-10 10:20:42,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:42,492 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:42,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 10:20:42,492 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:42,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2131309084, now seen corresponding path program 7 times [2024-11-10 10:20:42,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:42,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605458285] [2024-11-10 10:20:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:42,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:43,219 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-10 10:20:43,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:43,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605458285] [2024-11-10 10:20:43,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605458285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:43,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:20:43,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954359063] [2024-11-10 10:20:43,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:43,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 10:20:43,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 10:20:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 10:20:43,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:43,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 90 transitions, 881 flow. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:20:43,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:43,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:43,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:43,848 INFO L124 PetriNetUnfolderBase]: 2661/4184 cut-off events. [2024-11-10 10:20:43,848 INFO L125 PetriNetUnfolderBase]: For 13738/13738 co-relation queries the response was YES. [2024-11-10 10:20:43,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14932 conditions, 4184 events. 2661/4184 cut-off events. For 13738/13738 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 21470 event pairs, 547 based on Foata normal form. 16/4197 useless extension candidates. Maximal degree in co-relation 14896. Up to 1936 conditions per place. [2024-11-10 10:20:43,867 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 73 selfloop transitions, 20 changer transitions 45/142 dead transitions. [2024-11-10 10:20:43,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 142 transitions, 1397 flow [2024-11-10 10:20:43,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:20:43,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:20:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-11-10 10:20:43,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4054878048780488 [2024-11-10 10:20:43,869 INFO L175 Difference]: Start difference. First operand has 102 places, 90 transitions, 881 flow. Second operand 8 states and 133 transitions. [2024-11-10 10:20:43,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 142 transitions, 1397 flow [2024-11-10 10:20:43,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 142 transitions, 1256 flow, removed 58 selfloop flow, removed 9 redundant places. [2024-11-10 10:20:43,906 INFO L231 Difference]: Finished difference. Result has 102 places, 80 transitions, 729 flow [2024-11-10 10:20:43,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=729, PETRI_PLACES=102, PETRI_TRANSITIONS=80} [2024-11-10 10:20:43,906 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 55 predicate places. [2024-11-10 10:20:43,907 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 80 transitions, 729 flow [2024-11-10 10:20:43,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:20:43,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:43,907 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:43,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 10:20:43,907 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:43,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash 561722308, now seen corresponding path program 8 times [2024-11-10 10:20:43,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:43,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776951840] [2024-11-10 10:20:43,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:43,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:45,058 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-10 10:20:45,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:45,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776951840] [2024-11-10 10:20:45,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776951840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:45,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:45,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 10:20:45,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634907033] [2024-11-10 10:20:45,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:45,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 10:20:45,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:45,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 10:20:45,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-10 10:20:45,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:45,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 80 transitions, 729 flow. Second operand has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-10 10:20:45,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:45,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:45,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:45,784 INFO L124 PetriNetUnfolderBase]: 1565/2459 cut-off events. [2024-11-10 10:20:45,785 INFO L125 PetriNetUnfolderBase]: For 9962/9962 co-relation queries the response was YES. [2024-11-10 10:20:45,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9086 conditions, 2459 events. 1565/2459 cut-off events. For 9962/9962 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 11152 event pairs, 508 based on Foata normal form. 8/2465 useless extension candidates. Maximal degree in co-relation 9051. Up to 1641 conditions per place. [2024-11-10 10:20:45,797 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 82 selfloop transitions, 14 changer transitions 36/136 dead transitions. [2024-11-10 10:20:45,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 136 transitions, 1180 flow [2024-11-10 10:20:45,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:20:45,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:20:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 180 transitions. [2024-11-10 10:20:45,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-11-10 10:20:45,798 INFO L175 Difference]: Start difference. First operand has 102 places, 80 transitions, 729 flow. Second operand 12 states and 180 transitions. [2024-11-10 10:20:45,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 136 transitions, 1180 flow [2024-11-10 10:20:45,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 136 transitions, 1092 flow, removed 31 selfloop flow, removed 7 redundant places. [2024-11-10 10:20:45,810 INFO L231 Difference]: Finished difference. Result has 107 places, 73 transitions, 626 flow [2024-11-10 10:20:45,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=626, PETRI_PLACES=107, PETRI_TRANSITIONS=73} [2024-11-10 10:20:45,811 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 60 predicate places. [2024-11-10 10:20:45,811 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 73 transitions, 626 flow [2024-11-10 10:20:45,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.454545454545455) internal successors, (104), 11 states have internal predecessors, (104), 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-10 10:20:45,811 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:45,811 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:45,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 10:20:45,811 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:45,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:45,812 INFO L85 PathProgramCache]: Analyzing trace with hash 871037642, now seen corresponding path program 9 times [2024-11-10 10:20:45,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:45,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150216243] [2024-11-10 10:20:45,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:47,711 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-10 10:20:47,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:47,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150216243] [2024-11-10 10:20:47,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150216243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:47,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:47,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 10:20:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791768212] [2024-11-10 10:20:47,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:47,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:20:47,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:20:47,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:20:47,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:47,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 73 transitions, 626 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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-10 10:20:47,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:47,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:47,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:48,412 INFO L124 PetriNetUnfolderBase]: 2001/3125 cut-off events. [2024-11-10 10:20:48,412 INFO L125 PetriNetUnfolderBase]: For 9894/9894 co-relation queries the response was YES. [2024-11-10 10:20:48,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11068 conditions, 3125 events. 2001/3125 cut-off events. For 9894/9894 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15145 event pairs, 500 based on Foata normal form. 8/3132 useless extension candidates. Maximal degree in co-relation 11033. Up to 1483 conditions per place. [2024-11-10 10:20:48,425 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 75 selfloop transitions, 14 changer transitions 45/138 dead transitions. [2024-11-10 10:20:48,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 138 transitions, 1199 flow [2024-11-10 10:20:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:20:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 10:20:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2024-11-10 10:20:48,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38802660753880264 [2024-11-10 10:20:48,427 INFO L175 Difference]: Start difference. First operand has 107 places, 73 transitions, 626 flow. Second operand 11 states and 175 transitions. [2024-11-10 10:20:48,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 138 transitions, 1199 flow [2024-11-10 10:20:48,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 138 transitions, 1093 flow, removed 16 selfloop flow, removed 15 redundant places. [2024-11-10 10:20:48,446 INFO L231 Difference]: Finished difference. Result has 96 places, 68 transitions, 542 flow [2024-11-10 10:20:48,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=542, PETRI_PLACES=96, PETRI_TRANSITIONS=68} [2024-11-10 10:20:48,447 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 49 predicate places. [2024-11-10 10:20:48,447 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 68 transitions, 542 flow [2024-11-10 10:20:48,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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-10 10:20:48,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:48,448 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:48,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 10:20:48,448 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:48,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash -381716152, now seen corresponding path program 10 times [2024-11-10 10:20:48,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:48,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811726839] [2024-11-10 10:20:48,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:48,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:48,962 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-10 10:20:48,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:48,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811726839] [2024-11-10 10:20:48,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811726839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:48,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:48,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:20:48,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283829913] [2024-11-10 10:20:48,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:48,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:20:48,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:48,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:20:48,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:20:48,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:48,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 68 transitions, 542 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-10 10:20:48,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:48,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:48,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:49,402 INFO L124 PetriNetUnfolderBase]: 1788/2810 cut-off events. [2024-11-10 10:20:49,402 INFO L125 PetriNetUnfolderBase]: For 6136/6136 co-relation queries the response was YES. [2024-11-10 10:20:49,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9400 conditions, 2810 events. 1788/2810 cut-off events. For 6136/6136 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13350 event pairs, 344 based on Foata normal form. 8/2817 useless extension candidates. Maximal degree in co-relation 9369. Up to 1485 conditions per place. [2024-11-10 10:20:49,412 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 66 selfloop transitions, 16 changer transitions 22/108 dead transitions. [2024-11-10 10:20:49,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 108 transitions, 912 flow [2024-11-10 10:20:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:20:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:20:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-11-10 10:20:49,413 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-11-10 10:20:49,413 INFO L175 Difference]: Start difference. First operand has 96 places, 68 transitions, 542 flow. Second operand 8 states and 127 transitions. [2024-11-10 10:20:49,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 108 transitions, 912 flow [2024-11-10 10:20:49,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 108 transitions, 833 flow, removed 13 selfloop flow, removed 11 redundant places. [2024-11-10 10:20:49,421 INFO L231 Difference]: Finished difference. Result has 90 places, 67 transitions, 513 flow [2024-11-10 10:20:49,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=513, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2024-11-10 10:20:49,422 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2024-11-10 10:20:49,422 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 513 flow [2024-11-10 10:20:49,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-10 10:20:49,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:49,422 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:49,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 10:20:49,422 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:49,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:49,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1480424680, now seen corresponding path program 11 times [2024-11-10 10:20:49,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:49,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026515579] [2024-11-10 10:20:49,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:49,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:50,530 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-10 10:20:50,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:50,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026515579] [2024-11-10 10:20:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026515579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:50,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:50,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 10:20:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311576351] [2024-11-10 10:20:50,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:50,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:20:50,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:20:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:20:50,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:50,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 67 transitions, 513 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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-10 10:20:50,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:50,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:50,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:51,266 INFO L124 PetriNetUnfolderBase]: 1565/2457 cut-off events. [2024-11-10 10:20:51,267 INFO L125 PetriNetUnfolderBase]: For 4616/4616 co-relation queries the response was YES. [2024-11-10 10:20:51,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8294 conditions, 2457 events. 1565/2457 cut-off events. For 4616/4616 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11273 event pairs, 252 based on Foata normal form. 8/2464 useless extension candidates. Maximal degree in co-relation 8267. Up to 1363 conditions per place. [2024-11-10 10:20:51,277 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 95 selfloop transitions, 24 changer transitions 23/146 dead transitions. [2024-11-10 10:20:51,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 146 transitions, 1071 flow [2024-11-10 10:20:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 10:20:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-10 10:20:51,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 212 transitions. [2024-11-10 10:20:51,278 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3693379790940767 [2024-11-10 10:20:51,278 INFO L175 Difference]: Start difference. First operand has 90 places, 67 transitions, 513 flow. Second operand 14 states and 212 transitions. [2024-11-10 10:20:51,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 146 transitions, 1071 flow [2024-11-10 10:20:51,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 146 transitions, 1014 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-11-10 10:20:51,288 INFO L231 Difference]: Finished difference. Result has 96 places, 66 transitions, 511 flow [2024-11-10 10:20:51,288 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=511, PETRI_PLACES=96, PETRI_TRANSITIONS=66} [2024-11-10 10:20:51,288 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 49 predicate places. [2024-11-10 10:20:51,288 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 66 transitions, 511 flow [2024-11-10 10:20:51,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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-10 10:20:51,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:51,289 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:51,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 10:20:51,289 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:51,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:51,289 INFO L85 PathProgramCache]: Analyzing trace with hash -299908406, now seen corresponding path program 12 times [2024-11-10 10:20:51,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:51,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982640005] [2024-11-10 10:20:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:51,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:51,852 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-10 10:20:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:51,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982640005] [2024-11-10 10:20:51,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982640005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:51,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:51,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 10:20:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211660461] [2024-11-10 10:20:51,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:51,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:20:51,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:51,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:20:51,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:20:51,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:51,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 66 transitions, 511 flow. Second operand has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-10 10:20:51,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:51,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:51,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:52,376 INFO L124 PetriNetUnfolderBase]: 1773/2785 cut-off events. [2024-11-10 10:20:52,376 INFO L125 PetriNetUnfolderBase]: For 5424/5424 co-relation queries the response was YES. [2024-11-10 10:20:52,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9090 conditions, 2785 events. 1773/2785 cut-off events. For 5424/5424 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13215 event pairs, 368 based on Foata normal form. 8/2792 useless extension candidates. Maximal degree in co-relation 9063. Up to 1085 conditions per place. [2024-11-10 10:20:52,388 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 66 selfloop transitions, 12 changer transitions 33/115 dead transitions. [2024-11-10 10:20:52,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 115 transitions, 906 flow [2024-11-10 10:20:52,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:20:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:20:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-11-10 10:20:52,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-11-10 10:20:52,389 INFO L175 Difference]: Start difference. First operand has 96 places, 66 transitions, 511 flow. Second operand 9 states and 142 transitions. [2024-11-10 10:20:52,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 115 transitions, 906 flow [2024-11-10 10:20:52,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 115 transitions, 822 flow, removed 15 selfloop flow, removed 13 redundant places. [2024-11-10 10:20:52,400 INFO L231 Difference]: Finished difference. Result has 92 places, 63 transitions, 427 flow [2024-11-10 10:20:52,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=427, PETRI_PLACES=92, PETRI_TRANSITIONS=63} [2024-11-10 10:20:52,400 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places. [2024-11-10 10:20:52,401 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 63 transitions, 427 flow [2024-11-10 10:20:52,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.0) internal successors, (90), 9 states have internal predecessors, (90), 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-10 10:20:52,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:52,401 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:52,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 10:20:52,401 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:52,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1522092670, now seen corresponding path program 13 times [2024-11-10 10:20:52,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:52,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242488366] [2024-11-10 10:20:52,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:52,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:52,725 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-10 10:20:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:52,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242488366] [2024-11-10 10:20:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242488366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:52,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 10:20:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535715589] [2024-11-10 10:20:52,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:52,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 10:20:52,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:52,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 10:20:52,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 10:20:52,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:52,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 63 transitions, 427 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-10 10:20:52,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:52,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:52,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:53,078 INFO L124 PetriNetUnfolderBase]: 1489/2337 cut-off events. [2024-11-10 10:20:53,078 INFO L125 PetriNetUnfolderBase]: For 4308/4308 co-relation queries the response was YES. [2024-11-10 10:20:53,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7582 conditions, 2337 events. 1489/2337 cut-off events. For 4308/4308 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10608 event pairs, 943 based on Foata normal form. 8/2344 useless extension candidates. Maximal degree in co-relation 7557. Up to 1651 conditions per place. [2024-11-10 10:20:53,085 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 52 selfloop transitions, 3 changer transitions 39/98 dead transitions. [2024-11-10 10:20:53,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 98 transitions, 742 flow [2024-11-10 10:20:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 10:20:53,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 10:20:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-11-10 10:20:53,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-11-10 10:20:53,086 INFO L175 Difference]: Start difference. First operand has 92 places, 63 transitions, 427 flow. Second operand 7 states and 114 transitions. [2024-11-10 10:20:53,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 98 transitions, 742 flow [2024-11-10 10:20:53,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 98 transitions, 702 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-11-10 10:20:53,091 INFO L231 Difference]: Finished difference. Result has 89 places, 56 transitions, 332 flow [2024-11-10 10:20:53,091 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=332, PETRI_PLACES=89, PETRI_TRANSITIONS=56} [2024-11-10 10:20:53,092 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 42 predicate places. [2024-11-10 10:20:53,092 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 56 transitions, 332 flow [2024-11-10 10:20:53,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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-10 10:20:53,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:53,092 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:53,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 10:20:53,092 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:53,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:53,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1381038542, now seen corresponding path program 14 times [2024-11-10 10:20:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:53,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426806954] [2024-11-10 10:20:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:53,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:20:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426806954] [2024-11-10 10:20:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426806954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:54,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:54,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 10:20:54,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128369718] [2024-11-10 10:20:54,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:54,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:20:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:54,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:20:54,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:20:54,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:54,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 56 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 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-10 10:20:54,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:54,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:54,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:54,647 INFO L124 PetriNetUnfolderBase]: 1285/2029 cut-off events. [2024-11-10 10:20:54,647 INFO L125 PetriNetUnfolderBase]: For 2731/2731 co-relation queries the response was YES. [2024-11-10 10:20:54,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6225 conditions, 2029 events. 1285/2029 cut-off events. For 2731/2731 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8988 event pairs, 316 based on Foata normal form. 8/2036 useless extension candidates. Maximal degree in co-relation 6201. Up to 951 conditions per place. [2024-11-10 10:20:54,658 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 72 selfloop transitions, 13 changer transitions 33/122 dead transitions. [2024-11-10 10:20:54,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 122 transitions, 796 flow [2024-11-10 10:20:54,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 10:20:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 10:20:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2024-11-10 10:20:54,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38137472283813745 [2024-11-10 10:20:54,660 INFO L175 Difference]: Start difference. First operand has 89 places, 56 transitions, 332 flow. Second operand 11 states and 172 transitions. [2024-11-10 10:20:54,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 122 transitions, 796 flow [2024-11-10 10:20:54,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 122 transitions, 751 flow, removed 12 selfloop flow, removed 10 redundant places. [2024-11-10 10:20:54,666 INFO L231 Difference]: Finished difference. Result has 85 places, 53 transitions, 312 flow [2024-11-10 10:20:54,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=312, PETRI_PLACES=85, PETRI_TRANSITIONS=53} [2024-11-10 10:20:54,667 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 38 predicate places. [2024-11-10 10:20:54,667 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 53 transitions, 312 flow [2024-11-10 10:20:54,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 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-10 10:20:54,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:54,668 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:54,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 10:20:54,668 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:54,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash -142499030, now seen corresponding path program 15 times [2024-11-10 10:20:54,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:54,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987191153] [2024-11-10 10:20:54,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:54,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:55,346 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-10 10:20:55,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:55,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987191153] [2024-11-10 10:20:55,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987191153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:55,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:55,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 10:20:55,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446123870] [2024-11-10 10:20:55,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:55,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:20:55,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:55,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:20:55,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:20:55,350 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:55,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 53 transitions, 312 flow. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 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-10 10:20:55,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:55,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:55,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:55,905 INFO L124 PetriNetUnfolderBase]: 972/1550 cut-off events. [2024-11-10 10:20:55,905 INFO L125 PetriNetUnfolderBase]: For 2374/2374 co-relation queries the response was YES. [2024-11-10 10:20:55,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5019 conditions, 1550 events. 972/1550 cut-off events. For 2374/2374 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6316 event pairs, 326 based on Foata normal form. 8/1557 useless extension candidates. Maximal degree in co-relation 4995. Up to 903 conditions per place. [2024-11-10 10:20:55,911 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 42 selfloop transitions, 5 changer transitions 55/106 dead transitions. [2024-11-10 10:20:55,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 106 transitions, 702 flow [2024-11-10 10:20:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:20:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:20:55,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 165 transitions. [2024-11-10 10:20:55,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3353658536585366 [2024-11-10 10:20:55,912 INFO L175 Difference]: Start difference. First operand has 85 places, 53 transitions, 312 flow. Second operand 12 states and 165 transitions. [2024-11-10 10:20:55,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 106 transitions, 702 flow [2024-11-10 10:20:55,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 106 transitions, 588 flow, removed 26 selfloop flow, removed 15 redundant places. [2024-11-10 10:20:55,918 INFO L231 Difference]: Finished difference. Result has 81 places, 48 transitions, 205 flow [2024-11-10 10:20:55,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=205, PETRI_PLACES=81, PETRI_TRANSITIONS=48} [2024-11-10 10:20:55,919 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2024-11-10 10:20:55,919 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 48 transitions, 205 flow [2024-11-10 10:20:55,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 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-10 10:20:55,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:55,919 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:55,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 10:20:55,919 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:55,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:55,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1616868582, now seen corresponding path program 16 times [2024-11-10 10:20:55,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:55,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923604703] [2024-11-10 10:20:55,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:55,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:20:57,538 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-10 10:20:57,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:20:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923604703] [2024-11-10 10:20:57,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923604703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:20:57,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:20:57,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 10:20:57,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378693870] [2024-11-10 10:20:57,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:20:57,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 10:20:57,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:20:57,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 10:20:57,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 10:20:57,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-11-10 10:20:57,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 48 transitions, 205 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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-10 10:20:57,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:20:57,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-11-10 10:20:57,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:20:58,036 INFO L124 PetriNetUnfolderBase]: 806/1288 cut-off events. [2024-11-10 10:20:58,037 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2024-11-10 10:20:58,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3422 conditions, 1288 events. 806/1288 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5079 event pairs, 144 based on Foata normal form. 8/1295 useless extension candidates. Maximal degree in co-relation 3403. Up to 594 conditions per place. [2024-11-10 10:20:58,041 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 46 selfloop transitions, 4 changer transitions 34/88 dead transitions. [2024-11-10 10:20:58,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 88 transitions, 495 flow [2024-11-10 10:20:58,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:20:58,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:20:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2024-11-10 10:20:58,042 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35772357723577236 [2024-11-10 10:20:58,042 INFO L175 Difference]: Start difference. First operand has 81 places, 48 transitions, 205 flow. Second operand 9 states and 132 transitions. [2024-11-10 10:20:58,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 88 transitions, 495 flow [2024-11-10 10:20:58,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 88 transitions, 454 flow, removed 8 selfloop flow, removed 12 redundant places. [2024-11-10 10:20:58,045 INFO L231 Difference]: Finished difference. Result has 69 places, 40 transitions, 141 flow [2024-11-10 10:20:58,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=141, PETRI_PLACES=69, PETRI_TRANSITIONS=40} [2024-11-10 10:20:58,046 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2024-11-10 10:20:58,046 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 40 transitions, 141 flow [2024-11-10 10:20:58,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 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-10 10:20:58,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:20:58,047 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:58,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 10:20:58,047 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 10:20:58,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:20:58,047 INFO L85 PathProgramCache]: Analyzing trace with hash -652061574, now seen corresponding path program 17 times [2024-11-10 10:20:58,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:20:58,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54501601] [2024-11-10 10:20:58,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:20:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:20:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:58,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 10:20:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 10:20:58,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 10:20:58,250 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 10:20:58,252 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-11-10 10:20:58,254 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-11-10 10:20:58,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-11-10 10:20:58,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-11-10 10:20:58,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-11-10 10:20:58,255 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-11-10 10:20:58,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 10:20:58,256 INFO L407 BasicCegarLoop]: Path program histogram: [17, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:20:58,345 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:20:58,345 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:20:58,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:20:58 BasicIcfg [2024-11-10 10:20:58,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:20:58,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:20:58,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:20:58,353 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:20:58,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:20:03" (3/4) ... [2024-11-10 10:20:58,355 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 10:20:58,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:20:58,453 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:20:58,453 INFO L158 Benchmark]: Toolchain (without parser) took 56525.61ms. Allocated memory was 165.7MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 114.8MB in the beginning and 659.6MB in the end (delta: -544.9MB). Peak memory consumption was 978.1MB. Max. memory is 16.1GB. [2024-11-10 10:20:58,454 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 165.7MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:20:58,454 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.61ms. Allocated memory is still 165.7MB. Free memory was 114.4MB in the beginning and 85.8MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 10:20:58,454 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.55ms. Allocated memory is still 165.7MB. Free memory was 85.8MB in the beginning and 82.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:20:58,454 INFO L158 Benchmark]: Boogie Preprocessor took 71.99ms. Allocated memory is still 165.7MB. Free memory was 82.8MB in the beginning and 78.1MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 10:20:58,454 INFO L158 Benchmark]: IcfgBuilder took 939.37ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 78.1MB in the beginning and 135.1MB in the end (delta: -56.9MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. [2024-11-10 10:20:58,455 INFO L158 Benchmark]: TraceAbstraction took 54675.03ms. Allocated memory was 222.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 134.0MB in the beginning and 672.2MB in the end (delta: -538.2MB). Peak memory consumption was 926.7MB. Max. memory is 16.1GB. [2024-11-10 10:20:58,455 INFO L158 Benchmark]: Witness Printer took 100.11ms. Allocated memory is still 1.7GB. Free memory was 672.2MB in the beginning and 659.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 10:20:58,456 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.19ms. Allocated memory is still 165.7MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.61ms. Allocated memory is still 165.7MB. Free memory was 114.4MB in the beginning and 85.8MB in the end (delta: 28.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.55ms. Allocated memory is still 165.7MB. Free memory was 85.8MB in the beginning and 82.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.99ms. Allocated memory is still 165.7MB. Free memory was 82.8MB in the beginning and 78.1MB in the end (delta: 4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 939.37ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 78.1MB in the beginning and 135.1MB in the end (delta: -56.9MB). Peak memory consumption was 36.7MB. Max. memory is 16.1GB. * TraceAbstraction took 54675.03ms. Allocated memory was 222.3MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 134.0MB in the beginning and 672.2MB in the end (delta: -538.2MB). Peak memory consumption was 926.7MB. Max. memory is 16.1GB. * Witness Printer took 100.11ms. Allocated memory is still 1.7GB. Free memory was 672.2MB in the beginning and 659.6MB 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: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L742] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L772] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-3, t2538=-2, t2539=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 19]: 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: 850]: 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: 854]: 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: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 68 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 54.5s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2323 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2317 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 489 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7936 IncrementalHoareTripleChecker+Invalid, 8425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 489 mSolverCounterUnsat, 1 mSDtfsCounter, 7936 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=881occurred in iteration=16, InterpolantAutomatonStates: 243, 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, 1.4s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 730 NumberOfCodeBlocks, 730 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 673 ConstructedInterpolants, 0 QuantifiedInterpolants, 8061 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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-10 10:20:58,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE