./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/popl20-bad-ring.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 be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:35:08,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:35:08,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:35:08,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:35:08,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:35:08,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:35:08,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:35:08,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:35:08,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:35:08,164 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:35:08,164 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:35:08,164 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:35:08,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:35:08,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:35:08,166 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:35:08,167 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:35:08,167 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:35:08,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:35:08,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:35:08,168 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:35:08,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:35:08,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:35:08,168 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:35:08,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:35:08,169 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:35:08,169 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:35:08,169 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:35:08,169 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:35:08,170 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:35:08,170 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:35:08,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:35:08,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:35:08,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:35:08,172 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:35:08,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:35:08,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:35:08,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:35:08,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:35:08,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:35:08,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:35:08,173 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:35:08,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:35:08,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:35:08,174 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 -> be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe [2024-01-27 15:35:08,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:35:08,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:35:08,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:35:08,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:35:08,407 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:35:08,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2024-01-27 15:35:09,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:35:09,645 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:35:09,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2024-01-27 15:35:09,659 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd6bafe9/1c10fedf64a14d0fa2fd7fb7c050c196/FLAG9656d66e5 [2024-01-27 15:35:09,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbd6bafe9/1c10fedf64a14d0fa2fd7fb7c050c196 [2024-01-27 15:35:09,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:35:09,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:35:09,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:35:09,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:35:09,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:35:09,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:09,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35dd24c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09, skipping insertion in model container [2024-01-27 15:35:09,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:09,702 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:35:09,866 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c[3986,3999] [2024-01-27 15:35:09,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:35:09,886 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:35:09,908 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c[3986,3999] [2024-01-27 15:35:09,916 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:35:09,926 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:35:09,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09 WrapperNode [2024-01-27 15:35:09,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:35:09,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:35:09,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:35:09,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:35:09,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:09,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:09,972 INFO L138 Inliner]: procedures = 25, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 330 [2024-01-27 15:35:09,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:35:09,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:35:09,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:35:09,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:35:09,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:09,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:09,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:10,001 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 2, 2, 10, 2]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 1, 3, 1]. [2024-01-27 15:35:10,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:10,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:10,011 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:10,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:10,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:10,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:10,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:35:10,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:35:10,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:35:10,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:35:10,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (1/1) ... [2024-01-27 15:35:10,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:35:10,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:10,082 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-01-27 15:35:10,101 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-01-27 15:35:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:35:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:35:10,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:35:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:35:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:35:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:35:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:35:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:35:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:35:10,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:35:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:35:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:35:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:35:10,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:35:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:35:10,120 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:35:10,120 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:35:10,121 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:35:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:35:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:35:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:35:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:35:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:35:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:35:10,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:35:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:35:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:35:10,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:35:10,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:35:10,123 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:35:10,219 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:35:10,222 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:35:10,569 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:35:10,569 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:35:10,909 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:35:10,909 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-01-27 15:35:10,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:35:10 BoogieIcfgContainer [2024-01-27 15:35:10,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:35:10,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:35:10,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:35:10,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:35:10,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:35:09" (1/3) ... [2024-01-27 15:35:10,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a19db4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:35:10, skipping insertion in model container [2024-01-27 15:35:10,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:35:09" (2/3) ... [2024-01-27 15:35:10,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a19db4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:35:10, skipping insertion in model container [2024-01-27 15:35:10,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:35:10" (3/3) ... [2024-01-27 15:35:10,916 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2024-01-27 15:35:10,923 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:35:10,930 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:35:10,931 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:35:10,932 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:35:10,992 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 15:35:11,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 50 transitions, 121 flow [2024-01-27 15:35:11,056 INFO L124 PetriNetUnfolderBase]: 8/47 cut-off events. [2024-01-27 15:35:11,056 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:35:11,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 8/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-01-27 15:35:11,059 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 50 transitions, 121 flow [2024-01-27 15:35:11,063 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 46 transitions, 110 flow [2024-01-27 15:35:11,074 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:35:11,080 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;@1e1af75c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:35:11,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:35:11,094 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:35:11,094 INFO L124 PetriNetUnfolderBase]: 8/45 cut-off events. [2024-01-27 15:35:11,094 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:35:11,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:11,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:11,095 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:11,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:11,099 INFO L85 PathProgramCache]: Analyzing trace with hash 688973113, now seen corresponding path program 1 times [2024-01-27 15:35:11,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:11,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034007777] [2024-01-27 15:35:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:11,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:11,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034007777] [2024-01-27 15:35:11,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034007777] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:11,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:11,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:35:11,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173374408] [2024-01-27 15:35:11,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:11,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-27 15:35:11,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:11,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-27 15:35:11,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-27 15:35:11,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:11,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 110 flow. Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-01-27 15:35:11,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:11,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:11,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:11,847 INFO L124 PetriNetUnfolderBase]: 1093/1873 cut-off events. [2024-01-27 15:35:11,848 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-01-27 15:35:11,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3462 conditions, 1873 events. 1093/1873 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9978 event pairs, 902 based on Foata normal form. 176/1864 useless extension candidates. Maximal degree in co-relation 3107. Up to 1468 conditions per place. [2024-01-27 15:35:11,863 INFO L140 encePairwiseOnDemand]: 48/50 looper letters, 34 selfloop transitions, 0 changer transitions 0/44 dead transitions. [2024-01-27 15:35:11,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 174 flow [2024-01-27 15:35:11,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-27 15:35:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-27 15:35:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2024-01-27 15:35:11,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.62 [2024-01-27 15:35:11,879 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 110 flow. Second operand 2 states and 62 transitions. [2024-01-27 15:35:11,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 174 flow [2024-01-27 15:35:11,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 162 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:35:11,888 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 94 flow [2024-01-27 15:35:11,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2024-01-27 15:35:11,892 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2024-01-27 15:35:11,892 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 94 flow [2024-01-27 15:35:11,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-01-27 15:35:11,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:11,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:11,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:35:11,893 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:11,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:11,894 INFO L85 PathProgramCache]: Analyzing trace with hash -108023975, now seen corresponding path program 1 times [2024-01-27 15:35:11,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:11,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853460855] [2024-01-27 15:35:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:11,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:12,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:12,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853460855] [2024-01-27 15:35:12,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853460855] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:12,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:12,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:35:12,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136990119] [2024-01-27 15:35:12,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:12,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:35:12,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:12,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:35:12,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:35:12,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:12,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:35:12,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:12,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:12,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:12,194 INFO L124 PetriNetUnfolderBase]: 1084/1806 cut-off events. [2024-01-27 15:35:12,194 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-01-27 15:35:12,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 1806 events. 1084/1806 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9147 event pairs, 281 based on Foata normal form. 33/1736 useless extension candidates. Maximal degree in co-relation 3368. Up to 1325 conditions per place. [2024-01-27 15:35:12,202 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 44 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2024-01-27 15:35:12,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 216 flow [2024-01-27 15:35:12,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:35:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:35:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-01-27 15:35:12,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-01-27 15:35:12,204 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 94 flow. Second operand 3 states and 87 transitions. [2024-01-27 15:35:12,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 216 flow [2024-01-27 15:35:12,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:35:12,206 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 113 flow [2024-01-27 15:35:12,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2024-01-27 15:35:12,207 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2024-01-27 15:35:12,207 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 113 flow [2024-01-27 15:35:12,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:35:12,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:12,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:12,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:35:12,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:12,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:12,208 INFO L85 PathProgramCache]: Analyzing trace with hash 163294151, now seen corresponding path program 2 times [2024-01-27 15:35:12,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:12,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101278743] [2024-01-27 15:35:12,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:12,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:12,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:12,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:12,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101278743] [2024-01-27 15:35:12,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101278743] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:12,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:12,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:35:12,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758754557] [2024-01-27 15:35:12,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:12,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:35:12,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:12,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:35:12,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:35:12,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:12,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:35:12,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:12,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:12,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:12,440 INFO L124 PetriNetUnfolderBase]: 914/1637 cut-off events. [2024-01-27 15:35:12,440 INFO L125 PetriNetUnfolderBase]: For 246/248 co-relation queries the response was YES. [2024-01-27 15:35:12,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 1637 events. 914/1637 cut-off events. For 246/248 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8535 event pairs, 331 based on Foata normal form. 35/1556 useless extension candidates. Maximal degree in co-relation 3288. Up to 847 conditions per place. [2024-01-27 15:35:12,447 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 48 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-01-27 15:35:12,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 249 flow [2024-01-27 15:35:12,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:35:12,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:35:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-01-27 15:35:12,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2024-01-27 15:35:12,449 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 113 flow. Second operand 3 states and 88 transitions. [2024-01-27 15:35:12,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 249 flow [2024-01-27 15:35:12,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:35:12,450 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 122 flow [2024-01-27 15:35:12,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2024-01-27 15:35:12,451 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2024-01-27 15:35:12,451 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 122 flow [2024-01-27 15:35:12,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:35:12,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:12,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:12,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:35:12,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:12,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1752692839, now seen corresponding path program 3 times [2024-01-27 15:35:12,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:12,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118687018] [2024-01-27 15:35:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:12,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:12,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:12,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:12,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118687018] [2024-01-27 15:35:12,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118687018] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:12,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:12,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:35:12,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37256505] [2024-01-27 15:35:12,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:12,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:35:12,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:12,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:35:12,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:35:12,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:12,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:35:12,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:12,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:12,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:12,720 INFO L124 PetriNetUnfolderBase]: 1402/2350 cut-off events. [2024-01-27 15:35:12,721 INFO L125 PetriNetUnfolderBase]: For 507/535 co-relation queries the response was YES. [2024-01-27 15:35:12,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5223 conditions, 2350 events. 1402/2350 cut-off events. For 507/535 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13347 event pairs, 461 based on Foata normal form. 1/2245 useless extension candidates. Maximal degree in co-relation 5217. Up to 1241 conditions per place. [2024-01-27 15:35:12,730 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 50 selfloop transitions, 2 changer transitions 8/70 dead transitions. [2024-01-27 15:35:12,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 302 flow [2024-01-27 15:35:12,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:35:12,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:35:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-01-27 15:35:12,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2024-01-27 15:35:12,733 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 122 flow. Second operand 3 states and 98 transitions. [2024-01-27 15:35:12,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 302 flow [2024-01-27 15:35:12,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:35:12,736 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 128 flow [2024-01-27 15:35:12,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-01-27 15:35:12,737 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2024-01-27 15:35:12,738 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 128 flow [2024-01-27 15:35:12,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:35:12,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:12,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:12,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:35:12,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:12,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:12,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1379937087, now seen corresponding path program 1 times [2024-01-27 15:35:12,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:12,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055046979] [2024-01-27 15:35:12,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:12,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:12,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:12,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055046979] [2024-01-27 15:35:12,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055046979] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:12,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:12,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:35:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133037728] [2024-01-27 15:35:12,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:12,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:35:12,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:12,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:35:12,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:35:12,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:12,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:12,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:12,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:12,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:12,980 INFO L124 PetriNetUnfolderBase]: 517/859 cut-off events. [2024-01-27 15:35:12,980 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-01-27 15:35:12,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 859 events. 517/859 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3968 event pairs, 198 based on Foata normal form. 44/858 useless extension candidates. Maximal degree in co-relation 1959. Up to 579 conditions per place. [2024-01-27 15:35:12,985 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 41 selfloop transitions, 2 changer transitions 1/54 dead transitions. [2024-01-27 15:35:12,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 236 flow [2024-01-27 15:35:12,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:35:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:35:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-01-27 15:35:12,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-01-27 15:35:12,990 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 128 flow. Second operand 3 states and 82 transitions. [2024-01-27 15:35:12,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 236 flow [2024-01-27 15:35:12,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 232 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:35:12,993 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 136 flow [2024-01-27 15:35:12,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-01-27 15:35:13,000 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2024-01-27 15:35:13,000 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 136 flow [2024-01-27 15:35:13,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:13,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:13,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:13,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:35:13,001 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:13,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:13,002 INFO L85 PathProgramCache]: Analyzing trace with hash 309332853, now seen corresponding path program 2 times [2024-01-27 15:35:13,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:13,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734548985] [2024-01-27 15:35:13,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:13,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:13,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:13,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734548985] [2024-01-27 15:35:13,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734548985] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:13,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:13,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:35:13,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152912894] [2024-01-27 15:35:13,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:13,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:35:13,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:13,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:35:13,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:35:13,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:13,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:13,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:13,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:13,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:13,272 INFO L124 PetriNetUnfolderBase]: 566/965 cut-off events. [2024-01-27 15:35:13,272 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2024-01-27 15:35:13,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2264 conditions, 965 events. 566/965 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4536 event pairs, 425 based on Foata normal form. 13/931 useless extension candidates. Maximal degree in co-relation 2256. Up to 778 conditions per place. [2024-01-27 15:35:13,276 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 37 selfloop transitions, 2 changer transitions 15/64 dead transitions. [2024-01-27 15:35:13,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 64 transitions, 279 flow [2024-01-27 15:35:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:35:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:35:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-01-27 15:35:13,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.464 [2024-01-27 15:35:13,278 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 136 flow. Second operand 5 states and 116 transitions. [2024-01-27 15:35:13,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 64 transitions, 279 flow [2024-01-27 15:35:13,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 64 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:35:13,279 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 150 flow [2024-01-27 15:35:13,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2024-01-27 15:35:13,280 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2024-01-27 15:35:13,280 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 150 flow [2024-01-27 15:35:13,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:13,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:13,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:13,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:35:13,281 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:13,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:13,281 INFO L85 PathProgramCache]: Analyzing trace with hash 629336987, now seen corresponding path program 1 times [2024-01-27 15:35:13,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:13,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983371742] [2024-01-27 15:35:13,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:13,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:35:13,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:13,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983371742] [2024-01-27 15:35:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983371742] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:13,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:13,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:35:13,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348005254] [2024-01-27 15:35:13,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:13,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:35:13,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:13,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:35:13,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:35:13,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:13,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:13,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:13,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:13,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:13,515 INFO L124 PetriNetUnfolderBase]: 591/1014 cut-off events. [2024-01-27 15:35:13,515 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2024-01-27 15:35:13,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 1014 events. 591/1014 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4905 event pairs, 451 based on Foata normal form. 6/968 useless extension candidates. Maximal degree in co-relation 2403. Up to 779 conditions per place. [2024-01-27 15:35:13,520 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 38 selfloop transitions, 2 changer transitions 15/65 dead transitions. [2024-01-27 15:35:13,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 303 flow [2024-01-27 15:35:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:35:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:35:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-01-27 15:35:13,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-01-27 15:35:13,521 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 150 flow. Second operand 4 states and 103 transitions. [2024-01-27 15:35:13,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 303 flow [2024-01-27 15:35:13,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 291 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-01-27 15:35:13,523 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 156 flow [2024-01-27 15:35:13,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2024-01-27 15:35:13,524 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 10 predicate places. [2024-01-27 15:35:13,524 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 156 flow [2024-01-27 15:35:13,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:13,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:13,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:13,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:35:13,525 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:13,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash 633039931, now seen corresponding path program 1 times [2024-01-27 15:35:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551200415] [2024-01-27 15:35:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:35:13,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:13,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551200415] [2024-01-27 15:35:13,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551200415] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:13,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:13,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:35:13,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489152865] [2024-01-27 15:35:13,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:13,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:35:13,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:13,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:35:13,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:35:13,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:13,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:13,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:13,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:13,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:13,759 INFO L124 PetriNetUnfolderBase]: 623/1102 cut-off events. [2024-01-27 15:35:13,760 INFO L125 PetriNetUnfolderBase]: For 313/313 co-relation queries the response was YES. [2024-01-27 15:35:13,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2574 conditions, 1102 events. 623/1102 cut-off events. For 313/313 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5449 event pairs, 476 based on Foata normal form. 6/1047 useless extension candidates. Maximal degree in co-relation 2563. Up to 780 conditions per place. [2024-01-27 15:35:13,764 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 39 selfloop transitions, 2 changer transitions 17/68 dead transitions. [2024-01-27 15:35:13,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 323 flow [2024-01-27 15:35:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:35:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:35:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-01-27 15:35:13,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52 [2024-01-27 15:35:13,766 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 156 flow. Second operand 4 states and 104 transitions. [2024-01-27 15:35:13,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 323 flow [2024-01-27 15:35:13,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 68 transitions, 315 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-01-27 15:35:13,767 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 164 flow [2024-01-27 15:35:13,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2024-01-27 15:35:13,768 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 12 predicate places. [2024-01-27 15:35:13,768 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 164 flow [2024-01-27 15:35:13,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:13,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:13,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:13,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:35:13,769 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:13,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:13,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1758412683, now seen corresponding path program 1 times [2024-01-27 15:35:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:13,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404095135] [2024-01-27 15:35:13,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:13,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:35:13,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404095135] [2024-01-27 15:35:13,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404095135] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916379111] [2024-01-27 15:35:13,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:13,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:13,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:13,959 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-01-27 15:35:13,962 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-01-27 15:35:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:14,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-27 15:35:14,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:35:14,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:14,264 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 12 treesize of output 4 [2024-01-27 15:35:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:35:14,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916379111] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:35:14,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:35:14,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2024-01-27 15:35:14,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270711268] [2024-01-27 15:35:14,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:35:14,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:35:14,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:14,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:35:14,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-01-27 15:35:14,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:14,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 164 flow. Second operand has 16 states, 16 states have (on average 18.125) internal successors, (290), 16 states have internal predecessors, (290), 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-01-27 15:35:14,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:14,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:14,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:14,717 INFO L124 PetriNetUnfolderBase]: 793/1381 cut-off events. [2024-01-27 15:35:14,718 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2024-01-27 15:35:14,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3252 conditions, 1381 events. 793/1381 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7211 event pairs, 394 based on Foata normal form. 36/1340 useless extension candidates. Maximal degree in co-relation 3240. Up to 682 conditions per place. [2024-01-27 15:35:14,724 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 45 selfloop transitions, 4 changer transitions 42/101 dead transitions. [2024-01-27 15:35:14,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 101 transitions, 496 flow [2024-01-27 15:35:14,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 15:35:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 15:35:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 201 transitions. [2024-01-27 15:35:14,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44666666666666666 [2024-01-27 15:35:14,725 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 164 flow. Second operand 9 states and 201 transitions. [2024-01-27 15:35:14,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 101 transitions, 496 flow [2024-01-27 15:35:14,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 101 transitions, 484 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-27 15:35:14,727 INFO L231 Difference]: Finished difference. Result has 69 places, 52 transitions, 184 flow [2024-01-27 15:35:14,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=69, PETRI_TRANSITIONS=52} [2024-01-27 15:35:14,728 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2024-01-27 15:35:14,728 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 52 transitions, 184 flow [2024-01-27 15:35:14,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.125) internal successors, (290), 16 states have internal predecessors, (290), 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-01-27 15:35:14,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:14,728 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:14,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-01-27 15:35:14,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:14,939 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:14,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1911937381, now seen corresponding path program 2 times [2024-01-27 15:35:14,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:14,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180549416] [2024-01-27 15:35:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:14,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:35:15,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:15,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180549416] [2024-01-27 15:35:15,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180549416] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:15,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959785602] [2024-01-27 15:35:15,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:35:15,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:15,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:15,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:35:15,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-27 15:35:15,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:35:15,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:35:15,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-27 15:35:15,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:35:15,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:15,694 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-01-27 15:35:15,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-01-27 15:35:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:35:15,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959785602] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:15,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:35:15,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 6] total 16 [2024-01-27 15:35:15,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757164198] [2024-01-27 15:35:15,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:15,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:35:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:15,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:35:15,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-01-27 15:35:15,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-01-27 15:35:15,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 52 transitions, 184 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:15,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:15,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-01-27 15:35:15,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:15,889 INFO L124 PetriNetUnfolderBase]: 946/1513 cut-off events. [2024-01-27 15:35:15,889 INFO L125 PetriNetUnfolderBase]: For 704/716 co-relation queries the response was YES. [2024-01-27 15:35:15,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3729 conditions, 1513 events. 946/1513 cut-off events. For 704/716 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7537 event pairs, 167 based on Foata normal form. 0/1426 useless extension candidates. Maximal degree in co-relation 3714. Up to 835 conditions per place. [2024-01-27 15:35:15,897 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 69 selfloop transitions, 5 changer transitions 1/83 dead transitions. [2024-01-27 15:35:15,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 425 flow [2024-01-27 15:35:15,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:35:15,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:35:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-01-27 15:35:15,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.492 [2024-01-27 15:35:15,899 INFO L175 Difference]: Start difference. First operand has 69 places, 52 transitions, 184 flow. Second operand 5 states and 123 transitions. [2024-01-27 15:35:15,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 425 flow [2024-01-27 15:35:15,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 83 transitions, 401 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-01-27 15:35:15,901 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 192 flow [2024-01-27 15:35:15,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2024-01-27 15:35:15,901 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2024-01-27 15:35:15,902 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 192 flow [2024-01-27 15:35:15,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:15,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:15,902 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:15,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-27 15:35:16,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-01-27 15:35:16,113 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:16,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash -394460049, now seen corresponding path program 1 times [2024-01-27 15:35:16,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:16,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646563647] [2024-01-27 15:35:16,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:16,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:16,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:35:16,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:16,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646563647] [2024-01-27 15:35:16,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646563647] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:16,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967082496] [2024-01-27 15:35:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:16,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:16,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:16,337 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:35:16,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-27 15:35:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:16,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-27 15:35:16,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:35:16,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:35:16,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967082496] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:35:16,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:35:16,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 16 [2024-01-27 15:35:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487153620] [2024-01-27 15:35:16,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:35:16,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-01-27 15:35:16,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:16,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-01-27 15:35:16,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-01-27 15:35:16,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:16,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 192 flow. Second operand has 16 states, 16 states have (on average 18.75) internal successors, (300), 16 states have internal predecessors, (300), 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-01-27 15:35:16,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:16,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:16,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:17,038 INFO L124 PetriNetUnfolderBase]: 964/1659 cut-off events. [2024-01-27 15:35:17,038 INFO L125 PetriNetUnfolderBase]: For 1783/1891 co-relation queries the response was YES. [2024-01-27 15:35:17,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4393 conditions, 1659 events. 964/1659 cut-off events. For 1783/1891 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8826 event pairs, 510 based on Foata normal form. 62/1657 useless extension candidates. Maximal degree in co-relation 4380. Up to 835 conditions per place. [2024-01-27 15:35:17,045 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 43 selfloop transitions, 5 changer transitions 39/98 dead transitions. [2024-01-27 15:35:17,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 98 transitions, 511 flow [2024-01-27 15:35:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 15:35:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 15:35:17,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 198 transitions. [2024-01-27 15:35:17,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-01-27 15:35:17,046 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 192 flow. Second operand 9 states and 198 transitions. [2024-01-27 15:35:17,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 98 transitions, 511 flow [2024-01-27 15:35:17,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 98 transitions, 504 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-27 15:35:17,049 INFO L231 Difference]: Finished difference. Result has 76 places, 55 transitions, 216 flow [2024-01-27 15:35:17,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=216, PETRI_PLACES=76, PETRI_TRANSITIONS=55} [2024-01-27 15:35:17,049 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2024-01-27 15:35:17,049 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 55 transitions, 216 flow [2024-01-27 15:35:17,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 18.75) internal successors, (300), 16 states have internal predecessors, (300), 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-01-27 15:35:17,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:17,050 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:17,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 15:35:17,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:17,262 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:17,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2129436225, now seen corresponding path program 2 times [2024-01-27 15:35:17,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:17,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626132110] [2024-01-27 15:35:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:17,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-27 15:35:17,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:17,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626132110] [2024-01-27 15:35:17,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626132110] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:17,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:17,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:35:17,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591907232] [2024-01-27 15:35:17,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:17,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:35:17,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:35:17,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:35:17,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:17,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 55 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:17,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:17,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:17,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:17,626 INFO L124 PetriNetUnfolderBase]: 1225/2206 cut-off events. [2024-01-27 15:35:17,626 INFO L125 PetriNetUnfolderBase]: For 3165/3333 co-relation queries the response was YES. [2024-01-27 15:35:17,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6027 conditions, 2206 events. 1225/2206 cut-off events. For 3165/3333 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 13932 event pairs, 352 based on Foata normal form. 60/2235 useless extension candidates. Maximal degree in co-relation 6009. Up to 639 conditions per place. [2024-01-27 15:35:17,641 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 79 selfloop transitions, 8 changer transitions 0/98 dead transitions. [2024-01-27 15:35:17,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 98 transitions, 530 flow [2024-01-27 15:35:17,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:35:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:35:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-01-27 15:35:17,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-01-27 15:35:17,643 INFO L175 Difference]: Start difference. First operand has 76 places, 55 transitions, 216 flow. Second operand 4 states and 130 transitions. [2024-01-27 15:35:17,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 98 transitions, 530 flow [2024-01-27 15:35:17,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 98 transitions, 500 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-01-27 15:35:17,646 INFO L231 Difference]: Finished difference. Result has 71 places, 60 transitions, 259 flow [2024-01-27 15:35:17,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2024-01-27 15:35:17,647 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 23 predicate places. [2024-01-27 15:35:17,647 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 60 transitions, 259 flow [2024-01-27 15:35:17,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:17,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:17,648 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:17,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-27 15:35:17,648 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:17,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:17,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1015233151, now seen corresponding path program 3 times [2024-01-27 15:35:17,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:17,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82212338] [2024-01-27 15:35:17,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:17,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:35:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82212338] [2024-01-27 15:35:18,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82212338] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:18,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106097755] [2024-01-27 15:35:18,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:35:18,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:18,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:18,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:35:19,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-27 15:35:19,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 15:35:19,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:35:19,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 27 conjunts are in the unsatisfiable core [2024-01-27 15:35:19,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:19,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:35:19,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2024-01-27 15:35:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:35:19,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:19,663 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-01-27 15:35:19,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2024-01-27 15:35:19,826 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-27 15:35:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106097755] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:19,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:35:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17, 8] total 27 [2024-01-27 15:35:19,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855944849] [2024-01-27 15:35:19,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:19,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 15:35:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:19,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 15:35:19,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2024-01-27 15:35:19,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-01-27 15:35:19,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 60 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:19,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:19,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-01-27 15:35:19,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:20,526 INFO L124 PetriNetUnfolderBase]: 2365/4021 cut-off events. [2024-01-27 15:35:20,527 INFO L125 PetriNetUnfolderBase]: For 7993/8161 co-relation queries the response was YES. [2024-01-27 15:35:20,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11199 conditions, 4021 events. 2365/4021 cut-off events. For 7993/8161 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25051 event pairs, 389 based on Foata normal form. 0/3849 useless extension candidates. Maximal degree in co-relation 11182. Up to 2199 conditions per place. [2024-01-27 15:35:20,543 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 82 selfloop transitions, 7 changer transitions 1/99 dead transitions. [2024-01-27 15:35:20,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 99 transitions, 583 flow [2024-01-27 15:35:20,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:35:20,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:35:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-01-27 15:35:20,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43142857142857144 [2024-01-27 15:35:20,544 INFO L175 Difference]: Start difference. First operand has 71 places, 60 transitions, 259 flow. Second operand 7 states and 151 transitions. [2024-01-27 15:35:20,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 99 transitions, 583 flow [2024-01-27 15:35:20,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 99 transitions, 571 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-01-27 15:35:20,547 INFO L231 Difference]: Finished difference. Result has 79 places, 62 transitions, 283 flow [2024-01-27 15:35:20,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=79, PETRI_TRANSITIONS=62} [2024-01-27 15:35:20,548 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2024-01-27 15:35:20,548 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 62 transitions, 283 flow [2024-01-27 15:35:20,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:20,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:20,550 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:20,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-27 15:35:20,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:20,764 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:20,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1613322950, now seen corresponding path program 1 times [2024-01-27 15:35:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734944217] [2024-01-27 15:35:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-01-27 15:35:20,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:20,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734944217] [2024-01-27 15:35:20,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734944217] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:20,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132896168] [2024-01-27 15:35:20,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:20,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:20,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:20,981 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:35:20,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-27 15:35:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:21,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-27 15:35:21,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:21,292 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-01-27 15:35:21,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:21,475 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-01-27 15:35:21,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132896168] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:35:21,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:35:21,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-01-27 15:35:21,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208403455] [2024-01-27 15:35:21,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:35:21,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-27 15:35:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:21,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-27 15:35:21,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-01-27 15:35:21,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:21,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 62 transitions, 283 flow. Second operand has 17 states, 17 states have (on average 18.88235294117647) internal successors, (321), 17 states have internal predecessors, (321), 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-01-27 15:35:21,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:21,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:21,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:22,075 INFO L124 PetriNetUnfolderBase]: 2279/4673 cut-off events. [2024-01-27 15:35:22,075 INFO L125 PetriNetUnfolderBase]: For 9881/10419 co-relation queries the response was YES. [2024-01-27 15:35:22,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13644 conditions, 4673 events. 2279/4673 cut-off events. For 9881/10419 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 36066 event pairs, 1350 based on Foata normal form. 168/4789 useless extension candidates. Maximal degree in co-relation 13625. Up to 2199 conditions per place. [2024-01-27 15:35:22,103 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 47 selfloop transitions, 5 changer transitions 41/105 dead transitions. [2024-01-27 15:35:22,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 105 transitions, 659 flow [2024-01-27 15:35:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 15:35:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 15:35:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2024-01-27 15:35:22,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4575 [2024-01-27 15:35:22,105 INFO L175 Difference]: Start difference. First operand has 79 places, 62 transitions, 283 flow. Second operand 8 states and 183 transitions. [2024-01-27 15:35:22,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 105 transitions, 659 flow [2024-01-27 15:35:22,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 105 transitions, 643 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-27 15:35:22,112 INFO L231 Difference]: Finished difference. Result has 86 places, 63 transitions, 299 flow [2024-01-27 15:35:22,112 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=299, PETRI_PLACES=86, PETRI_TRANSITIONS=63} [2024-01-27 15:35:22,112 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 38 predicate places. [2024-01-27 15:35:22,113 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 63 transitions, 299 flow [2024-01-27 15:35:22,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 18.88235294117647) internal successors, (321), 17 states have internal predecessors, (321), 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-01-27 15:35:22,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:22,113 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:22,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-27 15:35:22,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-01-27 15:35:22,326 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:22,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash -120332964, now seen corresponding path program 2 times [2024-01-27 15:35:22,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:22,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848089332] [2024-01-27 15:35:22,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:22,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:22,430 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-01-27 15:35:22,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:22,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848089332] [2024-01-27 15:35:22,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848089332] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:35:22,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:35:22,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:35:22,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741256936] [2024-01-27 15:35:22,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:35:22,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:35:22,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:22,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:35:22,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:35:22,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:35:22,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 63 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:22,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:22,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:35:22,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:23,177 INFO L124 PetriNetUnfolderBase]: 3337/6913 cut-off events. [2024-01-27 15:35:23,178 INFO L125 PetriNetUnfolderBase]: For 13112/13558 co-relation queries the response was YES. [2024-01-27 15:35:23,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19853 conditions, 6913 events. 3337/6913 cut-off events. For 13112/13558 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 55944 event pairs, 908 based on Foata normal form. 204/7105 useless extension candidates. Maximal degree in co-relation 19830. Up to 1895 conditions per place. [2024-01-27 15:35:23,215 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 95 selfloop transitions, 6 changer transitions 0/113 dead transitions. [2024-01-27 15:35:23,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 113 transitions, 730 flow [2024-01-27 15:35:23,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:35:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:35:23,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-01-27 15:35:23,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.635 [2024-01-27 15:35:23,216 INFO L175 Difference]: Start difference. First operand has 86 places, 63 transitions, 299 flow. Second operand 4 states and 127 transitions. [2024-01-27 15:35:23,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 113 transitions, 730 flow [2024-01-27 15:35:23,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 113 transitions, 702 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-01-27 15:35:23,236 INFO L231 Difference]: Finished difference. Result has 83 places, 66 transitions, 327 flow [2024-01-27 15:35:23,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=327, PETRI_PLACES=83, PETRI_TRANSITIONS=66} [2024-01-27 15:35:23,237 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 35 predicate places. [2024-01-27 15:35:23,237 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 66 transitions, 327 flow [2024-01-27 15:35:23,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:35:23,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:35:23,238 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:35:23,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-01-27 15:35:23,238 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:35:23,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:35:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1461197924, now seen corresponding path program 3 times [2024-01-27 15:35:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:35:23,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040220912] [2024-01-27 15:35:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:35:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:35:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:35:25,749 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:25,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:35:25,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040220912] [2024-01-27 15:35:25,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040220912] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:35:25,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60582128] [2024-01-27 15:35:25,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:35:25,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:35:25,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:35:25,750 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:35:25,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-27 15:35:25,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:35:25,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:35:25,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 53 conjunts are in the unsatisfiable core [2024-01-27 15:35:25,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:35:26,580 INFO L349 Elim1Store]: treesize reduction 9, result has 91.3 percent of original size [2024-01-27 15:35:26,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 114 [2024-01-27 15:35:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:35:26,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:27,621 INFO L349 Elim1Store]: treesize reduction 22, result has 93.6 percent of original size [2024-01-27 15:35:27,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 92 treesize of output 347 [2024-01-27 15:35:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-01-27 15:35:59,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60582128] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:35:59,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:35:59,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 13] total 47 [2024-01-27 15:35:59,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587121573] [2024-01-27 15:35:59,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:35:59,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-01-27 15:35:59,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:59,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-01-27 15:35:59,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1961, Unknown=0, NotChecked=0, Total=2162 [2024-01-27 15:35:59,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 50 [2024-01-27 15:35:59,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 66 transitions, 327 flow. Second operand has 47 states, 47 states have (on average 12.46808510638298) internal successors, (586), 47 states have internal predecessors, (586), 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-01-27 15:35:59,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:59,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 50 [2024-01-27 15:35:59,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:36:08,149 INFO L124 PetriNetUnfolderBase]: 12741/21564 cut-off events. [2024-01-27 15:36:08,149 INFO L125 PetriNetUnfolderBase]: For 33520/33628 co-relation queries the response was YES. [2024-01-27 15:36:08,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62352 conditions, 21564 events. 12741/21564 cut-off events. For 33520/33628 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 162955 event pairs, 3035 based on Foata normal form. 6/21484 useless extension candidates. Maximal degree in co-relation 62329. Up to 9297 conditions per place. [2024-01-27 15:36:08,301 INFO L140 encePairwiseOnDemand]: 32/50 looper letters, 311 selfloop transitions, 122 changer transitions 81/522 dead transitions. [2024-01-27 15:36:08,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 522 transitions, 3270 flow [2024-01-27 15:36:08,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-01-27 15:36:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2024-01-27 15:36:08,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 1217 transitions. [2024-01-27 15:36:08,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32891891891891895 [2024-01-27 15:36:08,305 INFO L175 Difference]: Start difference. First operand has 83 places, 66 transitions, 327 flow. Second operand 74 states and 1217 transitions. [2024-01-27 15:36:08,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 522 transitions, 3270 flow [2024-01-27 15:36:08,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 522 transitions, 3242 flow, removed 14 selfloop flow, removed 0 redundant places. [2024-01-27 15:36:08,329 INFO L231 Difference]: Finished difference. Result has 169 places, 182 transitions, 1348 flow [2024-01-27 15:36:08,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=1348, PETRI_PLACES=169, PETRI_TRANSITIONS=182} [2024-01-27 15:36:08,329 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 121 predicate places. [2024-01-27 15:36:08,330 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 182 transitions, 1348 flow [2024-01-27 15:36:08,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 12.46808510638298) internal successors, (586), 47 states have internal predecessors, (586), 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-01-27 15:36:08,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:36:08,331 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:36:08,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-27 15:36:08,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-01-27 15:36:08,544 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:36:08,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:36:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1391812572, now seen corresponding path program 4 times [2024-01-27 15:36:08,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:36:08,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433898053] [2024-01-27 15:36:08,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:36:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:36:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:36:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-01-27 15:36:08,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:36:08,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433898053] [2024-01-27 15:36:08,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433898053] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:36:08,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:36:08,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:36:08,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647384617] [2024-01-27 15:36:08,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:36:08,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:36:08,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:36:08,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:36:08,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:36:08,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:36:08,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 182 transitions, 1348 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:36:08,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:36:08,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:36:08,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:36:08,877 INFO L124 PetriNetUnfolderBase]: 994/2304 cut-off events. [2024-01-27 15:36:08,877 INFO L125 PetriNetUnfolderBase]: For 4185/4221 co-relation queries the response was YES. [2024-01-27 15:36:08,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6547 conditions, 2304 events. 994/2304 cut-off events. For 4185/4221 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 14800 event pairs, 760 based on Foata normal form. 170/2437 useless extension candidates. Maximal degree in co-relation 6510. Up to 1651 conditions per place. [2024-01-27 15:36:08,890 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 105 selfloop transitions, 19 changer transitions 5/154 dead transitions. [2024-01-27 15:36:08,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 154 transitions, 1347 flow [2024-01-27 15:36:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:36:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:36:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-01-27 15:36:08,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485 [2024-01-27 15:36:08,891 INFO L175 Difference]: Start difference. First operand has 169 places, 182 transitions, 1348 flow. Second operand 4 states and 97 transitions. [2024-01-27 15:36:08,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 154 transitions, 1347 flow [2024-01-27 15:36:08,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 154 transitions, 988 flow, removed 79 selfloop flow, removed 26 redundant places. [2024-01-27 15:36:08,902 INFO L231 Difference]: Finished difference. Result has 138 places, 139 transitions, 716 flow [2024-01-27 15:36:08,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=716, PETRI_PLACES=138, PETRI_TRANSITIONS=139} [2024-01-27 15:36:08,902 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 90 predicate places. [2024-01-27 15:36:08,902 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 139 transitions, 716 flow [2024-01-27 15:36:08,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:36:08,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:36:08,903 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:36:08,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-27 15:36:08,903 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:36:08,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:36:08,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1486170140, now seen corresponding path program 5 times [2024-01-27 15:36:08,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:36:08,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951567000] [2024-01-27 15:36:08,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:36:08,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:36:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:36:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:36:09,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:36:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951567000] [2024-01-27 15:36:09,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951567000] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:36:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060477381] [2024-01-27 15:36:09,086 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:36:09,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:36:09,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:36:09,087 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:36:09,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-27 15:36:09,279 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-27 15:36:09,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:36:09,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-27 15:36:09,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:36:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:36:09,427 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:36:09,432 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 12 treesize of output 4 [2024-01-27 15:36:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:36:09,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060477381] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:36:09,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:36:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-01-27 15:36:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466420720] [2024-01-27 15:36:09,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:36:09,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:36:09,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:36:09,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:36:09,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:36:09,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:36:09,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 139 transitions, 716 flow. Second operand has 18 states, 18 states have (on average 17.88888888888889) internal successors, (322), 18 states have internal predecessors, (322), 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-01-27 15:36:09,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:36:09,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:36:09,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:36:09,979 INFO L124 PetriNetUnfolderBase]: 1070/2538 cut-off events. [2024-01-27 15:36:09,980 INFO L125 PetriNetUnfolderBase]: For 1270/1302 co-relation queries the response was YES. [2024-01-27 15:36:09,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6128 conditions, 2538 events. 1070/2538 cut-off events. For 1270/1302 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 16484 event pairs, 831 based on Foata normal form. 40/2538 useless extension candidates. Maximal degree in co-relation 6104. Up to 1032 conditions per place. [2024-01-27 15:36:09,990 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 64 selfloop transitions, 4 changer transitions 100/185 dead transitions. [2024-01-27 15:36:09,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 185 transitions, 1244 flow [2024-01-27 15:36:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 15:36:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 15:36:09,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 194 transitions. [2024-01-27 15:36:09,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4311111111111111 [2024-01-27 15:36:09,991 INFO L175 Difference]: Start difference. First operand has 138 places, 139 transitions, 716 flow. Second operand 9 states and 194 transitions. [2024-01-27 15:36:09,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 185 transitions, 1244 flow [2024-01-27 15:36:09,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 185 transitions, 1199 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-01-27 15:36:09,996 INFO L231 Difference]: Finished difference. Result has 143 places, 85 transitions, 415 flow [2024-01-27 15:36:09,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=415, PETRI_PLACES=143, PETRI_TRANSITIONS=85} [2024-01-27 15:36:09,996 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 95 predicate places. [2024-01-27 15:36:09,996 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 85 transitions, 415 flow [2024-01-27 15:36:09,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 17.88888888888889) internal successors, (322), 18 states have internal predecessors, (322), 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-01-27 15:36:09,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:36:09,997 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:36:10,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-27 15:36:10,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:36:10,213 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:36:10,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:36:10,213 INFO L85 PathProgramCache]: Analyzing trace with hash 121765228, now seen corresponding path program 6 times [2024-01-27 15:36:10,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:36:10,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557224850] [2024-01-27 15:36:10,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:36:10,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:36:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:36:10,719 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:36:10,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:36:10,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557224850] [2024-01-27 15:36:10,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557224850] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:36:10,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354356066] [2024-01-27 15:36:10,719 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:36:10,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:36:10,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:36:10,720 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:36:10,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-27 15:36:10,917 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-01-27 15:36:10,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:36:10,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 19 conjunts are in the unsatisfiable core [2024-01-27 15:36:10,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:36:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-01-27 15:36:11,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:36:11,215 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-01-27 15:36:11,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-01-27 15:36:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-01-27 15:36:11,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354356066] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:36:11,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:36:11,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 25 [2024-01-27 15:36:11,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302096720] [2024-01-27 15:36:11,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:36:11,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-01-27 15:36:11,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:36:11,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-01-27 15:36:11,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2024-01-27 15:36:11,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-01-27 15:36:11,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 85 transitions, 415 flow. Second operand has 25 states, 25 states have (on average 15.36) internal successors, (384), 25 states have internal predecessors, (384), 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-01-27 15:36:11,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:36:11,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-01-27 15:36:11,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:36:12,480 INFO L124 PetriNetUnfolderBase]: 1535/3304 cut-off events. [2024-01-27 15:36:12,480 INFO L125 PetriNetUnfolderBase]: For 3089/3105 co-relation queries the response was YES. [2024-01-27 15:36:12,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8520 conditions, 3304 events. 1535/3304 cut-off events. For 3089/3105 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 21341 event pairs, 384 based on Foata normal form. 200/3493 useless extension candidates. Maximal degree in co-relation 8493. Up to 464 conditions per place. [2024-01-27 15:36:12,497 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 168 selfloop transitions, 36 changer transitions 12/230 dead transitions. [2024-01-27 15:36:12,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 230 transitions, 1442 flow [2024-01-27 15:36:12,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-27 15:36:12,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-01-27 15:36:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 436 transitions. [2024-01-27 15:36:12,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36333333333333334 [2024-01-27 15:36:12,499 INFO L175 Difference]: Start difference. First operand has 143 places, 85 transitions, 415 flow. Second operand 24 states and 436 transitions. [2024-01-27 15:36:12,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 230 transitions, 1442 flow [2024-01-27 15:36:12,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 230 transitions, 1368 flow, removed 31 selfloop flow, removed 13 redundant places. [2024-01-27 15:36:12,508 INFO L231 Difference]: Finished difference. Result has 126 places, 105 transitions, 626 flow [2024-01-27 15:36:12,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=626, PETRI_PLACES=126, PETRI_TRANSITIONS=105} [2024-01-27 15:36:12,509 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 78 predicate places. [2024-01-27 15:36:12,509 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 105 transitions, 626 flow [2024-01-27 15:36:12,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 15.36) internal successors, (384), 25 states have internal predecessors, (384), 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-01-27 15:36:12,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:36:12,510 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:36:12,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-01-27 15:36:12,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:36:12,722 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:36:12,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:36:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash 696714140, now seen corresponding path program 7 times [2024-01-27 15:36:12,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:36:12,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987234849] [2024-01-27 15:36:12,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:36:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:36:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:36:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-27 15:36:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:36:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987234849] [2024-01-27 15:36:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987234849] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:36:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513455574] [2024-01-27 15:36:12,933 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:36:12,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:36:12,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:36:12,949 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:36:12,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-01-27 15:36:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:36:13,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 15:36:13,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:36:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-27 15:36:13,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:36:13,529 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-27 15:36:13,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513455574] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:36:13,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:36:13,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 22 [2024-01-27 15:36:13,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952061360] [2024-01-27 15:36:13,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:36:13,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-01-27 15:36:13,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:36:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-01-27 15:36:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-01-27 15:36:13,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:36:13,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 105 transitions, 626 flow. Second operand has 22 states, 22 states have (on average 18.272727272727273) internal successors, (402), 22 states have internal predecessors, (402), 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-01-27 15:36:13,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:36:13,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:36:13,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:36:14,102 INFO L124 PetriNetUnfolderBase]: 1201/3052 cut-off events. [2024-01-27 15:36:14,103 INFO L125 PetriNetUnfolderBase]: For 4404/4564 co-relation queries the response was YES. [2024-01-27 15:36:14,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8240 conditions, 3052 events. 1201/3052 cut-off events. For 4404/4564 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 21145 event pairs, 764 based on Foata normal form. 68/3096 useless extension candidates. Maximal degree in co-relation 8212. Up to 1179 conditions per place. [2024-01-27 15:36:14,114 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 84 selfloop transitions, 7 changer transitions 73/183 dead transitions. [2024-01-27 15:36:14,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 183 transitions, 1377 flow [2024-01-27 15:36:14,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-01-27 15:36:14,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-01-27 15:36:14,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 245 transitions. [2024-01-27 15:36:14,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4083333333333333 [2024-01-27 15:36:14,115 INFO L175 Difference]: Start difference. First operand has 126 places, 105 transitions, 626 flow. Second operand 12 states and 245 transitions. [2024-01-27 15:36:14,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 183 transitions, 1377 flow [2024-01-27 15:36:14,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 183 transitions, 1290 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-01-27 15:36:14,127 INFO L231 Difference]: Finished difference. Result has 136 places, 106 transitions, 613 flow [2024-01-27 15:36:14,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=613, PETRI_PLACES=136, PETRI_TRANSITIONS=106} [2024-01-27 15:36:14,128 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 88 predicate places. [2024-01-27 15:36:14,128 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 106 transitions, 613 flow [2024-01-27 15:36:14,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 18.272727272727273) internal successors, (402), 22 states have internal predecessors, (402), 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-01-27 15:36:14,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:36:14,128 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:36:14,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-01-27 15:36:14,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:36:14,340 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:36:14,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:36:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2072740908, now seen corresponding path program 8 times [2024-01-27 15:36:14,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:36:14,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786488204] [2024-01-27 15:36:14,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:36:14,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:36:14,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:36:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:36:15,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:36:15,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786488204] [2024-01-27 15:36:15,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786488204] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:36:15,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968443189] [2024-01-27 15:36:15,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:36:15,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:36:15,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:36:15,846 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:36:15,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-01-27 15:36:16,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:36:16,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:36:16,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 44 conjunts are in the unsatisfiable core [2024-01-27 15:36:16,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:36:16,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:36:16,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2024-01-27 15:36:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-01-27 15:36:16,440 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:36:16,779 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-01-27 15:36:16,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2024-01-27 15:36:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-01-27 15:36:17,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968443189] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:36:17,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:36:17,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12, 11] total 43 [2024-01-27 15:36:17,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595814091] [2024-01-27 15:36:17,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:36:17,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-01-27 15:36:17,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:36:17,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-01-27 15:36:17,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1687, Unknown=0, NotChecked=0, Total=1806 [2024-01-27 15:36:17,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 50 [2024-01-27 15:36:17,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 106 transitions, 613 flow. Second operand has 43 states, 43 states have (on average 12.046511627906977) internal successors, (518), 43 states have internal predecessors, (518), 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-01-27 15:36:17,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:36:17,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 50 [2024-01-27 15:36:17,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:36:20,781 INFO L124 PetriNetUnfolderBase]: 1931/3900 cut-off events. [2024-01-27 15:36:20,781 INFO L125 PetriNetUnfolderBase]: For 10316/10316 co-relation queries the response was YES. [2024-01-27 15:36:20,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11964 conditions, 3900 events. 1931/3900 cut-off events. For 10316/10316 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 24371 event pairs, 221 based on Foata normal form. 270/4169 useless extension candidates. Maximal degree in co-relation 11930. Up to 564 conditions per place. [2024-01-27 15:36:20,802 INFO L140 encePairwiseOnDemand]: 36/50 looper letters, 180 selfloop transitions, 66 changer transitions 38/290 dead transitions. [2024-01-27 15:36:20,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 290 transitions, 1978 flow [2024-01-27 15:36:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-01-27 15:36:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-01-27 15:36:20,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 667 transitions. [2024-01-27 15:36:20,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29644444444444445 [2024-01-27 15:36:20,804 INFO L175 Difference]: Start difference. First operand has 136 places, 106 transitions, 613 flow. Second operand 45 states and 667 transitions. [2024-01-27 15:36:20,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 290 transitions, 1978 flow [2024-01-27 15:36:20,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 290 transitions, 1906 flow, removed 27 selfloop flow, removed 10 redundant places. [2024-01-27 15:36:20,822 INFO L231 Difference]: Finished difference. Result has 176 places, 117 transitions, 852 flow [2024-01-27 15:36:20,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=852, PETRI_PLACES=176, PETRI_TRANSITIONS=117} [2024-01-27 15:36:20,823 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 128 predicate places. [2024-01-27 15:36:20,823 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 117 transitions, 852 flow [2024-01-27 15:36:20,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 12.046511627906977) internal successors, (518), 43 states have internal predecessors, (518), 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-01-27 15:36:20,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:36:20,824 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:36:20,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-01-27 15:36:21,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-01-27 15:36:21,036 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:36:21,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:36:21,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1624842815, now seen corresponding path program 9 times [2024-01-27 15:36:21,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:36:21,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83940706] [2024-01-27 15:36:21,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:36:21,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:36:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:36:21,261 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-01-27 15:36:21,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:36:21,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83940706] [2024-01-27 15:36:21,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83940706] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:36:21,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295648554] [2024-01-27 15:36:21,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:36:21,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:36:21,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:36:21,263 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:36:21,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-01-27 15:36:21,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 15:36:21,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:36:21,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-27 15:36:21,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:36:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-01-27 15:36:21,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:36:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-01-27 15:36:21,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295648554] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:36:21,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:36:21,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2024-01-27 15:36:21,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692624202] [2024-01-27 15:36:21,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:36:21,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-27 15:36:21,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:36:21,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-27 15:36:21,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-01-27 15:36:21,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:36:21,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 117 transitions, 852 flow. Second operand has 20 states, 20 states have (on average 18.5) internal successors, (370), 20 states have internal predecessors, (370), 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-01-27 15:36:21,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:36:21,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:36:21,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:36:22,386 INFO L124 PetriNetUnfolderBase]: 1039/2856 cut-off events. [2024-01-27 15:36:22,386 INFO L125 PetriNetUnfolderBase]: For 8376/8516 co-relation queries the response was YES. [2024-01-27 15:36:22,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8623 conditions, 2856 events. 1039/2856 cut-off events. For 8376/8516 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 20070 event pairs, 882 based on Foata normal form. 46/2893 useless extension candidates. Maximal degree in co-relation 8579. Up to 1178 conditions per place. [2024-01-27 15:36:22,401 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 94 selfloop transitions, 9 changer transitions 78/196 dead transitions. [2024-01-27 15:36:22,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 196 transitions, 1777 flow [2024-01-27 15:36:22,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-27 15:36:22,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-27 15:36:22,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 210 transitions. [2024-01-27 15:36:22,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42 [2024-01-27 15:36:22,403 INFO L175 Difference]: Start difference. First operand has 176 places, 117 transitions, 852 flow. Second operand 10 states and 210 transitions. [2024-01-27 15:36:22,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 196 transitions, 1777 flow [2024-01-27 15:36:22,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 196 transitions, 1634 flow, removed 33 selfloop flow, removed 14 redundant places. [2024-01-27 15:36:22,427 INFO L231 Difference]: Finished difference. Result has 174 places, 118 transitions, 801 flow [2024-01-27 15:36:22,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=801, PETRI_PLACES=174, PETRI_TRANSITIONS=118} [2024-01-27 15:36:22,428 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 126 predicate places. [2024-01-27 15:36:22,428 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 118 transitions, 801 flow [2024-01-27 15:36:22,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 18.5) internal successors, (370), 20 states have internal predecessors, (370), 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-01-27 15:36:22,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:36:22,429 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:36:22,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-01-27 15:36:22,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-01-27 15:36:22,642 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:36:22,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:36:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1806638709, now seen corresponding path program 10 times [2024-01-27 15:36:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:36:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675392792] [2024-01-27 15:36:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:36:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:36:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:36:26,994 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:36:26,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:36:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675392792] [2024-01-27 15:36:26,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675392792] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:36:26,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31057012] [2024-01-27 15:36:26,995 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:36:26,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:36:26,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:36:26,998 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-27 15:36:27,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-01-27 15:36:27,227 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:36:27,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:36:27,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 89 conjunts are in the unsatisfiable core [2024-01-27 15:36:27,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:36:31,200 INFO L349 Elim1Store]: treesize reduction 174, result has 50.6 percent of original size [2024-01-27 15:36:31,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 150 treesize of output 214 [2024-01-27 15:36:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-01-27 15:36:31,213 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:36:36,172 INFO L349 Elim1Store]: treesize reduction 120, result has 90.3 percent of original size [2024-01-27 15:36:36,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 172 treesize of output 1161 [2024-01-27 15:38:36,729 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-01-27 15:38:36,730 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-27 15:38:36,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-01-27 15:38:36,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-01-27 15:38:36,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-01-27 15:38:36,931 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:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:516) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:500) 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:606) 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-01-27 15:38:36,936 INFO L158 Benchmark]: Toolchain (without parser) took 207265.83ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 85.8MB in the beginning and 812.7MB in the end (delta: -726.9MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-01-27 15:38:36,936 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-27 15:38:36,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.60ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 72.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-01-27 15:38:36,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.25ms. Allocated memory is still 155.2MB. Free memory was 72.3MB in the beginning and 69.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-27 15:38:36,937 INFO L158 Benchmark]: Boogie Preprocessor took 49.25ms. Allocated memory is still 155.2MB. Free memory was 69.7MB in the beginning and 66.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-27 15:38:36,937 INFO L158 Benchmark]: RCFGBuilder took 885.58ms. Allocated memory is still 155.2MB. Free memory was 66.3MB in the beginning and 103.9MB in the end (delta: -37.6MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-01-27 15:38:36,937 INFO L158 Benchmark]: TraceAbstraction took 206024.95ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 103.0MB in the beginning and 812.7MB in the end (delta: -709.7MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-01-27 15:38:36,939 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.13ms. Allocated memory is still 121.6MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.60ms. Allocated memory is still 155.2MB. Free memory was 85.6MB in the beginning and 72.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.25ms. Allocated memory is still 155.2MB. Free memory was 72.3MB in the beginning and 69.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.25ms. Allocated memory is still 155.2MB. Free memory was 69.7MB in the beginning and 66.3MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 885.58ms. Allocated memory is still 155.2MB. Free memory was 66.3MB in the beginning and 103.9MB in the end (delta: -37.6MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 206024.95ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 103.0MB in the beginning and 812.7MB in the end (delta: -709.7MB). Peak memory consumption was 1.2GB. 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/popl20-bad-ring.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 be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:38:38,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:38:38,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-01-27 15:38:38,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:38:38,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:38:38,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:38:38,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:38:38,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:38:38,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:38:38,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:38:38,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:38:38,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:38:38,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:38:38,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:38:38,963 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:38:38,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:38:38,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:38:38,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:38:38,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:38:38,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:38:38,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:38:38,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:38:38,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:38:38,966 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-01-27 15:38:38,966 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-01-27 15:38:38,966 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:38:38,966 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-01-27 15:38:38,966 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:38:38,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:38:38,967 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:38:38,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:38:38,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:38:38,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:38:38,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:38:38,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:38:38,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:38:38,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:38:38,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:38:38,970 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-01-27 15:38:38,970 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-01-27 15:38:38,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:38:38,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:38:38,971 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:38:38,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:38:38,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:38:38,971 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-01-27 15:38:38,971 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 -> be394a9cdc866c1e1426a3fe296e99873bcf37ee5e7e1c9e487b239a3e0a8fbe [2024-01-27 15:38:39,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:38:39,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:38:39,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:38:39,289 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:38:39,291 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:38:39,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2024-01-27 15:38:40,439 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:38:40,571 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:38:40,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c [2024-01-27 15:38:40,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379eec5d4/1f3d05f9521a45b0bede5784df7eac88/FLAGdb00041ff [2024-01-27 15:38:40,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379eec5d4/1f3d05f9521a45b0bede5784df7eac88 [2024-01-27 15:38:40,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:38:40,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:38:40,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:38:40,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:38:40,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:38:40,609 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:40,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b2c823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40, skipping insertion in model container [2024-01-27 15:38:40,610 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:40,637 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:38:40,811 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c[3986,3999] [2024-01-27 15:38:40,827 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:38:40,840 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-01-27 15:38:40,847 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:38:40,877 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c[3986,3999] [2024-01-27 15:38:40,880 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:38:40,887 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:38:40,916 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring.wvr.c[3986,3999] [2024-01-27 15:38:40,921 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:38:40,939 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:38:40,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40 WrapperNode [2024-01-27 15:38:40,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:38:40,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:38:40,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:38:40,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:38:40,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:40,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:41,028 INFO L138 Inliner]: procedures = 27, calls = 61, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 320 [2024-01-27 15:38:41,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:38:41,030 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:38:41,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:38:41,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:38:41,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:41,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:41,064 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:41,079 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 2, 2, 2, 10]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 1, 1, 3]. [2024-01-27 15:38:41,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:41,087 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:41,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:41,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:41,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:41,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:41,125 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:38:41,126 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:38:41,126 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:38:41,126 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:38:41,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (1/1) ... [2024-01-27 15:38:41,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:38:41,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:38:41,153 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-01-27 15:38:41,170 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-01-27 15:38:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:38:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-01-27 15:38:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-01-27 15:38:41,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-01-27 15:38:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-01-27 15:38:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-01-27 15:38:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:38:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-01-27 15:38:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-01-27 15:38:41,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-01-27 15:38:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-01-27 15:38:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-01-27 15:38:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:38:41,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:38:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:38:41,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:38:41,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:38:41,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:38:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:38:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:38:41,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-27 15:38:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:38:41,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:38:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:38:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-01-27 15:38:41,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-01-27 15:38:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-01-27 15:38:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-01-27 15:38:41,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-01-27 15:38:41,196 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:38:41,299 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:38:41,301 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:38:41,721 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:38:41,721 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:38:41,954 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:38:41,954 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-01-27 15:38:41,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:38:41 BoogieIcfgContainer [2024-01-27 15:38:41,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:38:41,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:38:41,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:38:41,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:38:41,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:38:40" (1/3) ... [2024-01-27 15:38:41,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a9489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:38:41, skipping insertion in model container [2024-01-27 15:38:41,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:38:40" (2/3) ... [2024-01-27 15:38:41,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60a9489 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:38:41, skipping insertion in model container [2024-01-27 15:38:41,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:38:41" (3/3) ... [2024-01-27 15:38:41,961 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring.wvr.c [2024-01-27 15:38:41,968 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:38:41,975 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:38:41,975 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:38:41,975 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:38:42,024 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 15:38:42,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 50 transitions, 121 flow [2024-01-27 15:38:42,069 INFO L124 PetriNetUnfolderBase]: 8/47 cut-off events. [2024-01-27 15:38:42,069 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:38:42,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 8/47 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2024-01-27 15:38:42,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 50 transitions, 121 flow [2024-01-27 15:38:42,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 46 transitions, 110 flow [2024-01-27 15:38:42,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:38:42,085 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;@436cf478, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:38:42,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:38:42,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:38:42,097 INFO L124 PetriNetUnfolderBase]: 8/45 cut-off events. [2024-01-27 15:38:42,097 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:38:42,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:42,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:42,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:42,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:42,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1091535067, now seen corresponding path program 1 times [2024-01-27 15:38:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:42,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623116306] [2024-01-27 15:38:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:38:42,112 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-01-27 15:38:42,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:42,113 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-01-27 15:38:42,114 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-01-27 15:38:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:38:42,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjunts are in the unsatisfiable core [2024-01-27 15:38:42,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:38:42,339 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:38:42,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:42,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623116306] [2024-01-27 15:38:42,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623116306] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:38:42,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:38:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:38:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918896190] [2024-01-27 15:38:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:38:42,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-27 15:38:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:42,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-27 15:38:42,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-27 15:38:42,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:42,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 110 flow. Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-01-27 15:38:42,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:42,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:42,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:42,673 INFO L124 PetriNetUnfolderBase]: 1093/1873 cut-off events. [2024-01-27 15:38:42,674 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-01-27 15:38:42,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3462 conditions, 1873 events. 1093/1873 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9987 event pairs, 902 based on Foata normal form. 176/1864 useless extension candidates. Maximal degree in co-relation 3107. Up to 1468 conditions per place. [2024-01-27 15:38:42,684 INFO L140 encePairwiseOnDemand]: 48/50 looper letters, 34 selfloop transitions, 0 changer transitions 0/44 dead transitions. [2024-01-27 15:38:42,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 174 flow [2024-01-27 15:38:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-27 15:38:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-01-27 15:38:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2024-01-27 15:38:42,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.62 [2024-01-27 15:38:42,694 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 110 flow. Second operand 2 states and 62 transitions. [2024-01-27 15:38:42,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 174 flow [2024-01-27 15:38:42,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 162 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:38:42,699 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 94 flow [2024-01-27 15:38:42,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2024-01-27 15:38:42,703 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2024-01-27 15:38:42,703 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 94 flow [2024-01-27 15:38:42,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-01-27 15:38:42,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:42,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:42,709 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 (2)] Ended with exit code 0 [2024-01-27 15:38:42,907 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-01-27 15:38:42,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:42,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1466539391, now seen corresponding path program 1 times [2024-01-27 15:38:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:42,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694449102] [2024-01-27 15:38:42,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:38:42,909 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-01-27 15:38:42,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:42,910 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-01-27 15:38:42,911 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-01-27 15:38:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:38:43,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2024-01-27 15:38:43,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:43,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:38:43,085 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:38:43,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:43,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694449102] [2024-01-27 15:38:43,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694449102] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:38:43,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:38:43,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:38:43,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902765495] [2024-01-27 15:38:43,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:38:43,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:38:43,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:43,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:38:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:38:43,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:43,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:38:43,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:43,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:43,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:43,347 INFO L124 PetriNetUnfolderBase]: 1084/1806 cut-off events. [2024-01-27 15:38:43,348 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-01-27 15:38:43,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3371 conditions, 1806 events. 1084/1806 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9161 event pairs, 281 based on Foata normal form. 33/1736 useless extension candidates. Maximal degree in co-relation 3368. Up to 1325 conditions per place. [2024-01-27 15:38:43,355 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 44 selfloop transitions, 3 changer transitions 0/57 dead transitions. [2024-01-27 15:38:43,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 216 flow [2024-01-27 15:38:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:38:43,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:38:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-01-27 15:38:43,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-01-27 15:38:43,357 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 94 flow. Second operand 3 states and 87 transitions. [2024-01-27 15:38:43,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 216 flow [2024-01-27 15:38:43,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 57 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:38:43,359 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 113 flow [2024-01-27 15:38:43,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2024-01-27 15:38:43,360 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2024-01-27 15:38:43,360 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 113 flow [2024-01-27 15:38:43,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:38:43,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:43,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:43,377 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 (3)] Forceful destruction successful, exit code 0 [2024-01-27 15:38:43,564 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-01-27 15:38:43,564 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:43,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:43,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1751936597, now seen corresponding path program 2 times [2024-01-27 15:38:43,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:43,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225506146] [2024-01-27 15:38:43,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:38:43,566 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-01-27 15:38:43,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:43,567 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-01-27 15:38:43,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 (4)] Waiting until timeout for monitored process [2024-01-27 15:38:43,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-01-27 15:38:43,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:38:43,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2024-01-27 15:38:43,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:43,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:38:43,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:38:43,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:43,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225506146] [2024-01-27 15:38:43,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225506146] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:38:43,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:38:43,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:38:43,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567227701] [2024-01-27 15:38:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:38:43,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:38:43,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:43,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:38:43,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:38:43,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:43,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:38:43,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:43,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:43,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:43,957 INFO L124 PetriNetUnfolderBase]: 914/1637 cut-off events. [2024-01-27 15:38:43,957 INFO L125 PetriNetUnfolderBase]: For 246/248 co-relation queries the response was YES. [2024-01-27 15:38:43,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3293 conditions, 1637 events. 914/1637 cut-off events. For 246/248 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8532 event pairs, 331 based on Foata normal form. 35/1556 useless extension candidates. Maximal degree in co-relation 3288. Up to 847 conditions per place. [2024-01-27 15:38:43,964 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 48 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-01-27 15:38:43,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 249 flow [2024-01-27 15:38:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:38:43,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:38:43,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-01-27 15:38:43,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2024-01-27 15:38:43,966 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 113 flow. Second operand 3 states and 88 transitions. [2024-01-27 15:38:43,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 249 flow [2024-01-27 15:38:43,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:38:43,967 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 122 flow [2024-01-27 15:38:43,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2024-01-27 15:38:43,968 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2024-01-27 15:38:43,968 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 122 flow [2024-01-27 15:38:43,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:38:43,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:43,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:43,978 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-01-27 15:38:44,172 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-01-27 15:38:44,175 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:44,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:44,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1777995587, now seen corresponding path program 3 times [2024-01-27 15:38:44,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:44,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822084933] [2024-01-27 15:38:44,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:38:44,176 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-01-27 15:38:44,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:44,177 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-01-27 15:38:44,187 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-01-27 15:38:44,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-01-27 15:38:44,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:38:44,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2024-01-27 15:38:44,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:38:44,337 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:38:44,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:44,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822084933] [2024-01-27 15:38:44,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822084933] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:38:44,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:38:44,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:38:44,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273062169] [2024-01-27 15:38:44,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:38:44,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:38:44,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:44,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:38:44,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:38:44,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:44,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:38:44,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:44,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:44,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:44,604 INFO L124 PetriNetUnfolderBase]: 1402/2350 cut-off events. [2024-01-27 15:38:44,605 INFO L125 PetriNetUnfolderBase]: For 507/535 co-relation queries the response was YES. [2024-01-27 15:38:44,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5223 conditions, 2350 events. 1402/2350 cut-off events. For 507/535 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13348 event pairs, 461 based on Foata normal form. 1/2245 useless extension candidates. Maximal degree in co-relation 5217. Up to 1241 conditions per place. [2024-01-27 15:38:44,613 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 50 selfloop transitions, 2 changer transitions 8/70 dead transitions. [2024-01-27 15:38:44,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 70 transitions, 302 flow [2024-01-27 15:38:44,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:38:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:38:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-01-27 15:38:44,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2024-01-27 15:38:44,615 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 122 flow. Second operand 3 states and 98 transitions. [2024-01-27 15:38:44,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 70 transitions, 302 flow [2024-01-27 15:38:44,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 299 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:38:44,617 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 128 flow [2024-01-27 15:38:44,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-01-27 15:38:44,618 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2024-01-27 15:38:44,618 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 128 flow [2024-01-27 15:38:44,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-01-27 15:38:44,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:44,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:44,626 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-01-27 15:38:44,821 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-01-27 15:38:44,822 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:44,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:44,822 INFO L85 PathProgramCache]: Analyzing trace with hash -395479253, now seen corresponding path program 1 times [2024-01-27 15:38:44,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:44,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165996120] [2024-01-27 15:38:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:38:44,823 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-01-27 15:38:44,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:44,824 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-01-27 15:38:44,863 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-01-27 15:38:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:38:44,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjunts are in the unsatisfiable core [2024-01-27 15:38:44,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:38:44,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:38:44,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:44,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165996120] [2024-01-27 15:38:44,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165996120] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:38:44,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:38:44,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:38:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506131251] [2024-01-27 15:38:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:38:44,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:38:44,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:38:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:38:45,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:45,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:45,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:45,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:45,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:45,154 INFO L124 PetriNetUnfolderBase]: 517/859 cut-off events. [2024-01-27 15:38:45,154 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-01-27 15:38:45,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1966 conditions, 859 events. 517/859 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3995 event pairs, 198 based on Foata normal form. 44/864 useless extension candidates. Maximal degree in co-relation 1959. Up to 579 conditions per place. [2024-01-27 15:38:45,158 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 41 selfloop transitions, 2 changer transitions 1/54 dead transitions. [2024-01-27 15:38:45,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 54 transitions, 236 flow [2024-01-27 15:38:45,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:38:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:38:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-01-27 15:38:45,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-01-27 15:38:45,159 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 128 flow. Second operand 3 states and 82 transitions. [2024-01-27 15:38:45,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 54 transitions, 236 flow [2024-01-27 15:38:45,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 54 transitions, 232 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:38:45,165 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 136 flow [2024-01-27 15:38:45,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-01-27 15:38:45,166 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2024-01-27 15:38:45,166 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 136 flow [2024-01-27 15:38:45,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:45,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:45,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:45,192 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-01-27 15:38:45,367 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-01-27 15:38:45,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:45,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:45,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1677173475, now seen corresponding path program 2 times [2024-01-27 15:38:45,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:45,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967036938] [2024-01-27 15:38:45,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:38:45,369 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-01-27 15:38:45,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:45,370 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-01-27 15:38:45,388 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-01-27 15:38:45,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-01-27 15:38:45,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:38:45,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:38:45,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:45,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:38:45,617 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:38:45,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:45,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967036938] [2024-01-27 15:38:45,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967036938] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:38:45,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:38:45,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:38:45,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752007931] [2024-01-27 15:38:45,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:38:45,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:38:45,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:45,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:38:45,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:38:45,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:45,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:45,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:45,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:45,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:45,823 INFO L124 PetriNetUnfolderBase]: 566/965 cut-off events. [2024-01-27 15:38:45,823 INFO L125 PetriNetUnfolderBase]: For 269/269 co-relation queries the response was YES. [2024-01-27 15:38:45,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2264 conditions, 965 events. 566/965 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 4576 event pairs, 425 based on Foata normal form. 13/931 useless extension candidates. Maximal degree in co-relation 2256. Up to 778 conditions per place. [2024-01-27 15:38:45,827 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 37 selfloop transitions, 2 changer transitions 15/64 dead transitions. [2024-01-27 15:38:45,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 279 flow [2024-01-27 15:38:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:38:45,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:38:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-01-27 15:38:45,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-01-27 15:38:45,829 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 136 flow. Second operand 4 states and 103 transitions. [2024-01-27 15:38:45,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 279 flow [2024-01-27 15:38:45,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 277 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:38:45,830 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 148 flow [2024-01-27 15:38:45,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2024-01-27 15:38:45,831 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 8 predicate places. [2024-01-27 15:38:45,831 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 148 flow [2024-01-27 15:38:45,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:45,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:45,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:45,856 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-01-27 15:38:46,035 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-01-27 15:38:46,035 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:46,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash -523998249, now seen corresponding path program 1 times [2024-01-27 15:38:46,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:46,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135824895] [2024-01-27 15:38:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:38:46,036 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-01-27 15:38:46,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:46,038 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-01-27 15:38:46,039 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-01-27 15:38:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:38:46,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2024-01-27 15:38:46,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:38:46,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:38:46,698 INFO L349 Elim1Store]: treesize reduction 210, result has 3.2 percent of original size [2024-01-27 15:38:46,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 91 treesize of output 28 [2024-01-27 15:38:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:38:46,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:46,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135824895] [2024-01-27 15:38:46,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135824895] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-27 15:38:46,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-27 15:38:46,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 11 [2024-01-27 15:38:46,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244203852] [2024-01-27 15:38:46,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:38:46,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:38:46,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:46,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:38:46,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-01-27 15:38:46,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-01-27 15:38:46,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:46,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:46,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-01-27 15:38:46,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:47,234 INFO L124 PetriNetUnfolderBase]: 946/1507 cut-off events. [2024-01-27 15:38:47,234 INFO L125 PetriNetUnfolderBase]: For 464/476 co-relation queries the response was YES. [2024-01-27 15:38:47,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3563 conditions, 1507 events. 946/1507 cut-off events. For 464/476 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7491 event pairs, 167 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3553. Up to 835 conditions per place. [2024-01-27 15:38:47,240 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 66 selfloop transitions, 5 changer transitions 1/80 dead transitions. [2024-01-27 15:38:47,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 377 flow [2024-01-27 15:38:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:38:47,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:38:47,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-01-27 15:38:47,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.492 [2024-01-27 15:38:47,241 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 148 flow. Second operand 5 states and 123 transitions. [2024-01-27 15:38:47,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 377 flow [2024-01-27 15:38:47,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 80 transitions, 371 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-27 15:38:47,243 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 168 flow [2024-01-27 15:38:47,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2024-01-27 15:38:47,244 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2024-01-27 15:38:47,244 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 168 flow [2024-01-27 15:38:47,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:47,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:47,244 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:47,248 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-01-27 15:38:47,448 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-01-27 15:38:47,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:47,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:47,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1280701513, now seen corresponding path program 1 times [2024-01-27 15:38:47,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:47,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227458491] [2024-01-27 15:38:47,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:38:47,450 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-01-27 15:38:47,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:47,451 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-01-27 15:38:47,452 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-01-27 15:38:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:38:47,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 15:38:47,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:38:47,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:38:47,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-27 15:38:47,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 10 [2024-01-27 15:38:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:38:48,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227458491] [2024-01-27 15:38:48,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227458491] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:38:48,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:38:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-01-27 15:38:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448219426] [2024-01-27 15:38:48,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:38:48,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-01-27 15:38:48,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:48,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-01-27 15:38:48,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-01-27 15:38:48,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:48,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 168 flow. Second operand has 14 states, 14 states have (on average 17.142857142857142) internal successors, (240), 14 states have internal predecessors, (240), 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-01-27 15:38:48,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:48,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:48,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:48,800 INFO L124 PetriNetUnfolderBase]: 774/1344 cut-off events. [2024-01-27 15:38:48,801 INFO L125 PetriNetUnfolderBase]: For 1256/1334 co-relation queries the response was YES. [2024-01-27 15:38:48,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3471 conditions, 1344 events. 774/1344 cut-off events. For 1256/1334 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6588 event pairs, 406 based on Foata normal form. 42/1331 useless extension candidates. Maximal degree in co-relation 3461. Up to 881 conditions per place. [2024-01-27 15:38:48,807 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 44 selfloop transitions, 4 changer transitions 37/96 dead transitions. [2024-01-27 15:38:48,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 461 flow [2024-01-27 15:38:48,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-27 15:38:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-27 15:38:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2024-01-27 15:38:48,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-01-27 15:38:48,808 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 168 flow. Second operand 9 states and 200 transitions. [2024-01-27 15:38:48,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 461 flow [2024-01-27 15:38:48,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 96 transitions, 454 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-27 15:38:48,810 INFO L231 Difference]: Finished difference. Result has 70 places, 52 transitions, 192 flow [2024-01-27 15:38:48,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=192, PETRI_PLACES=70, PETRI_TRANSITIONS=52} [2024-01-27 15:38:48,811 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 22 predicate places. [2024-01-27 15:38:48,811 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 52 transitions, 192 flow [2024-01-27 15:38:48,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.142857142857142) internal successors, (240), 14 states have internal predecessors, (240), 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-01-27 15:38:48,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:48,812 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:48,818 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-01-27 15:38:49,015 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-01-27 15:38:49,016 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:49,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2145893909, now seen corresponding path program 2 times [2024-01-27 15:38:49,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:49,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617028132] [2024-01-27 15:38:49,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:38:49,018 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-01-27 15:38:49,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:49,019 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-01-27 15:38:49,045 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-01-27 15:38:49,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-01-27 15:38:49,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:38:49,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:38:49,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:38:49,249 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:38:49,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:49,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617028132] [2024-01-27 15:38:49,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617028132] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:38:49,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:38:49,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:38:49,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14463265] [2024-01-27 15:38:49,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:38:49,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:38:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:49,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:38:49,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:38:49,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:49,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 52 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:49,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:49,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:49,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:49,526 INFO L124 PetriNetUnfolderBase]: 734/1248 cut-off events. [2024-01-27 15:38:49,526 INFO L125 PetriNetUnfolderBase]: For 1578/1632 co-relation queries the response was YES. [2024-01-27 15:38:49,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3463 conditions, 1248 events. 734/1248 cut-off events. For 1578/1632 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6080 event pairs, 570 based on Foata normal form. 6/1200 useless extension candidates. Maximal degree in co-relation 3448. Up to 979 conditions per place. [2024-01-27 15:38:49,532 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 40 selfloop transitions, 2 changer transitions 15/68 dead transitions. [2024-01-27 15:38:49,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 353 flow [2024-01-27 15:38:49,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:38:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:38:49,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-01-27 15:38:49,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-01-27 15:38:49,533 INFO L175 Difference]: Start difference. First operand has 70 places, 52 transitions, 192 flow. Second operand 4 states and 103 transitions. [2024-01-27 15:38:49,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 353 flow [2024-01-27 15:38:49,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 68 transitions, 327 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-01-27 15:38:49,536 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 186 flow [2024-01-27 15:38:49,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2024-01-27 15:38:49,536 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2024-01-27 15:38:49,536 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 186 flow [2024-01-27 15:38:49,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:49,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:49,537 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:49,541 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 (10)] Ended with exit code 0 [2024-01-27 15:38:49,740 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-01-27 15:38:49,740 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:49,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:49,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1690506399, now seen corresponding path program 1 times [2024-01-27 15:38:49,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:49,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228723212] [2024-01-27 15:38:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:38:49,741 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-01-27 15:38:49,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:49,742 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-01-27 15:38:49,744 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-01-27 15:38:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:38:49,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:38:49,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:49,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:38:49,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:38:50,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:38:50,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:50,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228723212] [2024-01-27 15:38:50,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228723212] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:38:50,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:38:50,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-01-27 15:38:50,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705858542] [2024-01-27 15:38:50,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:38:50,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 15:38:50,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:50,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 15:38:50,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-01-27 15:38:50,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:50,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 186 flow. Second operand has 8 states, 8 states have (on average 19.125) internal successors, (153), 8 states have internal predecessors, (153), 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-01-27 15:38:50,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:50,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:50,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:50,659 INFO L124 PetriNetUnfolderBase]: 1225/2200 cut-off events. [2024-01-27 15:38:50,659 INFO L125 PetriNetUnfolderBase]: For 2122/2254 co-relation queries the response was YES. [2024-01-27 15:38:50,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5583 conditions, 2200 events. 1225/2200 cut-off events. For 2122/2254 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 13986 event pairs, 273 based on Foata normal form. 60/2243 useless extension candidates. Maximal degree in co-relation 5569. Up to 639 conditions per place. [2024-01-27 15:38:50,670 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 81 selfloop transitions, 8 changer transitions 1/101 dead transitions. [2024-01-27 15:38:50,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 505 flow [2024-01-27 15:38:50,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:38:50,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:38:50,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-01-27 15:38:50,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.596 [2024-01-27 15:38:50,672 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 186 flow. Second operand 5 states and 149 transitions. [2024-01-27 15:38:50,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 505 flow [2024-01-27 15:38:50,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 499 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-27 15:38:50,675 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 239 flow [2024-01-27 15:38:50,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=239, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2024-01-27 15:38:50,675 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2024-01-27 15:38:50,676 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 239 flow [2024-01-27 15:38:50,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.125) internal successors, (153), 8 states have internal predecessors, (153), 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-01-27 15:38:50,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:50,676 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:50,684 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 (11)] Forceful destruction successful, exit code 0 [2024-01-27 15:38:50,880 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-01-27 15:38:50,880 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:50,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:50,881 INFO L85 PathProgramCache]: Analyzing trace with hash 365090061, now seen corresponding path program 2 times [2024-01-27 15:38:50,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:50,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935278167] [2024-01-27 15:38:50,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:38:50,881 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-01-27 15:38:50,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:50,882 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-01-27 15:38:50,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 (12)] Waiting until timeout for monitored process [2024-01-27 15:38:51,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:38:51,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:38:51,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 15:38:51,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:51,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:38:51,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:38:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:38:51,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:51,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935278167] [2024-01-27 15:38:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1935278167] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:38:51,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:38:51,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-01-27 15:38:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376415957] [2024-01-27 15:38:51,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:38:51,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-27 15:38:51,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:51,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-27 15:38:51,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-01-27 15:38:51,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:51,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 239 flow. Second operand has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 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-01-27 15:38:51,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:51,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:51,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:52,497 INFO L124 PetriNetUnfolderBase]: 1734/3277 cut-off events. [2024-01-27 15:38:52,498 INFO L125 PetriNetUnfolderBase]: For 5258/5426 co-relation queries the response was YES. [2024-01-27 15:38:52,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9167 conditions, 3277 events. 1734/3277 cut-off events. For 5258/5426 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 22690 event pairs, 1171 based on Foata normal form. 126/3378 useless extension candidates. Maximal degree in co-relation 9152. Up to 1812 conditions per place. [2024-01-27 15:38:52,515 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 45 selfloop transitions, 3 changer transitions 39/98 dead transitions. [2024-01-27 15:38:52,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 98 transitions, 579 flow [2024-01-27 15:38:52,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:38:52,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:38:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-01-27 15:38:52,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49 [2024-01-27 15:38:52,517 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 239 flow. Second operand 6 states and 147 transitions. [2024-01-27 15:38:52,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 98 transitions, 579 flow [2024-01-27 15:38:52,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 98 transitions, 556 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-01-27 15:38:52,521 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 247 flow [2024-01-27 15:38:52,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-01-27 15:38:52,522 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 27 predicate places. [2024-01-27 15:38:52,522 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 247 flow [2024-01-27 15:38:52,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.3) internal successors, (193), 10 states have internal predecessors, (193), 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-01-27 15:38:52,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:52,522 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:52,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 (12)] Forceful destruction successful, exit code 0 [2024-01-27 15:38:52,728 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-01-27 15:38:52,728 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:52,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1037344123, now seen corresponding path program 3 times [2024-01-27 15:38:52,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:52,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1873467734] [2024-01-27 15:38:52,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:38:52,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-01-27 15:38:52,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:52,730 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-01-27 15:38:52,760 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-01-27 15:38:53,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-27 15:38:53,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:38:53,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 15:38:53,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-01-27 15:38:53,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:38:53,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:53,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1873467734] [2024-01-27 15:38:53,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1873467734] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:38:53,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:38:53,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-01-27 15:38:53,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198853214] [2024-01-27 15:38:53,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:38:53,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 15:38:53,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:53,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 15:38:53,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-01-27 15:38:53,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 50 [2024-01-27 15:38:53,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:53,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:53,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 50 [2024-01-27 15:38:53,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:54,258 INFO L124 PetriNetUnfolderBase]: 2495/4433 cut-off events. [2024-01-27 15:38:54,258 INFO L125 PetriNetUnfolderBase]: For 5809/5949 co-relation queries the response was YES. [2024-01-27 15:38:54,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11703 conditions, 4433 events. 2495/4433 cut-off events. For 5809/5949 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 28964 event pairs, 169 based on Foata normal form. 210/4636 useless extension candidates. Maximal degree in co-relation 11684. Up to 2985 conditions per place. [2024-01-27 15:38:54,314 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 83 selfloop transitions, 6 changer transitions 1/99 dead transitions. [2024-01-27 15:38:54,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 99 transitions, 569 flow [2024-01-27 15:38:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:38:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:38:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 152 transitions. [2024-01-27 15:38:54,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4342857142857143 [2024-01-27 15:38:54,317 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 247 flow. Second operand 7 states and 152 transitions. [2024-01-27 15:38:54,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 99 transitions, 569 flow [2024-01-27 15:38:54,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 99 transitions, 555 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-01-27 15:38:54,323 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 261 flow [2024-01-27 15:38:54,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2024-01-27 15:38:54,337 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2024-01-27 15:38:54,337 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 261 flow [2024-01-27 15:38:54,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.285714285714285) internal successors, (114), 7 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:38:54,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:54,338 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:54,359 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-01-27 15:38:54,538 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-01-27 15:38:54,539 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:54,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:54,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1437802204, now seen corresponding path program 1 times [2024-01-27 15:38:54,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:54,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576486057] [2024-01-27 15:38:54,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:38:54,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-01-27 15:38:54,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:54,541 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-01-27 15:38:54,547 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-01-27 15:38:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:38:55,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:38:55,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-27 15:38:55,102 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-27 15:38:55,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:55,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576486057] [2024-01-27 15:38:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576486057] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:38:55,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:38:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:38:55,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332411749] [2024-01-27 15:38:55,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:38:55,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:38:55,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:55,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:38:55,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:38:55,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:55,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 261 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-01-27 15:38:55,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:55,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:55,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:55,573 INFO L124 PetriNetUnfolderBase]: 1685/3392 cut-off events. [2024-01-27 15:38:55,573 INFO L125 PetriNetUnfolderBase]: For 4987/5167 co-relation queries the response was YES. [2024-01-27 15:38:55,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9465 conditions, 3392 events. 1685/3392 cut-off events. For 4987/5167 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 23703 event pairs, 1290 based on Foata normal form. 2/3332 useless extension candidates. Maximal degree in co-relation 9447. Up to 2362 conditions per place. [2024-01-27 15:38:55,591 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 49 selfloop transitions, 2 changer transitions 15/77 dead transitions. [2024-01-27 15:38:55,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 77 transitions, 453 flow [2024-01-27 15:38:55,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:38:55,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:38:55,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-01-27 15:38:55,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.515 [2024-01-27 15:38:55,593 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 261 flow. Second operand 4 states and 103 transitions. [2024-01-27 15:38:55,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 77 transitions, 453 flow [2024-01-27 15:38:55,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 77 transitions, 439 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-01-27 15:38:55,597 INFO L231 Difference]: Finished difference. Result has 78 places, 62 transitions, 267 flow [2024-01-27 15:38:55,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=78, PETRI_TRANSITIONS=62} [2024-01-27 15:38:55,598 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 30 predicate places. [2024-01-27 15:38:55,598 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 62 transitions, 267 flow [2024-01-27 15:38:55,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-01-27 15:38:55,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:55,598 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:55,614 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-01-27 15:38:55,803 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-01-27 15:38:55,803 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:55,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1957371880, now seen corresponding path program 1 times [2024-01-27 15:38:55,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:55,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058125686] [2024-01-27 15:38:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:38:55,805 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-01-27 15:38:55,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:55,805 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-01-27 15:38:55,825 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-01-27 15:38:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:38:56,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:38:56,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-27 15:38:56,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:38:56,358 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-27 15:38:56,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:56,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058125686] [2024-01-27 15:38:56,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058125686] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:38:56,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:38:56,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-01-27 15:38:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581466431] [2024-01-27 15:38:56,359 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:38:56,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 15:38:56,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:56,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 15:38:56,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-01-27 15:38:56,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:56,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 62 transitions, 267 flow. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 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-01-27 15:38:56,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:56,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:56,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:57,441 INFO L124 PetriNetUnfolderBase]: 3337/6908 cut-off events. [2024-01-27 15:38:57,442 INFO L125 PetriNetUnfolderBase]: For 8307/8419 co-relation queries the response was YES. [2024-01-27 15:38:57,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17899 conditions, 6908 events. 3337/6908 cut-off events. For 8307/8419 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 55786 event pairs, 711 based on Foata normal form. 206/7102 useless extension candidates. Maximal degree in co-relation 17878. Up to 1895 conditions per place. [2024-01-27 15:38:57,499 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 96 selfloop transitions, 7 changer transitions 1/115 dead transitions. [2024-01-27 15:38:57,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 115 transitions, 693 flow [2024-01-27 15:38:57,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:38:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:38:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-01-27 15:38:57,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-01-27 15:38:57,502 INFO L175 Difference]: Start difference. First operand has 78 places, 62 transitions, 267 flow. Second operand 5 states and 145 transitions. [2024-01-27 15:38:57,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 115 transitions, 693 flow [2024-01-27 15:38:57,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 687 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-01-27 15:38:57,510 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 316 flow [2024-01-27 15:38:57,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2024-01-27 15:38:57,511 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 33 predicate places. [2024-01-27 15:38:57,511 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 316 flow [2024-01-27 15:38:57,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 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-01-27 15:38:57,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:57,512 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:57,534 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 (15)] Ended with exit code 0 [2024-01-27 15:38:57,717 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-01-27 15:38:57,718 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:38:57,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:38:57,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1088475872, now seen corresponding path program 2 times [2024-01-27 15:38:57,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:38:57,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214389165] [2024-01-27 15:38:57,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:38:57,719 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-01-27 15:38:57,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:38:57,720 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-01-27 15:38:57,722 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-01-27 15:38:58,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:38:58,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:38:58,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 13 conjunts are in the unsatisfiable core [2024-01-27 15:38:58,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:38:58,299 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-01-27 15:38:58,299 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:38:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-01-27 15:38:58,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-27 15:38:58,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214389165] [2024-01-27 15:38:58,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214389165] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:38:58,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-27 15:38:58,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-01-27 15:38:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859558917] [2024-01-27 15:38:58,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-27 15:38:58,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 15:38:58,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-27 15:38:58,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 15:38:58,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-01-27 15:38:58,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 50 [2024-01-27 15:38:58,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 316 flow. Second operand has 12 states, 12 states have (on average 18.75) internal successors, (225), 12 states have internal predecessors, (225), 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-01-27 15:38:58,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:38:58,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 50 [2024-01-27 15:38:58,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:38:59,885 INFO L124 PetriNetUnfolderBase]: 3469/7405 cut-off events. [2024-01-27 15:38:59,885 INFO L125 PetriNetUnfolderBase]: For 12374/12410 co-relation queries the response was YES. [2024-01-27 15:38:59,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20735 conditions, 7405 events. 3469/7405 cut-off events. For 12374/12410 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 60036 event pairs, 1982 based on Foata normal form. 30/7349 useless extension candidates. Maximal degree in co-relation 20713. Up to 4803 conditions per place. [2024-01-27 15:38:59,949 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 52 selfloop transitions, 5 changer transitions 33/101 dead transitions. [2024-01-27 15:38:59,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 101 transitions, 638 flow [2024-01-27 15:38:59,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-27 15:38:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-27 15:38:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 181 transitions. [2024-01-27 15:38:59,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4525 [2024-01-27 15:38:59,951 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 316 flow. Second operand 8 states and 181 transitions. [2024-01-27 15:38:59,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 101 transitions, 638 flow [2024-01-27 15:38:59,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 101 transitions, 623 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-01-27 15:38:59,958 INFO L231 Difference]: Finished difference. Result has 90 places, 67 transitions, 332 flow [2024-01-27 15:38:59,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=332, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2024-01-27 15:38:59,959 INFO L281 CegarLoopForPetriNet]: 48 programPoint places, 42 predicate places. [2024-01-27 15:38:59,959 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 332 flow [2024-01-27 15:38:59,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.75) internal successors, (225), 12 states have internal predecessors, (225), 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-01-27 15:38:59,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:38:59,959 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:38:59,965 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 (16)] Forceful destruction successful, exit code 0 [2024-01-27 15:39:00,165 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-01-27 15:39:00,165 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-27 15:39:00,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:39:00,166 INFO L85 PathProgramCache]: Analyzing trace with hash 931302052, now seen corresponding path program 3 times [2024-01-27 15:39:00,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-27 15:39:00,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011338762] [2024-01-27 15:39:00,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:39:00,167 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-01-27 15:39:00,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-27 15:39:00,168 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-01-27 15:39:00,169 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-01-27 15:39:00,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 15:39:00,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:39:00,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 16 conjunts are in the unsatisfiable core [2024-01-27 15:39:00,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:39:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-01-27 15:39:01,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:39:25,946 WARN L293 SmtUtils]: Spent 23.11s on a formula simplification. DAG size of input: 917 DAG size of output: 751 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-01-27 15:39:25,946 INFO L349 Elim1Store]: treesize reduction 626, result has 85.9 percent of original size [2024-01-27 15:39:25,947 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 24 new quantified variables, introduced 276 case distinctions, treesize of input 314 treesize of output 3883 Killed by 15