./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c -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 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:12:44,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:12:44,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:12:44,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:12:44,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:12:44,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:12:44,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:12:44,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:12:44,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:12:44,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:12:44,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:12:44,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:12:44,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:12:44,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:12:44,948 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:12:44,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:12:44,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:12:44,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:12:44,949 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:12:44,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:12:44,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:12:44,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:12:44,950 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:12:44,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:12:44,964 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:12:44,964 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:12:44,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:12:44,965 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:12:44,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:12:44,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:12:44,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:12:44,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:12:44,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:12:44,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:12:44,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:12:44,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:12:44,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:12:44,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:12:44,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:12:44,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:12:44,968 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:12:44,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:12:44,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:12:44,968 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 -> 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 [2024-06-27 17:12:45,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:12:45,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:12:45,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:12:45,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:12:45,263 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:12:45,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2024-06-27 17:12:46,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:12:46,612 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:12:46,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2024-06-27 17:12:46,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e0c800a/caec4d2261614719bf195167df57b048/FLAG83166fce9 [2024-06-27 17:12:46,627 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80e0c800a/caec4d2261614719bf195167df57b048 [2024-06-27 17:12:46,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:12:46,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:12:46,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:12:46,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:12:46,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:12:46,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d337e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46, skipping insertion in model container [2024-06-27 17:12:46,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,671 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:12:46,825 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[3001,3014] [2024-06-27 17:12:46,833 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:12:46,839 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:12:46,857 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[3001,3014] [2024-06-27 17:12:46,859 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:12:46,870 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:12:46,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46 WrapperNode [2024-06-27 17:12:46,871 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:12:46,872 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:12:46,872 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:12:46,872 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:12:46,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,904 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 197 [2024-06-27 17:12:46,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:12:46,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:12:46,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:12:46,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:12:46,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,933 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 17:12:46,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,945 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,954 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:12:46,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:12:46,955 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:12:46,955 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:12:46,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (1/1) ... [2024-06-27 17:12:46,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:12:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:12:47,000 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-06-27 17:12:47,020 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-06-27 17:12:47,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:12:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:12:47,049 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:12:47,049 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:12:47,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:12:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:12:47,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:12:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:12:47,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:12:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:12:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:12:47,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:12:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:12:47,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:12:47,054 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:12:47,160 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:12:47,162 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:12:47,476 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:12:47,477 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:12:47,772 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:12:47,772 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-06-27 17:12:47,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:12:47 BoogieIcfgContainer [2024-06-27 17:12:47,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:12:47,774 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:12:47,774 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:12:47,777 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:12:47,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:12:46" (1/3) ... [2024-06-27 17:12:47,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dad762b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:12:47, skipping insertion in model container [2024-06-27 17:12:47,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:12:46" (2/3) ... [2024-06-27 17:12:47,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dad762b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:12:47, skipping insertion in model container [2024-06-27 17:12:47,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:12:47" (3/3) ... [2024-06-27 17:12:47,779 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2024-06-27 17:12:47,784 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:12:47,791 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:12:47,791 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:12:47,791 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:12:47,825 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:12:47,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:12:47,876 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2024-06-27 17:12:47,877 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:12:47,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-06-27 17:12:47,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:12:47,882 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2024-06-27 17:12:47,897 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:12:47,903 INFO L357 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, mHoare=true, 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;@177a3e50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:12:47,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 17:12:47,914 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:12:47,915 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2024-06-27 17:12:47,915 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:12:47,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:12:47,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:12:47,916 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:12:47,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:12:47,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1262935038, now seen corresponding path program 1 times [2024-06-27 17:12:47,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:12:47,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144025616] [2024-06-27 17:12:47,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:12:47,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:12:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:12:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:12:48,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:12:48,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144025616] [2024-06-27 17:12:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144025616] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:12:48,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:12:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:12:48,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710417999] [2024-06-27 17:12:48,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:12:48,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:12:48,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:12:48,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:12:48,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:12:48,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:12:48,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-06-27 17:12:48,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:12:48,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:12:48,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:12:49,482 INFO L124 PetriNetUnfolderBase]: 38/71 cut-off events. [2024-06-27 17:12:49,482 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-06-27 17:12:49,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 71 events. 38/71 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2024-06-27 17:12:49,484 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2024-06-27 17:12:49,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 82 flow [2024-06-27 17:12:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:12:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:12:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2024-06-27 17:12:49,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 17:12:49,504 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 27 transitions. [2024-06-27 17:12:49,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 82 flow [2024-06-27 17:12:49,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:12:49,509 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2024-06-27 17:12:49,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2024-06-27 17:12:49,513 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2024-06-27 17:12:49,513 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 50 flow [2024-06-27 17:12:49,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-06-27 17:12:49,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:12:49,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:12:49,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:12:49,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:12:49,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:12:49,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1397603888, now seen corresponding path program 1 times [2024-06-27 17:12:49,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:12:49,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894629269] [2024-06-27 17:12:49,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:12:49,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:12:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:12:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:12:49,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:12:49,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894629269] [2024-06-27 17:12:49,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894629269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:12:49,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:12:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:12:49,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734410627] [2024-06-27 17:12:49,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:12:49,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:12:49,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:12:49,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:12:49,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:12:49,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:12:49,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:49,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:12:49,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:12:49,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:12:49,865 INFO L124 PetriNetUnfolderBase]: 65/123 cut-off events. [2024-06-27 17:12:49,865 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:12:49,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 123 events. 65/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 320 event pairs, 22 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 248. Up to 71 conditions per place. [2024-06-27 17:12:49,868 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2024-06-27 17:12:49,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 38 transitions, 169 flow [2024-06-27 17:12:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:12:49,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:12:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2024-06-27 17:12:49,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-27 17:12:49,871 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 50 flow. Second operand 5 states and 52 transitions. [2024-06-27 17:12:49,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 38 transitions, 169 flow [2024-06-27 17:12:49,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 38 transitions, 165 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:12:49,873 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 82 flow [2024-06-27 17:12:49,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2024-06-27 17:12:49,874 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2024-06-27 17:12:49,874 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 82 flow [2024-06-27 17:12:49,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:49,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:12:49,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:12:49,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:12:49,876 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:12:49,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:12:49,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1894712742, now seen corresponding path program 2 times [2024-06-27 17:12:49,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:12:49,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040696447] [2024-06-27 17:12:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:12:49,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:12:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:12:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:12:50,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:12:50,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040696447] [2024-06-27 17:12:50,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040696447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:12:50,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:12:50,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:12:50,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633564486] [2024-06-27 17:12:50,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:12:50,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:12:50,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:12:50,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:12:50,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:12:50,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:12:50,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:50,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:12:50,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:12:50,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:12:50,526 INFO L124 PetriNetUnfolderBase]: 100/190 cut-off events. [2024-06-27 17:12:50,526 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-06-27 17:12:50,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 190 events. 100/190 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 596 event pairs, 39 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 531. Up to 120 conditions per place. [2024-06-27 17:12:50,528 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 34 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-27 17:12:50,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 242 flow [2024-06-27 17:12:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:12:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:12:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2024-06-27 17:12:50,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-06-27 17:12:50,531 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 82 flow. Second operand 5 states and 48 transitions. [2024-06-27 17:12:50,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 242 flow [2024-06-27 17:12:50,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 225 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 17:12:50,537 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 124 flow [2024-06-27 17:12:50,537 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-27 17:12:50,540 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2024-06-27 17:12:50,540 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 124 flow [2024-06-27 17:12:50,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:50,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:12:50,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:12:50,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:12:50,541 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:12:50,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:12:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash -487579236, now seen corresponding path program 3 times [2024-06-27 17:12:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:12:50,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586043199] [2024-06-27 17:12:50,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:12:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:12:50,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:12:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:12:50,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:12:50,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586043199] [2024-06-27 17:12:50,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586043199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:12:50,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:12:50,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:12:50,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153933298] [2024-06-27 17:12:50,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:12:50,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:12:50,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:12:50,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:12:50,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:12:50,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:12:50,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:50,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:12:50,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:12:50,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:12:51,349 INFO L124 PetriNetUnfolderBase]: 109/204 cut-off events. [2024-06-27 17:12:51,350 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2024-06-27 17:12:51,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 204 events. 109/204 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 655 event pairs, 39 based on Foata normal form. 3/182 useless extension candidates. Maximal degree in co-relation 689. Up to 111 conditions per place. [2024-06-27 17:12:51,355 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 33 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2024-06-27 17:12:51,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 307 flow [2024-06-27 17:12:51,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:12:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:12:51,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2024-06-27 17:12:51,358 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-27 17:12:51,358 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 124 flow. Second operand 5 states and 52 transitions. [2024-06-27 17:12:51,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 307 flow [2024-06-27 17:12:51,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 283 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-27 17:12:51,364 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 203 flow [2024-06-27 17:12:51,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-06-27 17:12:51,365 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2024-06-27 17:12:51,366 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 203 flow [2024-06-27 17:12:51,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:51,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:12:51,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:12:51,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:12:51,367 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:12:51,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:12:51,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1596196638, now seen corresponding path program 4 times [2024-06-27 17:12:51,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:12:51,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863184654] [2024-06-27 17:12:51,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:12:51,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:12:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:12:51,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:12:51,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:12:51,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863184654] [2024-06-27 17:12:51,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863184654] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:12:51,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:12:51,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:12:51,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411837092] [2024-06-27 17:12:51,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:12:51,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:12:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:12:51,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:12:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:12:51,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:12:51,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:51,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:12:51,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:12:51,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:12:51,659 INFO L124 PetriNetUnfolderBase]: 106/201 cut-off events. [2024-06-27 17:12:51,659 INFO L125 PetriNetUnfolderBase]: For 502/502 co-relation queries the response was YES. [2024-06-27 17:12:51,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 201 events. 106/201 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 634 event pairs, 46 based on Foata normal form. 3/179 useless extension candidates. Maximal degree in co-relation 752. Up to 160 conditions per place. [2024-06-27 17:12:51,660 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 29 selfloop transitions, 15 changer transitions 0/45 dead transitions. [2024-06-27 17:12:51,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 365 flow [2024-06-27 17:12:51,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:12:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:12:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-06-27 17:12:51,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-06-27 17:12:51,662 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 203 flow. Second operand 5 states and 47 transitions. [2024-06-27 17:12:51,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 365 flow [2024-06-27 17:12:51,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 352 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 17:12:51,666 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 296 flow [2024-06-27 17:12:51,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-06-27 17:12:51,668 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2024-06-27 17:12:51,669 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 296 flow [2024-06-27 17:12:51,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:51,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:12:51,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:12:51,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:12:51,673 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:12:51,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:12:51,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1325705610, now seen corresponding path program 5 times [2024-06-27 17:12:51,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:12:51,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863816068] [2024-06-27 17:12:51,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:12:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:12:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:12:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:12:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:12:51,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863816068] [2024-06-27 17:12:51,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863816068] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:12:51,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:12:51,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:12:51,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712089571] [2024-06-27 17:12:51,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:12:51,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:12:51,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:12:51,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:12:51,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:12:51,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:12:51,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:51,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:12:51,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:12:51,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:12:52,063 INFO L124 PetriNetUnfolderBase]: 107/204 cut-off events. [2024-06-27 17:12:52,063 INFO L125 PetriNetUnfolderBase]: For 641/641 co-relation queries the response was YES. [2024-06-27 17:12:52,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 204 events. 107/204 cut-off events. For 641/641 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 663 event pairs, 34 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 852. Up to 113 conditions per place. [2024-06-27 17:12:52,065 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 35 selfloop transitions, 14 changer transitions 0/50 dead transitions. [2024-06-27 17:12:52,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 432 flow [2024-06-27 17:12:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:12:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:12:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2024-06-27 17:12:52,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2024-06-27 17:12:52,066 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 296 flow. Second operand 5 states and 51 transitions. [2024-06-27 17:12:52,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 432 flow [2024-06-27 17:12:52,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 378 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-27 17:12:52,069 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 282 flow [2024-06-27 17:12:52,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-27 17:12:52,070 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2024-06-27 17:12:52,070 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 282 flow [2024-06-27 17:12:52,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:52,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:12:52,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:12:52,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:12:52,071 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:12:52,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:12:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1540785378, now seen corresponding path program 6 times [2024-06-27 17:12:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:12:52,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136454500] [2024-06-27 17:12:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:12:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:12:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:12:52,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:12:52,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:12:52,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136454500] [2024-06-27 17:12:52,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136454500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:12:52,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:12:52,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:12:52,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496764041] [2024-06-27 17:12:52,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:12:52,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:12:52,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:12:52,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:12:52,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:12:52,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:12:52,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:52,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:12:52,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:12:52,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:12:52,302 INFO L124 PetriNetUnfolderBase]: 106/197 cut-off events. [2024-06-27 17:12:52,303 INFO L125 PetriNetUnfolderBase]: For 629/629 co-relation queries the response was YES. [2024-06-27 17:12:52,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 197 events. 106/197 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 620 event pairs, 45 based on Foata normal form. 2/174 useless extension candidates. Maximal degree in co-relation 798. Up to 154 conditions per place. [2024-06-27 17:12:52,304 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 31 selfloop transitions, 15 changer transitions 0/47 dead transitions. [2024-06-27 17:12:52,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 404 flow [2024-06-27 17:12:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:12:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:12:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-06-27 17:12:52,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-06-27 17:12:52,306 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 282 flow. Second operand 5 states and 47 transitions. [2024-06-27 17:12:52,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 404 flow [2024-06-27 17:12:52,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 370 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 17:12:52,308 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 294 flow [2024-06-27 17:12:52,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-06-27 17:12:52,309 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2024-06-27 17:12:52,309 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 294 flow [2024-06-27 17:12:52,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:12:52,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:12:52,310 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:12:52,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:12:52,310 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:12:52,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:12:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash 309146939, now seen corresponding path program 1 times [2024-06-27 17:12:52,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:12:52,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263656769] [2024-06-27 17:12:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:12:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:12:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:12:52,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:12:52,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:12:52,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263656769] [2024-06-27 17:12:52,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263656769] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:12:52,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849227293] [2024-06-27 17:12:52,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:12:52,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:12:52,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:12:52,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:12:52,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 17:12:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:12:52,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 32 conjunts are in the unsatisfiable core [2024-06-27 17:12:52,602 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:12:52,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-06-27 17:12:54,639 INFO L349 Elim1Store]: treesize reduction 297, result has 6.9 percent of original size [2024-06-27 17:12:54,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 435 treesize of output 287 [2024-06-27 17:12:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:12:59,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:13:23,561 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-06-27 17:13:27,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 596 treesize of output 522 [2024-06-27 17:13:28,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:13:28,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 20 new quantified variables, introduced 55 case distinctions, treesize of input 7635 treesize of output 4049 [2024-06-27 17:16:58,337 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2024-06-27 17:17:54,258 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-06-27 17:17:54,258 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 101 [2024-06-27 17:17:54,260 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 17:17:54,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 17:17:54,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:17:54,473 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-06-27 17:17:54,479 INFO L158 Benchmark]: Toolchain (without parser) took 307847.26ms. Allocated memory was 155.2MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 122.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-06-27 17:17:54,479 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 123.7MB. Free memory was 85.7MB in the beginning and 85.6MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:17:54,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.45ms. Allocated memory is still 155.2MB. Free memory was 121.5MB in the beginning and 108.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-27 17:17:54,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.17ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 106.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:17:54,480 INFO L158 Benchmark]: Boogie Preprocessor took 48.47ms. Allocated memory is still 155.2MB. Free memory was 106.0MB in the beginning and 103.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:17:54,480 INFO L158 Benchmark]: RCFGBuilder took 818.78ms. Allocated memory is still 155.2MB. Free memory was 103.3MB in the beginning and 83.0MB in the end (delta: 20.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-06-27 17:17:54,481 INFO L158 Benchmark]: TraceAbstraction took 306704.05ms. Allocated memory was 155.2MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 83.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-06-27 17:17:54,482 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.14ms. Allocated memory is still 123.7MB. Free memory was 85.7MB in the beginning and 85.6MB in the end (delta: 118.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.45ms. Allocated memory is still 155.2MB. Free memory was 121.5MB in the beginning and 108.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.17ms. Allocated memory is still 155.2MB. Free memory was 108.7MB in the beginning and 106.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.47ms. Allocated memory is still 155.2MB. Free memory was 106.0MB in the beginning and 103.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 818.78ms. Allocated memory is still 155.2MB. Free memory was 103.3MB in the beginning and 83.0MB in the end (delta: 20.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 306704.05ms. Allocated memory was 155.2MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 83.0MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:17:56,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:17:56,785 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 17:17:56,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:17:56,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:17:56,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:17:56,819 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:17:56,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:17:56,820 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:17:56,824 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:17:56,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:17:56,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:17:56,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:17:56,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:17:56,826 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:17:56,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:17:56,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:17:56,827 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:17:56,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:17:56,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:17:56,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:17:56,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:17:56,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:17:56,829 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 17:17:56,830 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 17:17:56,830 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:17:56,830 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 17:17:56,830 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:17:56,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:17:56,831 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:17:56,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:17:56,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:17:56,833 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:17:56,833 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:17:56,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:17:56,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:17:56,834 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:17:56,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:17:56,834 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 17:17:56,834 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 17:17:56,835 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:17:56,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:17:56,835 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:17:56,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:17:56,836 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:17:56,836 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 17:17:56,836 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 -> 052a68c73a5d1c6e7122fc0c660c02483f37277d0239d876d93b351fcdd64a16 [2024-06-27 17:17:57,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:17:57,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:17:57,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:17:57,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:17:57,164 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:17:57,165 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2024-06-27 17:17:58,420 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:17:58,626 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:17:58,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2024-06-27 17:17:58,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/face242da/750b66c96a844601b0e8b99fcd109155/FLAG5470dd10d [2024-06-27 17:17:58,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/face242da/750b66c96a844601b0e8b99fcd109155 [2024-06-27 17:17:58,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:17:58,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:17:58,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:17:58,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:17:58,664 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:17:58,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:17:58" (1/1) ... [2024-06-27 17:17:58,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457c14a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:58, skipping insertion in model container [2024-06-27 17:17:58,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:17:58" (1/1) ... [2024-06-27 17:17:58,689 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:17:58,879 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[3001,3014] [2024-06-27 17:17:58,893 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:17:58,912 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 17:17:58,919 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:17:58,949 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[3001,3014] [2024-06-27 17:17:58,953 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:17:58,957 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:17:58,990 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[3001,3014] [2024-06-27 17:17:58,996 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:17:59,013 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:17:59,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59 WrapperNode [2024-06-27 17:17:59,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:17:59,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:17:59,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:17:59,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:17:59,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,075 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 195 [2024-06-27 17:17:59,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:17:59,076 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:17:59,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:17:59,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:17:59,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,102 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-06-27 17:17:59,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,112 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:17:59,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:17:59,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:17:59,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:17:59,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (1/1) ... [2024-06-27 17:17:59,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:17:59,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:17:59,147 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-06-27 17:17:59,149 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-06-27 17:17:59,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:17:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:17:59,185 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:17:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:17:59,185 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:17:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 17:17:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 17:17:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:17:59,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 17:17:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 17:17:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:17:59,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:17:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 17:17:59,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 17:17:59,187 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:17:59,275 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:17:59,277 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:17:59,547 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:17:59,547 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:17:59,896 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:17:59,896 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-06-27 17:17:59,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:17:59 BoogieIcfgContainer [2024-06-27 17:17:59,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:17:59,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:17:59,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:17:59,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:17:59,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:17:58" (1/3) ... [2024-06-27 17:17:59,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d559ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:17:59, skipping insertion in model container [2024-06-27 17:17:59,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:17:59" (2/3) ... [2024-06-27 17:17:59,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d559ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:17:59, skipping insertion in model container [2024-06-27 17:17:59,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:17:59" (3/3) ... [2024-06-27 17:17:59,905 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2024-06-27 17:17:59,914 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:17:59,922 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:17:59,922 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:17:59,922 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:17:59,982 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:18:00,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:18:00,027 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2024-06-27 17:18:00,027 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:18:00,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2024-06-27 17:18:00,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2024-06-27 17:18:00,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2024-06-27 17:18:00,043 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:18:00,050 INFO L357 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, mHoare=true, 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;@1d2c3a93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:18:00,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-06-27 17:18:00,058 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:18:00,058 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2024-06-27 17:18:00,058 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:18:00,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:00,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:00,060 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:00,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:00,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1685700738, now seen corresponding path program 1 times [2024-06-27 17:18:00,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:00,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852624000] [2024-06-27 17:18:00,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:00,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:00,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:00,081 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:00,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-06-27 17:18:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:00,191 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:18:00,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:18:00,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:00,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:00,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852624000] [2024-06-27 17:18:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1852624000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:00,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:00,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:18:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908059756] [2024-06-27 17:18:00,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:00,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:18:00,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:00,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:18:00,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:18:00,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:00,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-06-27 17:18:00,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:00,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:00,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:00,375 INFO L124 PetriNetUnfolderBase]: 38/71 cut-off events. [2024-06-27 17:18:00,375 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-06-27 17:18:00,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 71 events. 38/71 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 121 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2024-06-27 17:18:00,377 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2024-06-27 17:18:00,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 82 flow [2024-06-27 17:18:00,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:18:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:18:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2024-06-27 17:18:00,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 17:18:00,388 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 27 transitions. [2024-06-27 17:18:00,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 82 flow [2024-06-27 17:18:00,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:18:00,392 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2024-06-27 17:18:00,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2024-06-27 17:18:00,397 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2024-06-27 17:18:00,397 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 50 flow [2024-06-27 17:18:00,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-06-27 17:18:00,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:00,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:00,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:00,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:00,601 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:00,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:00,602 INFO L85 PathProgramCache]: Analyzing trace with hash -184208052, now seen corresponding path program 1 times [2024-06-27 17:18:00,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:00,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176621918] [2024-06-27 17:18:00,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:00,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:00,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:00,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:00,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-06-27 17:18:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:00,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 17:18:00,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:00,747 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:00,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:00,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176621918] [2024-06-27 17:18:00,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176621918] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:00,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:00,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:18:00,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009428170] [2024-06-27 17:18:00,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:00,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:18:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:00,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:18:00,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:18:00,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:00,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:00,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:00,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:00,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:01,046 INFO L124 PetriNetUnfolderBase]: 65/123 cut-off events. [2024-06-27 17:18:01,046 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:18:01,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 123 events. 65/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 320 event pairs, 22 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 248. Up to 71 conditions per place. [2024-06-27 17:18:01,047 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2024-06-27 17:18:01,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 38 transitions, 169 flow [2024-06-27 17:18:01,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:18:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:18:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2024-06-27 17:18:01,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-27 17:18:01,049 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 50 flow. Second operand 5 states and 52 transitions. [2024-06-27 17:18:01,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 38 transitions, 169 flow [2024-06-27 17:18:01,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 38 transitions, 165 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:18:01,051 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 82 flow [2024-06-27 17:18:01,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2024-06-27 17:18:01,051 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2024-06-27 17:18:01,051 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 82 flow [2024-06-27 17:18:01,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:01,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:01,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:01,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-06-27 17:18:01,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:01,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:01,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:01,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1186858718, now seen corresponding path program 2 times [2024-06-27 17:18:01,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:01,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453874646] [2024-06-27 17:18:01,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:18:01,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:01,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:01,257 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:01,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-06-27 17:18:01,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-27 17:18:01,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:01,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 17:18:01,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:01,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:01,413 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:01,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:01,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453874646] [2024-06-27 17:18:01,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453874646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:01,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:01,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:18:01,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664938496] [2024-06-27 17:18:01,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:01,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:18:01,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:01,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:18:01,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:18:01,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:01,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:01,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:01,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:01,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:01,593 INFO L124 PetriNetUnfolderBase]: 100/190 cut-off events. [2024-06-27 17:18:01,593 INFO L125 PetriNetUnfolderBase]: For 111/111 co-relation queries the response was YES. [2024-06-27 17:18:01,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 190 events. 100/190 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 600 event pairs, 39 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 531. Up to 120 conditions per place. [2024-06-27 17:18:01,596 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 34 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2024-06-27 17:18:01,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 42 transitions, 242 flow [2024-06-27 17:18:01,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:18:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:18:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2024-06-27 17:18:01,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2024-06-27 17:18:01,599 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 82 flow. Second operand 5 states and 48 transitions. [2024-06-27 17:18:01,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 42 transitions, 242 flow [2024-06-27 17:18:01,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 42 transitions, 225 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 17:18:01,601 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 124 flow [2024-06-27 17:18:01,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2024-06-27 17:18:01,602 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2024-06-27 17:18:01,602 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 124 flow [2024-06-27 17:18:01,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:01,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:01,603 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:01,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-06-27 17:18:01,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:01,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:01,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:01,806 INFO L85 PathProgramCache]: Analyzing trace with hash 725816600, now seen corresponding path program 3 times [2024-06-27 17:18:01,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:01,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525130879] [2024-06-27 17:18:01,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:18:01,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:01,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:01,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:01,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-06-27 17:18:01,930 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-06-27 17:18:01,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:01,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 17:18:01,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:01,979 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:01,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:01,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525130879] [2024-06-27 17:18:01,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525130879] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:01,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:01,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:18:01,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470852067] [2024-06-27 17:18:01,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:01,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:18:01,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:01,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:18:01,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:18:01,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:01,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:01,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:01,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:01,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:02,263 INFO L124 PetriNetUnfolderBase]: 109/204 cut-off events. [2024-06-27 17:18:02,263 INFO L125 PetriNetUnfolderBase]: For 277/277 co-relation queries the response was YES. [2024-06-27 17:18:02,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 204 events. 109/204 cut-off events. For 277/277 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 655 event pairs, 39 based on Foata normal form. 3/182 useless extension candidates. Maximal degree in co-relation 689. Up to 111 conditions per place. [2024-06-27 17:18:02,265 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 33 selfloop transitions, 12 changer transitions 0/46 dead transitions. [2024-06-27 17:18:02,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 307 flow [2024-06-27 17:18:02,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:18:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:18:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2024-06-27 17:18:02,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-06-27 17:18:02,266 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 124 flow. Second operand 5 states and 52 transitions. [2024-06-27 17:18:02,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 307 flow [2024-06-27 17:18:02,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 283 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-06-27 17:18:02,269 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 203 flow [2024-06-27 17:18:02,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-06-27 17:18:02,269 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2024-06-27 17:18:02,269 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 203 flow [2024-06-27 17:18:02,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:02,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:02,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:02,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:02,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:02,473 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:02,473 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:02,473 INFO L85 PathProgramCache]: Analyzing trace with hash -382800802, now seen corresponding path program 4 times [2024-06-27 17:18:02,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:02,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33712681] [2024-06-27 17:18:02,474 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:18:02,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:02,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:02,479 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:02,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-06-27 17:18:02,602 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:18:02,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:02,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 17:18:02,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:02,638 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:02,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:02,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33712681] [2024-06-27 17:18:02,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33712681] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:02,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:02,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:18:02,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485944158] [2024-06-27 17:18:02,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:02,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:18:02,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:02,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:18:02,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:18:02,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:02,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:02,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:02,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:02,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:02,786 INFO L124 PetriNetUnfolderBase]: 106/201 cut-off events. [2024-06-27 17:18:02,786 INFO L125 PetriNetUnfolderBase]: For 488/488 co-relation queries the response was YES. [2024-06-27 17:18:02,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 201 events. 106/201 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 649 event pairs, 46 based on Foata normal form. 3/179 useless extension candidates. Maximal degree in co-relation 752. Up to 160 conditions per place. [2024-06-27 17:18:02,788 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 29 selfloop transitions, 15 changer transitions 0/45 dead transitions. [2024-06-27 17:18:02,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 365 flow [2024-06-27 17:18:02,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:18:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:18:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-06-27 17:18:02,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-06-27 17:18:02,790 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 203 flow. Second operand 5 states and 47 transitions. [2024-06-27 17:18:02,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 365 flow [2024-06-27 17:18:02,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 352 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 17:18:02,792 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 296 flow [2024-06-27 17:18:02,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=296, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-06-27 17:18:02,793 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 22 predicate places. [2024-06-27 17:18:02,793 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 296 flow [2024-06-27 17:18:02,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:02,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:02,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:02,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-06-27 17:18:02,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:02,997 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:02,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:02,998 INFO L85 PathProgramCache]: Analyzing trace with hash 775865480, now seen corresponding path program 5 times [2024-06-27 17:18:02,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:02,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457094291] [2024-06-27 17:18:02,998 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:18:02,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:02,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:02,999 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:03,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-06-27 17:18:03,072 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:18:03,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:03,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 17:18:03,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:03,110 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:03,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:03,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457094291] [2024-06-27 17:18:03,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457094291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:03,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:03,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:18:03,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126641916] [2024-06-27 17:18:03,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:03,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:18:03,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:03,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:18:03,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:18:03,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:03,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:03,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:03,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:03,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:03,310 INFO L124 PetriNetUnfolderBase]: 107/204 cut-off events. [2024-06-27 17:18:03,311 INFO L125 PetriNetUnfolderBase]: For 641/641 co-relation queries the response was YES. [2024-06-27 17:18:03,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 204 events. 107/204 cut-off events. For 641/641 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 660 event pairs, 34 based on Foata normal form. 2/181 useless extension candidates. Maximal degree in co-relation 852. Up to 113 conditions per place. [2024-06-27 17:18:03,312 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 35 selfloop transitions, 14 changer transitions 0/50 dead transitions. [2024-06-27 17:18:03,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 432 flow [2024-06-27 17:18:03,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:18:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:18:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2024-06-27 17:18:03,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2024-06-27 17:18:03,320 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 296 flow. Second operand 5 states and 51 transitions. [2024-06-27 17:18:03,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 432 flow [2024-06-27 17:18:03,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 50 transitions, 378 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-27 17:18:03,323 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 282 flow [2024-06-27 17:18:03,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-06-27 17:18:03,324 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2024-06-27 17:18:03,324 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 282 flow [2024-06-27 17:18:03,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:03,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:03,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:03,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:03,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:03,528 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:03,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:03,528 INFO L85 PathProgramCache]: Analyzing trace with hash -327389542, now seen corresponding path program 6 times [2024-06-27 17:18:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:03,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064208406] [2024-06-27 17:18:03,529 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:18:03,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:03,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:03,530 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:03,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-06-27 17:18:03,628 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-06-27 17:18:03,629 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:03,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 17:18:03,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:03,665 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:18:03,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:03,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064208406] [2024-06-27 17:18:03,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064208406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:18:03,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:18:03,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:18:03,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583283748] [2024-06-27 17:18:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:18:03,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:18:03,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:03,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:18:03,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:18:03,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:03,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:03,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:03,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:03,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:03,803 INFO L124 PetriNetUnfolderBase]: 106/197 cut-off events. [2024-06-27 17:18:03,803 INFO L125 PetriNetUnfolderBase]: For 629/629 co-relation queries the response was YES. [2024-06-27 17:18:03,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 197 events. 106/197 cut-off events. For 629/629 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 632 event pairs, 45 based on Foata normal form. 2/174 useless extension candidates. Maximal degree in co-relation 798. Up to 154 conditions per place. [2024-06-27 17:18:03,804 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 31 selfloop transitions, 15 changer transitions 0/47 dead transitions. [2024-06-27 17:18:03,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 404 flow [2024-06-27 17:18:03,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:18:03,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:18:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2024-06-27 17:18:03,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-06-27 17:18:03,806 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 282 flow. Second operand 5 states and 47 transitions. [2024-06-27 17:18:03,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 404 flow [2024-06-27 17:18:03,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 370 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 17:18:03,808 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 294 flow [2024-06-27 17:18:03,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-06-27 17:18:03,809 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2024-06-27 17:18:03,809 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 294 flow [2024-06-27 17:18:03,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06-27 17:18:03,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:03,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:03,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:04,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:04,015 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:04,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:04,015 INFO L85 PathProgramCache]: Analyzing trace with hash -730287813, now seen corresponding path program 1 times [2024-06-27 17:18:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:04,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867318943] [2024-06-27 17:18:04,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:04,016 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:04,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:04,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:04,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-06-27 17:18:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:04,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:04,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:04,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:04,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:04,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867318943] [2024-06-27 17:18:04,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867318943] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:04,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:04,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:18:04,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375960126] [2024-06-27 17:18:04,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:04,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:18:04,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:04,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:18:04,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:18:04,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:04,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 294 flow. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:04,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:04,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:04,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:05,074 INFO L124 PetriNetUnfolderBase]: 289/506 cut-off events. [2024-06-27 17:18:05,074 INFO L125 PetriNetUnfolderBase]: For 1330/1330 co-relation queries the response was YES. [2024-06-27 17:18:05,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 506 events. 289/506 cut-off events. For 1330/1330 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2045 event pairs, 32 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 1842. Up to 207 conditions per place. [2024-06-27 17:18:05,077 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 67 selfloop transitions, 53 changer transitions 0/121 dead transitions. [2024-06-27 17:18:05,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 121 transitions, 953 flow [2024-06-27 17:18:05,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 17:18:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 17:18:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 145 transitions. [2024-06-27 17:18:05,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453125 [2024-06-27 17:18:05,079 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 294 flow. Second operand 16 states and 145 transitions. [2024-06-27 17:18:05,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 121 transitions, 953 flow [2024-06-27 17:18:05,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 121 transitions, 921 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 17:18:05,082 INFO L231 Difference]: Finished difference. Result has 64 places, 75 transitions, 671 flow [2024-06-27 17:18:05,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=671, PETRI_PLACES=64, PETRI_TRANSITIONS=75} [2024-06-27 17:18:05,083 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 43 predicate places. [2024-06-27 17:18:05,083 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 75 transitions, 671 flow [2024-06-27 17:18:05,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:05,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:05,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:05,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-06-27 17:18:05,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:05,287 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:05,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2060403687, now seen corresponding path program 2 times [2024-06-27 17:18:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:05,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752405175] [2024-06-27 17:18:05,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:18:05,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:05,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:05,291 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:05,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-06-27 17:18:05,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:18:05,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:05,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:05,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:05,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:05,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:05,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:05,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752405175] [2024-06-27 17:18:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752405175] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:05,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:05,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:18:05,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564518571] [2024-06-27 17:18:05,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:05,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:18:05,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:05,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:18:05,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:18:05,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:05,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 75 transitions, 671 flow. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-06-27 17:18:05,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:05,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:05,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:06,355 INFO L124 PetriNetUnfolderBase]: 374/676 cut-off events. [2024-06-27 17:18:06,356 INFO L125 PetriNetUnfolderBase]: For 2781/2781 co-relation queries the response was YES. [2024-06-27 17:18:06,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3134 conditions, 676 events. 374/676 cut-off events. For 2781/2781 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3108 event pairs, 63 based on Foata normal form. 3/543 useless extension candidates. Maximal degree in co-relation 3102. Up to 272 conditions per place. [2024-06-27 17:18:06,360 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 126 selfloop transitions, 46 changer transitions 0/173 dead transitions. [2024-06-27 17:18:06,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 173 transitions, 1549 flow [2024-06-27 17:18:06,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 17:18:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 17:18:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 116 transitions. [2024-06-27 17:18:06,362 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4461538461538462 [2024-06-27 17:18:06,362 INFO L175 Difference]: Start difference. First operand has 64 places, 75 transitions, 671 flow. Second operand 13 states and 116 transitions. [2024-06-27 17:18:06,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 173 transitions, 1549 flow [2024-06-27 17:18:06,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 173 transitions, 1215 flow, removed 136 selfloop flow, removed 5 redundant places. [2024-06-27 17:18:06,371 INFO L231 Difference]: Finished difference. Result has 79 places, 90 transitions, 762 flow [2024-06-27 17:18:06,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=762, PETRI_PLACES=79, PETRI_TRANSITIONS=90} [2024-06-27 17:18:06,371 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 58 predicate places. [2024-06-27 17:18:06,372 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 90 transitions, 762 flow [2024-06-27 17:18:06,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-06-27 17:18:06,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:06,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:06,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:06,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:06,577 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:06,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1971694003, now seen corresponding path program 3 times [2024-06-27 17:18:06,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:06,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648107229] [2024-06-27 17:18:06,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:18:06,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:06,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:06,584 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:06,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-06-27 17:18:06,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:18:06,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:06,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:06,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:06,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:06,737 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:06,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:06,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:06,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648107229] [2024-06-27 17:18:06,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648107229] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:06,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:06,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:18:06,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758984930] [2024-06-27 17:18:06,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:06,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:18:06,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:06,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:18:06,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:18:06,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:06,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 90 transitions, 762 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-06-27 17:18:06,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:06,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:06,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:08,152 INFO L124 PetriNetUnfolderBase]: 447/809 cut-off events. [2024-06-27 17:18:08,152 INFO L125 PetriNetUnfolderBase]: For 4495/4495 co-relation queries the response was YES. [2024-06-27 17:18:08,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3826 conditions, 809 events. 447/809 cut-off events. For 4495/4495 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3873 event pairs, 68 based on Foata normal form. 14/802 useless extension candidates. Maximal degree in co-relation 3787. Up to 221 conditions per place. [2024-06-27 17:18:08,157 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 117 selfloop transitions, 63 changer transitions 0/181 dead transitions. [2024-06-27 17:18:08,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 181 transitions, 1751 flow [2024-06-27 17:18:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:18:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:18:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 137 transitions. [2024-06-27 17:18:08,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-06-27 17:18:08,158 INFO L175 Difference]: Start difference. First operand has 79 places, 90 transitions, 762 flow. Second operand 14 states and 137 transitions. [2024-06-27 17:18:08,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 181 transitions, 1751 flow [2024-06-27 17:18:08,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 181 transitions, 1598 flow, removed 47 selfloop flow, removed 4 redundant places. [2024-06-27 17:18:08,169 INFO L231 Difference]: Finished difference. Result has 96 places, 122 transitions, 1198 flow [2024-06-27 17:18:08,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1198, PETRI_PLACES=96, PETRI_TRANSITIONS=122} [2024-06-27 17:18:08,170 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 75 predicate places. [2024-06-27 17:18:08,170 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 122 transitions, 1198 flow [2024-06-27 17:18:08,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-06-27 17:18:08,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:08,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:08,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-06-27 17:18:08,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:08,373 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:08,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:08,374 INFO L85 PathProgramCache]: Analyzing trace with hash 955984387, now seen corresponding path program 1 times [2024-06-27 17:18:08,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:08,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129651098] [2024-06-27 17:18:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:18:08,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:08,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:08,376 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:08,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-06-27 17:18:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:08,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:08,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:08,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:08,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129651098] [2024-06-27 17:18:08,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129651098] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:08,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:08,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:18:08,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454054811] [2024-06-27 17:18:08,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:08,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:18:08,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:08,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:18:08,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:18:08,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:08,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 122 transitions, 1198 flow. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:08,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:08,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:08,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:09,654 INFO L124 PetriNetUnfolderBase]: 668/1194 cut-off events. [2024-06-27 17:18:09,654 INFO L125 PetriNetUnfolderBase]: For 6650/6650 co-relation queries the response was YES. [2024-06-27 17:18:09,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6084 conditions, 1194 events. 668/1194 cut-off events. For 6650/6650 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6177 event pairs, 96 based on Foata normal form. 21/1142 useless extension candidates. Maximal degree in co-relation 6037. Up to 307 conditions per place. [2024-06-27 17:18:09,664 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 166 selfloop transitions, 75 changer transitions 0/242 dead transitions. [2024-06-27 17:18:09,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 242 transitions, 2499 flow [2024-06-27 17:18:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 17:18:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 17:18:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 161 transitions. [2024-06-27 17:18:09,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503125 [2024-06-27 17:18:09,666 INFO L175 Difference]: Start difference. First operand has 96 places, 122 transitions, 1198 flow. Second operand 16 states and 161 transitions. [2024-06-27 17:18:09,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 242 transitions, 2499 flow [2024-06-27 17:18:09,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 242 transitions, 2270 flow, removed 110 selfloop flow, removed 2 redundant places. [2024-06-27 17:18:09,687 INFO L231 Difference]: Finished difference. Result has 115 places, 157 transitions, 1633 flow [2024-06-27 17:18:09,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1071, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1633, PETRI_PLACES=115, PETRI_TRANSITIONS=157} [2024-06-27 17:18:09,688 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 94 predicate places. [2024-06-27 17:18:09,688 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 157 transitions, 1633 flow [2024-06-27 17:18:09,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:09,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:09,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:09,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-06-27 17:18:09,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:09,891 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:09,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:09,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1921645123, now seen corresponding path program 4 times [2024-06-27 17:18:09,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:09,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93442967] [2024-06-27 17:18:09,893 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:18:09,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:09,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:09,894 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:09,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-06-27 17:18:09,987 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:18:09,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:09,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:09,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:10,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:10,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93442967] [2024-06-27 17:18:10,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [93442967] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:10,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:10,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:18:10,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000132558] [2024-06-27 17:18:10,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:10,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:18:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:10,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:18:10,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:18:10,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:10,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 157 transitions, 1633 flow. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:10,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:10,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:10,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:11,487 INFO L124 PetriNetUnfolderBase]: 676/1223 cut-off events. [2024-06-27 17:18:11,487 INFO L125 PetriNetUnfolderBase]: For 7821/7821 co-relation queries the response was YES. [2024-06-27 17:18:11,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6562 conditions, 1223 events. 676/1223 cut-off events. For 7821/7821 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6491 event pairs, 156 based on Foata normal form. 24/1246 useless extension candidates. Maximal degree in co-relation 6509. Up to 581 conditions per place. [2024-06-27 17:18:11,497 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 134 selfloop transitions, 92 changer transitions 0/227 dead transitions. [2024-06-27 17:18:11,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 227 transitions, 2491 flow [2024-06-27 17:18:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 17:18:11,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 17:18:11,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 147 transitions. [2024-06-27 17:18:11,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.459375 [2024-06-27 17:18:11,499 INFO L175 Difference]: Start difference. First operand has 115 places, 157 transitions, 1633 flow. Second operand 16 states and 147 transitions. [2024-06-27 17:18:11,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 227 transitions, 2491 flow [2024-06-27 17:18:11,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 227 transitions, 2225 flow, removed 90 selfloop flow, removed 5 redundant places. [2024-06-27 17:18:11,524 INFO L231 Difference]: Finished difference. Result has 125 places, 172 transitions, 1749 flow [2024-06-27 17:18:11,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1749, PETRI_PLACES=125, PETRI_TRANSITIONS=172} [2024-06-27 17:18:11,525 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 104 predicate places. [2024-06-27 17:18:11,525 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 172 transitions, 1749 flow [2024-06-27 17:18:11,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:11,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:11,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:11,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:11,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:11,728 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:11,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:11,729 INFO L85 PathProgramCache]: Analyzing trace with hash -516450317, now seen corresponding path program 5 times [2024-06-27 17:18:11,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:11,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326437234] [2024-06-27 17:18:11,729 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:18:11,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:11,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:11,745 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:11,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-06-27 17:18:11,885 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:18:11,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:11,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:11,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:11,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:12,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:12,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326437234] [2024-06-27 17:18:12,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326437234] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:12,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:12,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:18:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767447150] [2024-06-27 17:18:12,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:12,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:18:12,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:12,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:18:12,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:18:12,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:12,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 172 transitions, 1749 flow. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:12,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:12,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:12,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:13,116 INFO L124 PetriNetUnfolderBase]: 670/1211 cut-off events. [2024-06-27 17:18:13,117 INFO L125 PetriNetUnfolderBase]: For 6427/6427 co-relation queries the response was YES. [2024-06-27 17:18:13,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6315 conditions, 1211 events. 670/1211 cut-off events. For 6427/6427 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6384 event pairs, 160 based on Foata normal form. 15/1225 useless extension candidates. Maximal degree in co-relation 6263. Up to 581 conditions per place. [2024-06-27 17:18:13,128 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 158 selfloop transitions, 69 changer transitions 0/228 dead transitions. [2024-06-27 17:18:13,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 228 transitions, 2473 flow [2024-06-27 17:18:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:18:13,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:18:13,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 123 transitions. [2024-06-27 17:18:13,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-27 17:18:13,130 INFO L175 Difference]: Start difference. First operand has 125 places, 172 transitions, 1749 flow. Second operand 14 states and 123 transitions. [2024-06-27 17:18:13,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 228 transitions, 2473 flow [2024-06-27 17:18:13,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 228 transitions, 2255 flow, removed 70 selfloop flow, removed 6 redundant places. [2024-06-27 17:18:13,151 INFO L231 Difference]: Finished difference. Result has 136 places, 179 transitions, 1791 flow [2024-06-27 17:18:13,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1791, PETRI_PLACES=136, PETRI_TRANSITIONS=179} [2024-06-27 17:18:13,151 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 115 predicate places. [2024-06-27 17:18:13,152 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 179 transitions, 1791 flow [2024-06-27 17:18:13,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:13,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:13,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:13,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:13,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:13,356 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:13,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:13,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1595160959, now seen corresponding path program 2 times [2024-06-27 17:18:13,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:13,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883763837] [2024-06-27 17:18:13,357 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:18:13,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:13,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:13,358 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:13,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-06-27 17:18:13,507 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:18:13,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:13,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:13,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:13,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:13,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:13,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883763837] [2024-06-27 17:18:13,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883763837] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:13,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:13,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:18:13,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492024267] [2024-06-27 17:18:13,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:13,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:18:13,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:13,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:18:13,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:18:13,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:13,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 179 transitions, 1791 flow. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:13,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:13,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:13,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:15,064 INFO L124 PetriNetUnfolderBase]: 694/1276 cut-off events. [2024-06-27 17:18:15,064 INFO L125 PetriNetUnfolderBase]: For 6262/6262 co-relation queries the response was YES. [2024-06-27 17:18:15,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 1276 events. 694/1276 cut-off events. For 6262/6262 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 6987 event pairs, 164 based on Foata normal form. 12/1287 useless extension candidates. Maximal degree in co-relation 6548. Up to 796 conditions per place. [2024-06-27 17:18:15,074 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 152 selfloop transitions, 91 changer transitions 0/244 dead transitions. [2024-06-27 17:18:15,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 244 transitions, 2852 flow [2024-06-27 17:18:15,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:18:15,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:18:15,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 118 transitions. [2024-06-27 17:18:15,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-27 17:18:15,076 INFO L175 Difference]: Start difference. First operand has 136 places, 179 transitions, 1791 flow. Second operand 14 states and 118 transitions. [2024-06-27 17:18:15,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 244 transitions, 2852 flow [2024-06-27 17:18:15,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 244 transitions, 2777 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 17:18:15,100 INFO L231 Difference]: Finished difference. Result has 149 places, 198 transitions, 2185 flow [2024-06-27 17:18:15,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1726, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2185, PETRI_PLACES=149, PETRI_TRANSITIONS=198} [2024-06-27 17:18:15,101 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 128 predicate places. [2024-06-27 17:18:15,102 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 198 transitions, 2185 flow [2024-06-27 17:18:15,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:15,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:15,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:15,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:15,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:15,306 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:15,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:15,306 INFO L85 PathProgramCache]: Analyzing trace with hash -107599825, now seen corresponding path program 6 times [2024-06-27 17:18:15,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:15,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163522076] [2024-06-27 17:18:15,306 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:18:15,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:15,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:15,307 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:15,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-06-27 17:18:15,428 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-06-27 17:18:15,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:15,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:15,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:15,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:15,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:15,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163522076] [2024-06-27 17:18:15,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163522076] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:15,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:15,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:18:15,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533213500] [2024-06-27 17:18:15,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:15,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:18:15,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:15,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:18:15,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:18:15,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:15,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 198 transitions, 2185 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-06-27 17:18:15,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:15,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:15,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:16,886 INFO L124 PetriNetUnfolderBase]: 694/1284 cut-off events. [2024-06-27 17:18:16,887 INFO L125 PetriNetUnfolderBase]: For 9053/9053 co-relation queries the response was YES. [2024-06-27 17:18:16,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7213 conditions, 1284 events. 694/1284 cut-off events. For 9053/9053 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7055 event pairs, 68 based on Foata normal form. 10/1293 useless extension candidates. Maximal degree in co-relation 7152. Up to 372 conditions per place. [2024-06-27 17:18:16,897 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 140 selfloop transitions, 129 changer transitions 0/270 dead transitions. [2024-06-27 17:18:16,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 270 transitions, 3402 flow [2024-06-27 17:18:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:18:16,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:18:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2024-06-27 17:18:16,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-27 17:18:16,898 INFO L175 Difference]: Start difference. First operand has 149 places, 198 transitions, 2185 flow. Second operand 14 states and 135 transitions. [2024-06-27 17:18:16,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 270 transitions, 3402 flow [2024-06-27 17:18:16,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 270 transitions, 3265 flow, removed 50 selfloop flow, removed 3 redundant places. [2024-06-27 17:18:16,931 INFO L231 Difference]: Finished difference. Result has 162 places, 203 transitions, 2426 flow [2024-06-27 17:18:16,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2058, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2426, PETRI_PLACES=162, PETRI_TRANSITIONS=203} [2024-06-27 17:18:16,932 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 141 predicate places. [2024-06-27 17:18:16,932 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 203 transitions, 2426 flow [2024-06-27 17:18:16,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-06-27 17:18:16,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:16,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:16,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-06-27 17:18:17,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:17,137 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:17,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:17,137 INFO L85 PathProgramCache]: Analyzing trace with hash 605737893, now seen corresponding path program 3 times [2024-06-27 17:18:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:17,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053803421] [2024-06-27 17:18:17,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:18:17,138 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:17,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:17,139 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:17,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-06-27 17:18:17,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:18:17,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:17,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:17,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:17,364 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:17,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:17,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053803421] [2024-06-27 17:18:17,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053803421] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:17,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:17,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:18:17,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141890938] [2024-06-27 17:18:17,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:17,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:18:17,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:17,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:18:17,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:18:17,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:17,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 203 transitions, 2426 flow. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:17,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:17,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:17,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:18,981 INFO L124 PetriNetUnfolderBase]: 718/1339 cut-off events. [2024-06-27 17:18:18,981 INFO L125 PetriNetUnfolderBase]: For 10262/10262 co-relation queries the response was YES. [2024-06-27 17:18:18,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8001 conditions, 1339 events. 718/1339 cut-off events. For 10262/10262 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7571 event pairs, 176 based on Foata normal form. 27/1365 useless extension candidates. Maximal degree in co-relation 7936. Up to 860 conditions per place. [2024-06-27 17:18:18,998 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 154 selfloop transitions, 120 changer transitions 0/275 dead transitions. [2024-06-27 17:18:18,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 275 transitions, 3693 flow [2024-06-27 17:18:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 17:18:18,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 17:18:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 139 transitions. [2024-06-27 17:18:19,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434375 [2024-06-27 17:18:19,000 INFO L175 Difference]: Start difference. First operand has 162 places, 203 transitions, 2426 flow. Second operand 16 states and 139 transitions. [2024-06-27 17:18:19,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 275 transitions, 3693 flow [2024-06-27 17:18:19,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 275 transitions, 3407 flow, removed 10 selfloop flow, removed 10 redundant places. [2024-06-27 17:18:19,034 INFO L231 Difference]: Finished difference. Result has 169 places, 235 transitions, 2979 flow [2024-06-27 17:18:19,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2160, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2979, PETRI_PLACES=169, PETRI_TRANSITIONS=235} [2024-06-27 17:18:19,035 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 148 predicate places. [2024-06-27 17:18:19,035 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 235 transitions, 2979 flow [2024-06-27 17:18:19,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:19,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:19,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:19,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-06-27 17:18:19,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:19,244 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:19,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:19,244 INFO L85 PathProgramCache]: Analyzing trace with hash 655786773, now seen corresponding path program 4 times [2024-06-27 17:18:19,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:19,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242562841] [2024-06-27 17:18:19,245 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:18:19,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:19,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:19,246 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:19,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-06-27 17:18:19,340 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:18:19,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:19,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:19,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:19,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:19,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:19,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242562841] [2024-06-27 17:18:19,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242562841] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:19,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:19,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:18:19,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875665523] [2024-06-27 17:18:19,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:19,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:18:19,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:19,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:18:19,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:18:19,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:19,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 235 transitions, 2979 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-06-27 17:18:19,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:19,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:19,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:20,857 INFO L124 PetriNetUnfolderBase]: 719/1350 cut-off events. [2024-06-27 17:18:20,857 INFO L125 PetriNetUnfolderBase]: For 10139/10139 co-relation queries the response was YES. [2024-06-27 17:18:20,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8101 conditions, 1350 events. 719/1350 cut-off events. For 10139/10139 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 7703 event pairs, 171 based on Foata normal form. 14/1363 useless extension candidates. Maximal degree in co-relation 8035. Up to 834 conditions per place. [2024-06-27 17:18:20,866 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 159 selfloop transitions, 119 changer transitions 0/279 dead transitions. [2024-06-27 17:18:20,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 279 transitions, 3845 flow [2024-06-27 17:18:20,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 17:18:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 17:18:20,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2024-06-27 17:18:20,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2024-06-27 17:18:20,867 INFO L175 Difference]: Start difference. First operand has 169 places, 235 transitions, 2979 flow. Second operand 14 states and 127 transitions. [2024-06-27 17:18:20,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 279 transitions, 3845 flow [2024-06-27 17:18:20,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 279 transitions, 3467 flow, removed 166 selfloop flow, removed 4 redundant places. [2024-06-27 17:18:20,916 INFO L231 Difference]: Finished difference. Result has 183 places, 241 transitions, 3032 flow [2024-06-27 17:18:20,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2619, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3032, PETRI_PLACES=183, PETRI_TRANSITIONS=241} [2024-06-27 17:18:20,917 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 162 predicate places. [2024-06-27 17:18:20,917 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 241 transitions, 3032 flow [2024-06-27 17:18:20,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 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-06-27 17:18:20,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:20,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:20,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-06-27 17:18:21,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:21,121 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:21,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:21,122 INFO L85 PathProgramCache]: Analyzing trace with hash 170321119, now seen corresponding path program 7 times [2024-06-27 17:18:21,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:21,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756217446] [2024-06-27 17:18:21,122 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 17:18:21,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:21,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:21,123 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:21,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-06-27 17:18:21,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:21,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2024-06-27 17:18:21,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:21,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:21,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:21,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:21,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756217446] [2024-06-27 17:18:21,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756217446] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:21,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:21,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-06-27 17:18:21,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363858450] [2024-06-27 17:18:21,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:21,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:18:21,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:18:21,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:18:21,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:21,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 241 transitions, 3032 flow. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:21,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:21,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:21,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:22,464 INFO L124 PetriNetUnfolderBase]: 718/1335 cut-off events. [2024-06-27 17:18:22,464 INFO L125 PetriNetUnfolderBase]: For 8268/8268 co-relation queries the response was YES. [2024-06-27 17:18:22,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7983 conditions, 1335 events. 718/1335 cut-off events. For 8268/8268 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7373 event pairs, 16 based on Foata normal form. 8/1342 useless extension candidates. Maximal degree in co-relation 7911. Up to 319 conditions per place. [2024-06-27 17:18:22,473 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 170 selfloop transitions, 158 changer transitions 0/329 dead transitions. [2024-06-27 17:18:22,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 329 transitions, 4576 flow [2024-06-27 17:18:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 17:18:22,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 17:18:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 141 transitions. [2024-06-27 17:18:22,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2024-06-27 17:18:22,475 INFO L175 Difference]: Start difference. First operand has 183 places, 241 transitions, 3032 flow. Second operand 15 states and 141 transitions. [2024-06-27 17:18:22,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 329 transitions, 4576 flow [2024-06-27 17:18:22,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 329 transitions, 4416 flow, removed 23 selfloop flow, removed 7 redundant places. [2024-06-27 17:18:22,521 INFO L231 Difference]: Finished difference. Result has 195 places, 262 transitions, 3535 flow [2024-06-27 17:18:22,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2880, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3535, PETRI_PLACES=195, PETRI_TRANSITIONS=262} [2024-06-27 17:18:22,523 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 174 predicate places. [2024-06-27 17:18:22,523 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 262 transitions, 3535 flow [2024-06-27 17:18:22,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 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-06-27 17:18:22,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:22,523 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:22,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:22,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:22,727 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:22,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:22,727 INFO L85 PathProgramCache]: Analyzing trace with hash 957140840, now seen corresponding path program 5 times [2024-06-27 17:18:22,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:22,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018114550] [2024-06-27 17:18:22,728 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:18:22,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:22,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:22,730 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:22,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-06-27 17:18:22,839 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:18:22,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:22,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:18:22,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:22,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:22,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:22,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:22,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018114550] [2024-06-27 17:18:22,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1018114550] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:22,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:22,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-06-27 17:18:22,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065957597] [2024-06-27 17:18:22,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:22,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:18:22,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:22,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:18:22,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:18:22,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:22,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 262 transitions, 3535 flow. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 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-06-27 17:18:22,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:22,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:22,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:24,304 INFO L124 PetriNetUnfolderBase]: 714/1334 cut-off events. [2024-06-27 17:18:24,304 INFO L125 PetriNetUnfolderBase]: For 10991/10991 co-relation queries the response was YES. [2024-06-27 17:18:24,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8327 conditions, 1334 events. 714/1334 cut-off events. For 10991/10991 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 7410 event pairs, 55 based on Foata normal form. 9/1342 useless extension candidates. Maximal degree in co-relation 8250. Up to 251 conditions per place. [2024-06-27 17:18:24,315 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 252 selfloop transitions, 145 changer transitions 0/398 dead transitions. [2024-06-27 17:18:24,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 398 transitions, 5472 flow [2024-06-27 17:18:24,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-06-27 17:18:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-06-27 17:18:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 197 transitions. [2024-06-27 17:18:24,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46904761904761905 [2024-06-27 17:18:24,317 INFO L175 Difference]: Start difference. First operand has 195 places, 262 transitions, 3535 flow. Second operand 21 states and 197 transitions. [2024-06-27 17:18:24,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 398 transitions, 5472 flow [2024-06-27 17:18:24,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 398 transitions, 5320 flow, removed 76 selfloop flow, removed 0 redundant places. [2024-06-27 17:18:24,382 INFO L231 Difference]: Finished difference. Result has 223 places, 289 transitions, 4312 flow [2024-06-27 17:18:24,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3443, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4312, PETRI_PLACES=223, PETRI_TRANSITIONS=289} [2024-06-27 17:18:24,383 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 202 predicate places. [2024-06-27 17:18:24,383 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 289 transitions, 4312 flow [2024-06-27 17:18:24,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 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-06-27 17:18:24,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:24,383 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:24,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:24,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:24,587 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:24,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1093970854, now seen corresponding path program 6 times [2024-06-27 17:18:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:24,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133490813] [2024-06-27 17:18:24,588 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:18:24,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:24,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:24,589 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:24,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-06-27 17:18:24,691 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-06-27 17:18:24,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:24,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:18:24,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:24,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:24,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:24,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133490813] [2024-06-27 17:18:24,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133490813] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:24,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:24,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-06-27 17:18:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53373665] [2024-06-27 17:18:24,865 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:24,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:18:24,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:18:24,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:18:24,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:24,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 289 transitions, 4312 flow. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-06-27 17:18:24,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:24,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:24,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:26,313 INFO L124 PetriNetUnfolderBase]: 751/1410 cut-off events. [2024-06-27 17:18:26,313 INFO L125 PetriNetUnfolderBase]: For 15441/15441 co-relation queries the response was YES. [2024-06-27 17:18:26,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9395 conditions, 1410 events. 751/1410 cut-off events. For 15441/15441 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7970 event pairs, 89 based on Foata normal form. 12/1421 useless extension candidates. Maximal degree in co-relation 9309. Up to 330 conditions per place. [2024-06-27 17:18:26,325 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 250 selfloop transitions, 130 changer transitions 0/381 dead transitions. [2024-06-27 17:18:26,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 381 transitions, 5858 flow [2024-06-27 17:18:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 17:18:26,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 17:18:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 163 transitions. [2024-06-27 17:18:26,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47941176470588237 [2024-06-27 17:18:26,328 INFO L175 Difference]: Start difference. First operand has 223 places, 289 transitions, 4312 flow. Second operand 17 states and 163 transitions. [2024-06-27 17:18:26,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 381 transitions, 5858 flow [2024-06-27 17:18:26,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 381 transitions, 5280 flow, removed 204 selfloop flow, removed 14 redundant places. [2024-06-27 17:18:26,403 INFO L231 Difference]: Finished difference. Result has 231 places, 307 transitions, 4417 flow [2024-06-27 17:18:26,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=3841, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4417, PETRI_PLACES=231, PETRI_TRANSITIONS=307} [2024-06-27 17:18:26,404 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 210 predicate places. [2024-06-27 17:18:26,404 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 307 transitions, 4417 flow [2024-06-27 17:18:26,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-06-27 17:18:26,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:26,405 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:26,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:26,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:26,609 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:26,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:26,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1086240456, now seen corresponding path program 7 times [2024-06-27 17:18:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:26,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966581147] [2024-06-27 17:18:26,610 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 17:18:26,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:26,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:26,611 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:26,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-06-27 17:18:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:18:26,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:18:26,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:26,770 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:26,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966581147] [2024-06-27 17:18:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966581147] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:26,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:26,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-06-27 17:18:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054892825] [2024-06-27 17:18:26,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:26,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:18:26,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:26,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:18:26,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:18:26,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:26,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 307 transitions, 4417 flow. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-06-27 17:18:26,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:26,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:26,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:28,263 INFO L124 PetriNetUnfolderBase]: 756/1421 cut-off events. [2024-06-27 17:18:28,263 INFO L125 PetriNetUnfolderBase]: For 13297/13297 co-relation queries the response was YES. [2024-06-27 17:18:28,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9156 conditions, 1421 events. 756/1421 cut-off events. For 13297/13297 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8057 event pairs, 135 based on Foata normal form. 12/1432 useless extension candidates. Maximal degree in co-relation 9069. Up to 470 conditions per place. [2024-06-27 17:18:28,275 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 245 selfloop transitions, 120 changer transitions 0/366 dead transitions. [2024-06-27 17:18:28,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 366 transitions, 5472 flow [2024-06-27 17:18:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 17:18:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 17:18:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 151 transitions. [2024-06-27 17:18:28,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41944444444444445 [2024-06-27 17:18:28,276 INFO L175 Difference]: Start difference. First operand has 231 places, 307 transitions, 4417 flow. Second operand 18 states and 151 transitions. [2024-06-27 17:18:28,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 366 transitions, 5472 flow [2024-06-27 17:18:28,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 366 transitions, 5278 flow, removed 36 selfloop flow, removed 5 redundant places. [2024-06-27 17:18:28,359 INFO L231 Difference]: Finished difference. Result has 247 places, 314 transitions, 4613 flow [2024-06-27 17:18:28,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4226, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4613, PETRI_PLACES=247, PETRI_TRANSITIONS=314} [2024-06-27 17:18:28,360 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 226 predicate places. [2024-06-27 17:18:28,360 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 314 transitions, 4613 flow [2024-06-27 17:18:28,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-06-27 17:18:28,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:28,360 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:28,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:28,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:28,564 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:28,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash 846598118, now seen corresponding path program 8 times [2024-06-27 17:18:28,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:28,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631135422] [2024-06-27 17:18:28,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:18:28,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:28,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:28,566 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:28,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-06-27 17:18:28,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:18:28,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:28,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:18:28,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:28,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:28,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:28,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:28,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631135422] [2024-06-27 17:18:28,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631135422] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:28,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:28,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-06-27 17:18:28,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455467210] [2024-06-27 17:18:28,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:28,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:18:28,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:28,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:18:28,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:18:28,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:28,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 314 transitions, 4613 flow. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-06-27 17:18:28,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:28,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:28,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:30,048 INFO L124 PetriNetUnfolderBase]: 763/1446 cut-off events. [2024-06-27 17:18:30,048 INFO L125 PetriNetUnfolderBase]: For 13666/13666 co-relation queries the response was YES. [2024-06-27 17:18:30,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9459 conditions, 1446 events. 763/1446 cut-off events. For 13666/13666 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 8333 event pairs, 187 based on Foata normal form. 8/1453 useless extension candidates. Maximal degree in co-relation 9368. Up to 775 conditions per place. [2024-06-27 17:18:30,060 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 263 selfloop transitions, 93 changer transitions 0/357 dead transitions. [2024-06-27 17:18:30,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 357 transitions, 5556 flow [2024-06-27 17:18:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 17:18:30,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 17:18:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2024-06-27 17:18:30,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.396875 [2024-06-27 17:18:30,073 INFO L175 Difference]: Start difference. First operand has 247 places, 314 transitions, 4613 flow. Second operand 16 states and 127 transitions. [2024-06-27 17:18:30,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 357 transitions, 5556 flow [2024-06-27 17:18:30,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 357 transitions, 5420 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-27 17:18:30,152 INFO L231 Difference]: Finished difference. Result has 259 places, 321 transitions, 4823 flow [2024-06-27 17:18:30,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4480, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4823, PETRI_PLACES=259, PETRI_TRANSITIONS=321} [2024-06-27 17:18:30,153 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 238 predicate places. [2024-06-27 17:18:30,153 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 321 transitions, 4823 flow [2024-06-27 17:18:30,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 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-06-27 17:18:30,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:30,153 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:30,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:30,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:30,357 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:30,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:30,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1917315638, now seen corresponding path program 8 times [2024-06-27 17:18:30,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:30,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786659165] [2024-06-27 17:18:30,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:18:30,358 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:30,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:30,360 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:30,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-06-27 17:18:30,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:18:30,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:30,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:18:30,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:30,563 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:30,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:30,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:30,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786659165] [2024-06-27 17:18:30,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786659165] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:30,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:30,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-06-27 17:18:30,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302185814] [2024-06-27 17:18:30,684 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:30,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:18:30,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:30,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:18:30,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:18:30,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:30,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 321 transitions, 4823 flow. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 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-06-27 17:18:30,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:30,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:30,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:32,219 INFO L124 PetriNetUnfolderBase]: 784/1509 cut-off events. [2024-06-27 17:18:32,220 INFO L125 PetriNetUnfolderBase]: For 14724/14724 co-relation queries the response was YES. [2024-06-27 17:18:32,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9794 conditions, 1509 events. 784/1509 cut-off events. For 14724/14724 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 9019 event pairs, 189 based on Foata normal form. 21/1529 useless extension candidates. Maximal degree in co-relation 9701. Up to 930 conditions per place. [2024-06-27 17:18:32,229 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 236 selfloop transitions, 135 changer transitions 0/372 dead transitions. [2024-06-27 17:18:32,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 372 transitions, 5824 flow [2024-06-27 17:18:32,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 17:18:32,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 17:18:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 140 transitions. [2024-06-27 17:18:32,247 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2024-06-27 17:18:32,247 INFO L175 Difference]: Start difference. First operand has 259 places, 321 transitions, 4823 flow. Second operand 18 states and 140 transitions. [2024-06-27 17:18:32,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 372 transitions, 5824 flow [2024-06-27 17:18:32,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 372 transitions, 5714 flow, removed 25 selfloop flow, removed 7 redundant places. [2024-06-27 17:18:32,332 INFO L231 Difference]: Finished difference. Result has 273 places, 333 transitions, 5107 flow [2024-06-27 17:18:32,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4713, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5107, PETRI_PLACES=273, PETRI_TRANSITIONS=333} [2024-06-27 17:18:32,333 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 252 predicate places. [2024-06-27 17:18:32,333 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 333 transitions, 5107 flow [2024-06-27 17:18:32,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 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-06-27 17:18:32,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:32,333 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:32,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2024-06-27 17:18:32,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:32,538 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:32,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:32,539 INFO L85 PathProgramCache]: Analyzing trace with hash -19945408, now seen corresponding path program 9 times [2024-06-27 17:18:32,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:32,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647391305] [2024-06-27 17:18:32,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:18:32,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:32,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:32,541 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:32,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-06-27 17:18:32,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:18:32,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:32,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:18:32,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:32,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:32,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 17:18:32,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:18:32,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647391305] [2024-06-27 17:18:32,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647391305] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:18:32,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:18:32,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-06-27 17:18:32,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848461282] [2024-06-27 17:18:32,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:18:32,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:18:32,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:18:32,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:18:32,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:18:32,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2024-06-27 17:18:32,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 333 transitions, 5107 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:32,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:18:32,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2024-06-27 17:18:32,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:18:36,255 INFO L124 PetriNetUnfolderBase]: 886/1690 cut-off events. [2024-06-27 17:18:36,256 INFO L125 PetriNetUnfolderBase]: For 17064/17064 co-relation queries the response was YES. [2024-06-27 17:18:36,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11274 conditions, 1690 events. 886/1690 cut-off events. For 17064/17064 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 10230 event pairs, 192 based on Foata normal form. 24/1713 useless extension candidates. Maximal degree in co-relation 11176. Up to 1009 conditions per place. [2024-06-27 17:18:36,272 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 249 selfloop transitions, 163 changer transitions 0/413 dead transitions. [2024-06-27 17:18:36,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 413 transitions, 6594 flow [2024-06-27 17:18:36,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-06-27 17:18:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-06-27 17:18:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 167 transitions. [2024-06-27 17:18:36,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3976190476190476 [2024-06-27 17:18:36,274 INFO L175 Difference]: Start difference. First operand has 273 places, 333 transitions, 5107 flow. Second operand 21 states and 167 transitions. [2024-06-27 17:18:36,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 413 transitions, 6594 flow [2024-06-27 17:18:36,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 413 transitions, 6438 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 17:18:36,399 INFO L231 Difference]: Finished difference. Result has 292 places, 363 transitions, 5799 flow [2024-06-27 17:18:36,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4922, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5799, PETRI_PLACES=292, PETRI_TRANSITIONS=363} [2024-06-27 17:18:36,400 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 271 predicate places. [2024-06-27 17:18:36,401 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 363 transitions, 5799 flow [2024-06-27 17:18:36,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:18:36,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:18:36,401 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:18:36,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2024-06-27 17:18:36,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:36,603 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-06-27 17:18:36,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:18:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash 68296392, now seen corresponding path program 9 times [2024-06-27 17:18:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:18:36,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528910583] [2024-06-27 17:18:36,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:18:36,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-27 17:18:36,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:18:36,605 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-27 17:18:36,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-06-27 17:18:36,776 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:18:36,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:18:36,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-27 17:18:36,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:18:39,105 INFO L349 Elim1Store]: treesize reduction 164, result has 7.3 percent of original size [2024-06-27 17:18:39,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 12 new quantified variables, introduced 28 case distinctions, treesize of input 207 treesize of output 103 [2024-06-27 17:18:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:18:39,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:18:50,853 WARN L293 SmtUtils]: Spent 11.33s on a formula simplification. DAG size of input: 973 DAG size of output: 274 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 17:18:50,853 INFO L349 Elim1Store]: treesize reduction 2493, result has 22.8 percent of original size [2024-06-27 17:18:50,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 28 new quantified variables, introduced 276 case distinctions, treesize of input 683 treesize of output 1068 Killed by 15