./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-5.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/parallel-misc-5.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 103efe8931e099ca6c2446ad32c4c46818a6d213fc850bc42032bda38d601e6f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:32:10,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:32:10,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:32:10,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:32:10,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:32:10,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:32:10,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:32:10,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:32:10,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:32:10,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:32:10,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:32:10,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:32:10,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:32:10,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:32:10,578 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:32:10,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:32:10,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:32:10,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:32:10,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:32:10,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:32:10,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:32:10,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:32:10,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:32:10,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:32:10,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:32:10,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:32:10,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:32:10,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:32:10,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:32:10,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:32:10,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:32:10,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:32:10,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:32:10,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:32:10,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:32:10,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:32:10,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:32:10,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:32:10,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:32:10,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:32:10,586 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:32:10,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:32:10,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:32:10,589 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 -> 103efe8931e099ca6c2446ad32c4c46818a6d213fc850bc42032bda38d601e6f [2024-01-27 15:32:10,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:32:10,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:32:10,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:32:10,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:32:10,813 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:32:10,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2024-01-27 15:32:11,838 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:32:12,010 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:32:12,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2024-01-27 15:32:12,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16669e23b/b78cea07fbdc45748c4f51896594d577/FLAG43b14ecec [2024-01-27 15:32:12,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16669e23b/b78cea07fbdc45748c4f51896594d577 [2024-01-27 15:32:12,033 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:32:12,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:32:12,035 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:32:12,035 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:32:12,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:32:12,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6144be7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12, skipping insertion in model container [2024-01-27 15:32:12,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,065 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:32:12,196 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/parallel-misc-5.wvr.c[3066,3079] [2024-01-27 15:32:12,203 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:32:12,210 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:32:12,228 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/parallel-misc-5.wvr.c[3066,3079] [2024-01-27 15:32:12,229 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:32:12,240 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:32:12,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12 WrapperNode [2024-01-27 15:32:12,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:32:12,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:32:12,242 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:32:12,242 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:32:12,247 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:32:12" (1/1) ... [2024-01-27 15:32:12,260 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:32:12" (1/1) ... [2024-01-27 15:32:12,276 INFO L138 Inliner]: procedures = 22, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2024-01-27 15:32:12,277 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:32:12,278 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:32:12,278 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:32:12,278 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:32:12,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,306 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-27 15:32:12,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:32:12,330 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:32:12,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:32:12,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:32:12,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12" (1/1) ... [2024-01-27 15:32:12,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:32:12,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:12,389 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:32:12,408 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:32:12,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:32:12,430 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:32:12,430 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:32:12,431 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:32:12,431 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:32:12,431 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:32:12,431 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:32:12,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:32:12,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:32:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:32:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:32:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:32:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:32:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:32:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:32:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:32:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:32:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:32:12,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:32:12,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:32:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:32:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:32:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:32:12,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:32:12,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:32:12,438 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:32:12,545 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:32:12,546 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:32:12,710 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:32:12,710 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:32:12,865 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:32:12,865 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 15:32:12,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:32:12 BoogieIcfgContainer [2024-01-27 15:32:12,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:32:12,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:32:12,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:32:12,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:32:12,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:32:12" (1/3) ... [2024-01-27 15:32:12,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f5ba2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:32:12, skipping insertion in model container [2024-01-27 15:32:12,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:32:12" (2/3) ... [2024-01-27 15:32:12,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38f5ba2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:32:12, skipping insertion in model container [2024-01-27 15:32:12,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:32:12" (3/3) ... [2024-01-27 15:32:12,872 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2024-01-27 15:32:12,878 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:32:12,886 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:32:12,886 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:32:12,886 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:32:12,944 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-27 15:32:12,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 99 flow [2024-01-27 15:32:13,005 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2024-01-27 15:32:13,006 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:32:13,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2024-01-27 15:32:13,017 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 39 transitions, 99 flow [2024-01-27 15:32:13,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2024-01-27 15:32:13,027 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:32:13,040 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;@20d9cbe6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:32:13,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-27 15:32:13,050 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:32:13,053 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2024-01-27 15:32:13,053 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-27 15:32:13,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:13,054 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] [2024-01-27 15:32:13,055 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:32:13,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash -290808675, now seen corresponding path program 1 times [2024-01-27 15:32:13,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:13,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922629072] [2024-01-27 15:32:13,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:13,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:13,549 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:32:13,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:13,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922629072] [2024-01-27 15:32:13,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922629072] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:32:13,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:32:13,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:32:13,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519599466] [2024-01-27 15:32:13,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:32:13,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:32:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:13,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:32:13,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:32:13,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-01-27 15:32:13,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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:32:13,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:13,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-01-27 15:32:13,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:14,123 INFO L124 PetriNetUnfolderBase]: 2888/4207 cut-off events. [2024-01-27 15:32:14,123 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2024-01-27 15:32:14,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8535 conditions, 4207 events. 2888/4207 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 21639 event pairs, 405 based on Foata normal form. 0/3340 useless extension candidates. Maximal degree in co-relation 7857. Up to 1379 conditions per place. [2024-01-27 15:32:14,139 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 75 selfloop transitions, 5 changer transitions 42/129 dead transitions. [2024-01-27 15:32:14,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 129 transitions, 550 flow [2024-01-27 15:32:14,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:32:14,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:32:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2024-01-27 15:32:14,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7106227106227107 [2024-01-27 15:32:14,151 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 88 flow. Second operand 7 states and 194 transitions. [2024-01-27 15:32:14,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 129 transitions, 550 flow [2024-01-27 15:32:14,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 129 transitions, 518 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-27 15:32:14,158 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 127 flow [2024-01-27 15:32:14,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2024-01-27 15:32:14,162 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2024-01-27 15:32:14,163 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 127 flow [2024-01-27 15:32:14,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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:32:14,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:14,163 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] [2024-01-27 15:32:14,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:32:14,164 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:32:14,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:14,164 INFO L85 PathProgramCache]: Analyzing trace with hash 520836159, now seen corresponding path program 2 times [2024-01-27 15:32:14,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:14,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270044876] [2024-01-27 15:32:14,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:14,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:14,241 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:32:14,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:14,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270044876] [2024-01-27 15:32:14,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270044876] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:32:14,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:32:14,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:32:14,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40534392] [2024-01-27 15:32:14,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:32:14,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:32:14,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:14,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:32:14,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:32:14,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-01-27 15:32:14,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:32:14,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:14,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-01-27 15:32:14,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:14,506 INFO L124 PetriNetUnfolderBase]: 2418/3505 cut-off events. [2024-01-27 15:32:14,506 INFO L125 PetriNetUnfolderBase]: For 2134/2137 co-relation queries the response was YES. [2024-01-27 15:32:14,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8677 conditions, 3505 events. 2418/3505 cut-off events. For 2134/2137 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 16578 event pairs, 148 based on Foata normal form. 0/3066 useless extension candidates. Maximal degree in co-relation 6163. Up to 1594 conditions per place. [2024-01-27 15:32:14,522 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 65 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-01-27 15:32:14,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 80 transitions, 404 flow [2024-01-27 15:32:14,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:32:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:32:14,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-01-27 15:32:14,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6102564102564103 [2024-01-27 15:32:14,524 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 127 flow. Second operand 5 states and 119 transitions. [2024-01-27 15:32:14,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 80 transitions, 404 flow [2024-01-27 15:32:14,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 80 transitions, 392 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-27 15:32:14,530 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 180 flow [2024-01-27 15:32:14,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2024-01-27 15:32:14,531 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-01-27 15:32:14,532 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 180 flow [2024-01-27 15:32:14,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:32:14,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:14,532 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] [2024-01-27 15:32:14,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:32:14,533 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:32:14,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1405742601, now seen corresponding path program 3 times [2024-01-27 15:32:14,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:14,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940810370] [2024-01-27 15:32:14,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:14,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:14,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:14,652 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:32:14,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:14,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940810370] [2024-01-27 15:32:14,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940810370] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:32:14,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:32:14,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:32:14,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415240331] [2024-01-27 15:32:14,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:32:14,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:32:14,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:14,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:32:14,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:32:14,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-01-27 15:32:14,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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:32:14,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:14,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-01-27 15:32:14,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:15,018 INFO L124 PetriNetUnfolderBase]: 2540/3714 cut-off events. [2024-01-27 15:32:15,018 INFO L125 PetriNetUnfolderBase]: For 3365/3372 co-relation queries the response was YES. [2024-01-27 15:32:15,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10117 conditions, 3714 events. 2540/3714 cut-off events. For 3365/3372 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 18154 event pairs, 401 based on Foata normal form. 68/3387 useless extension candidates. Maximal degree in co-relation 6428. Up to 1508 conditions per place. [2024-01-27 15:32:15,030 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 49 selfloop transitions, 3 changer transitions 60/119 dead transitions. [2024-01-27 15:32:15,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 119 transitions, 629 flow [2024-01-27 15:32:15,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-27 15:32:15,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-01-27 15:32:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2024-01-27 15:32:15,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6556776556776557 [2024-01-27 15:32:15,032 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 180 flow. Second operand 7 states and 179 transitions. [2024-01-27 15:32:15,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 119 transitions, 629 flow [2024-01-27 15:32:15,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 119 transitions, 629 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:32:15,039 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 170 flow [2024-01-27 15:32:15,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2024-01-27 15:32:15,040 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2024-01-27 15:32:15,040 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 170 flow [2024-01-27 15:32:15,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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:32:15,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:15,041 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:32:15,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:32:15,041 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:32:15,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:15,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1600613849, now seen corresponding path program 1 times [2024-01-27 15:32:15,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:15,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443765920] [2024-01-27 15:32:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:15,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:15,082 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:32:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443765920] [2024-01-27 15:32:15,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443765920] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:32:15,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:32:15,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:32:15,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335409033] [2024-01-27 15:32:15,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:32:15,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:32:15,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:15,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:32:15,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:32:15,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-27 15:32:15,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:32:15,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:15,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-27 15:32:15,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:15,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L79-->L83: Formula: (and (not (= 0 (ite (< 0 v_~c2~0_66) 1 0))) (= v_~c2~0_66 (+ v_~c2~0_65 1)) (= v_~pos~0_100 (+ v_~pos~0_99 1))) InVars {~c2~0=v_~c2~0_66, ~pos~0=v_~pos~0_100} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_1|, ~c2~0=v_~c2~0_65} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0][41], [26#L61true, 37#L115-4true, Black: 69#(and (<= (+ (* (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork2_~cond~1#1|) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 66#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), Black: 64#true, 91#(<= ~c1~0 0), 10#L83true, 74#true, Black: 77#(= ~v_assert~0 1), Black: 80#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 84#(and (= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)), Black: 82#(and (= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 0 ~pos~0)), 67#(< (* (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 256) |thread2Thread1of1ForFork2_~cond~1#1|), 31#L96true, Black: 51#(= ~v_assert~0 1), Black: 56#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 50#(<= 0 ~pos~0), Black: 54#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2024-01-27 15:32:15,226 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-01-27 15:32:15,227 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-27 15:32:15,227 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-01-27 15:32:15,227 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-01-27 15:32:15,255 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L79-->L83: Formula: (and (not (= 0 (ite (< 0 v_~c2~0_66) 1 0))) (= v_~c2~0_66 (+ v_~c2~0_65 1)) (= v_~pos~0_100 (+ v_~pos~0_99 1))) InVars {~c2~0=v_~c2~0_66, ~pos~0=v_~pos~0_100} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_1|, ~c2~0=v_~c2~0_65} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0][41], [26#L61true, Black: 69#(and (<= (+ (* (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork2_~cond~1#1|) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 66#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), Black: 64#true, 91#(<= ~c1~0 0), 10#L83true, 38#L116-1true, 74#true, Black: 77#(= ~v_assert~0 1), Black: 80#(and (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 84#(and (= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)), Black: 82#(and (= ~v_assert~0 1) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 0 ~pos~0)), 67#(< (* (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 256) |thread2Thread1of1ForFork2_~cond~1#1|), 31#L96true, Black: 51#(= ~v_assert~0 1), Black: 56#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 50#(<= 0 ~pos~0), Black: 54#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2024-01-27 15:32:15,256 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-01-27 15:32:15,256 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-27 15:32:15,256 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-01-27 15:32:15,256 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-27 15:32:15,274 INFO L124 PetriNetUnfolderBase]: 1832/2778 cut-off events. [2024-01-27 15:32:15,275 INFO L125 PetriNetUnfolderBase]: For 3816/4109 co-relation queries the response was YES. [2024-01-27 15:32:15,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7517 conditions, 2778 events. 1832/2778 cut-off events. For 3816/4109 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14248 event pairs, 541 based on Foata normal form. 161/2528 useless extension candidates. Maximal degree in co-relation 6678. Up to 1423 conditions per place. [2024-01-27 15:32:15,286 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 50 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-01-27 15:32:15,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 65 transitions, 353 flow [2024-01-27 15:32:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:32:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:32:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-01-27 15:32:15,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-01-27 15:32:15,287 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 170 flow. Second operand 3 states and 87 transitions. [2024-01-27 15:32:15,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 65 transitions, 353 flow [2024-01-27 15:32:15,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 327 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-01-27 15:32:15,293 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 164 flow [2024-01-27 15:32:15,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2024-01-27 15:32:15,294 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-01-27 15:32:15,294 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 164 flow [2024-01-27 15:32:15,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:32:15,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:15,295 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:32:15,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:32:15,295 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:32:15,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:15,295 INFO L85 PathProgramCache]: Analyzing trace with hash 396714217, now seen corresponding path program 1 times [2024-01-27 15:32:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:15,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201419273] [2024-01-27 15:32:15,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:15,336 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:32:15,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:15,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201419273] [2024-01-27 15:32:15,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201419273] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:32:15,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:32:15,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:32:15,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148375694] [2024-01-27 15:32:15,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:32:15,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:32:15,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:15,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:32:15,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:32:15,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-27 15:32:15,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:32:15,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:15,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-27 15:32:15,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:15,545 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L79-->L83: Formula: (and (not (= 0 (ite (< 0 v_~c2~0_66) 1 0))) (= v_~c2~0_66 (+ v_~c2~0_65 1)) (= v_~pos~0_100 (+ v_~pos~0_99 1))) InVars {~c2~0=v_~c2~0_66, ~pos~0=v_~pos~0_100} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_1|, ~c2~0=v_~c2~0_65} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0][45], [26#L61true, 37#L115-4true, Black: 69#(and (<= (+ (* (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork2_~cond~1#1|) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 66#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), Black: 64#true, 91#(<= ~c1~0 0), 10#L83true, 67#(< (* (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 256) |thread2Thread1of1ForFork2_~cond~1#1|), 31#L96true, 93#true, Black: 56#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 50#(<= 0 ~pos~0), Black: 54#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2024-01-27 15:32:15,545 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-01-27 15:32:15,545 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-01-27 15:32:15,546 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-27 15:32:15,546 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-01-27 15:32:15,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([350] L79-->L83: Formula: (and (not (= 0 (ite (< 0 v_~c2~0_66) 1 0))) (= v_~c2~0_66 (+ v_~c2~0_65 1)) (= v_~pos~0_100 (+ v_~pos~0_99 1))) InVars {~c2~0=v_~c2~0_66, ~pos~0=v_~pos~0_100} OutVars{thread2Thread1of1ForFork2_#t~post10#1=|v_thread2Thread1of1ForFork2_#t~post10#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_99, thread2Thread1of1ForFork2_#t~post9#1=|v_thread2Thread1of1ForFork2_#t~post9#1_1|, ~c2~0=v_~c2~0_65} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post10#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~pos~0, thread2Thread1of1ForFork2_#t~post9#1, ~c2~0][45], [26#L61true, Black: 69#(and (<= (+ (* (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 256) 1) |thread2Thread1of1ForFork2_~cond~1#1|) (= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0)), Black: 66#(= (+ (* 256 (div ~v_assert~0 256)) 1) ~v_assert~0), Black: 64#true, 91#(<= ~c1~0 0), 10#L83true, 38#L116-1true, 67#(< (* (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 256) |thread2Thread1of1ForFork2_~cond~1#1|), 31#L96true, 93#true, Black: 56#(and (<= 1 |thread1Thread1of1ForFork1_~cond~0#1|) (<= (div |thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 0 ~pos~0)), Black: 50#(<= 0 ~pos~0), Black: 54#(and (= ~v_assert~0 1) (<= 0 ~pos~0))]) [2024-01-27 15:32:15,554 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-01-27 15:32:15,558 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-01-27 15:32:15,558 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-27 15:32:15,558 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-01-27 15:32:15,576 INFO L124 PetriNetUnfolderBase]: 2475/3809 cut-off events. [2024-01-27 15:32:15,576 INFO L125 PetriNetUnfolderBase]: For 3029/3155 co-relation queries the response was YES. [2024-01-27 15:32:15,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9898 conditions, 3809 events. 2475/3809 cut-off events. For 3029/3155 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 20472 event pairs, 682 based on Foata normal form. 172/3410 useless extension candidates. Maximal degree in co-relation 6926. Up to 2418 conditions per place. [2024-01-27 15:32:15,596 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 49 selfloop transitions, 2 changer transitions 1/65 dead transitions. [2024-01-27 15:32:15,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 347 flow [2024-01-27 15:32:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:32:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:32:15,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-01-27 15:32:15,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7264957264957265 [2024-01-27 15:32:15,598 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 164 flow. Second operand 3 states and 85 transitions. [2024-01-27 15:32:15,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 347 flow [2024-01-27 15:32:15,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 65 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:32:15,604 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 176 flow [2024-01-27 15:32:15,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2024-01-27 15:32:15,606 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2024-01-27 15:32:15,606 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 176 flow [2024-01-27 15:32:15,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:32:15,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:15,607 INFO L208 CegarLoopForPetriNet]: trace histogram [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:32:15,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:32:15,607 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:32:15,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:15,609 INFO L85 PathProgramCache]: Analyzing trace with hash -663756311, now seen corresponding path program 1 times [2024-01-27 15:32:15,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:15,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016092475] [2024-01-27 15:32:15,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:15,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:32:15,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:15,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016092475] [2024-01-27 15:32:15,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016092475] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:15,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342691205] [2024-01-27 15:32:15,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:15,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:15,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:15,768 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:32:15,788 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:32:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:15,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-27 15:32:15,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:32:15,905 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:15,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:32:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342691205] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:32:15,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:32:15,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 9 [2024-01-27 15:32:15,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507983242] [2024-01-27 15:32:15,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:32:15,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-01-27 15:32:15,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:15,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-01-27 15:32:15,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-01-27 15:32:15,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-01-27 15:32:15,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 176 flow. Second operand has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:32:15,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:15,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-01-27 15:32:15,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:17,261 INFO L124 PetriNetUnfolderBase]: 9464/13936 cut-off events. [2024-01-27 15:32:17,261 INFO L125 PetriNetUnfolderBase]: For 14289/14289 co-relation queries the response was YES. [2024-01-27 15:32:17,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39205 conditions, 13936 events. 9464/13936 cut-off events. For 14289/14289 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 81841 event pairs, 266 based on Foata normal form. 232/12606 useless extension candidates. Maximal degree in co-relation 13687. Up to 1935 conditions per place. [2024-01-27 15:32:17,297 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 139 selfloop transitions, 26 changer transitions 148/320 dead transitions. [2024-01-27 15:32:17,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 320 transitions, 1824 flow [2024-01-27 15:32:17,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-01-27 15:32:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-01-27 15:32:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 492 transitions. [2024-01-27 15:32:17,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6307692307692307 [2024-01-27 15:32:17,299 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 176 flow. Second operand 20 states and 492 transitions. [2024-01-27 15:32:17,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 320 transitions, 1824 flow [2024-01-27 15:32:17,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 320 transitions, 1812 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:32:17,307 INFO L231 Difference]: Finished difference. Result has 84 places, 61 transitions, 458 flow [2024-01-27 15:32:17,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=458, PETRI_PLACES=84, PETRI_TRANSITIONS=61} [2024-01-27 15:32:17,308 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 43 predicate places. [2024-01-27 15:32:17,308 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 61 transitions, 458 flow [2024-01-27 15:32:17,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.7) internal successors, (137), 10 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:32:17,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:17,308 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2024-01-27 15:32:17,335 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:32:17,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-01-27 15:32:17,541 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:32:17,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash -804400065, now seen corresponding path program 2 times [2024-01-27 15:32:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:17,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504343622] [2024-01-27 15:32:17,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:17,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:32:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:17,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504343622] [2024-01-27 15:32:17,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504343622] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:17,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895956603] [2024-01-27 15:32:17,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:32:17,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:17,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:17,659 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:32:17,684 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:32:17,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:32:17,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:32:17,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:32:17,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:32:17,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:32:17,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895956603] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:32:17,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:32:17,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 8 [2024-01-27 15:32:17,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760580528] [2024-01-27 15:32:17,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:32:17,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-27 15:32:17,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:17,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-27 15:32:17,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-01-27 15:32:17,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-01-27 15:32:17,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 61 transitions, 458 flow. Second operand has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:32:17,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:17,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-01-27 15:32:17,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:18,985 INFO L124 PetriNetUnfolderBase]: 7610/11407 cut-off events. [2024-01-27 15:32:18,985 INFO L125 PetriNetUnfolderBase]: For 69268/69457 co-relation queries the response was YES. [2024-01-27 15:32:19,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42603 conditions, 11407 events. 7610/11407 cut-off events. For 69268/69457 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 64674 event pairs, 437 based on Foata normal form. 927/10899 useless extension candidates. Maximal degree in co-relation 41027. Up to 3213 conditions per place. [2024-01-27 15:32:19,033 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 178 selfloop transitions, 30 changer transitions 13/233 dead transitions. [2024-01-27 15:32:19,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 233 transitions, 2118 flow [2024-01-27 15:32:19,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-01-27 15:32:19,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-01-27 15:32:19,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 303 transitions. [2024-01-27 15:32:19,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5976331360946746 [2024-01-27 15:32:19,036 INFO L175 Difference]: Start difference. First operand has 84 places, 61 transitions, 458 flow. Second operand 13 states and 303 transitions. [2024-01-27 15:32:19,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 233 transitions, 2118 flow [2024-01-27 15:32:19,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 233 transitions, 1838 flow, removed 119 selfloop flow, removed 10 redundant places. [2024-01-27 15:32:19,151 INFO L231 Difference]: Finished difference. Result has 86 places, 84 transitions, 789 flow [2024-01-27 15:32:19,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=789, PETRI_PLACES=86, PETRI_TRANSITIONS=84} [2024-01-27 15:32:19,151 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2024-01-27 15:32:19,152 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 84 transitions, 789 flow [2024-01-27 15:32:19,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.125) internal successors, (129), 8 states have internal predecessors, (129), 0 states have call successors, (0), 0 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:32:19,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:19,152 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2024-01-27 15:32:19,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-01-27 15:32:19,362 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,SelfDestructingSolverStorable6 [2024-01-27 15:32:19,365 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:32:19,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:19,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2108652263, now seen corresponding path program 1 times [2024-01-27 15:32:19,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:19,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078739975] [2024-01-27 15:32:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:19,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:19,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:32:19,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:19,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078739975] [2024-01-27 15:32:19,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078739975] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:19,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973385727] [2024-01-27 15:32:19,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:19,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:19,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:19,460 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:32:19,484 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:32:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:19,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-27 15:32:19,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:32:19,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:32:19,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973385727] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:32:19,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:32:19,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 4 [2024-01-27 15:32:19,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661720222] [2024-01-27 15:32:19,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:32:19,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:32:19,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:19,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:32:19,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:32:19,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-27 15:32:19,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 789 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:32:19,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:19,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-27 15:32:19,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:21,042 INFO L124 PetriNetUnfolderBase]: 10776/16999 cut-off events. [2024-01-27 15:32:21,042 INFO L125 PetriNetUnfolderBase]: For 114565/115589 co-relation queries the response was YES. [2024-01-27 15:32:21,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67761 conditions, 16999 events. 10776/16999 cut-off events. For 114565/115589 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 112724 event pairs, 3677 based on Foata normal form. 729/15108 useless extension candidates. Maximal degree in co-relation 60958. Up to 5912 conditions per place. [2024-01-27 15:32:21,166 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 129 selfloop transitions, 12 changer transitions 0/164 dead transitions. [2024-01-27 15:32:21,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 164 transitions, 1881 flow [2024-01-27 15:32:21,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:32:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:32:21,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-01-27 15:32:21,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7628205128205128 [2024-01-27 15:32:21,168 INFO L175 Difference]: Start difference. First operand has 86 places, 84 transitions, 789 flow. Second operand 4 states and 119 transitions. [2024-01-27 15:32:21,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 164 transitions, 1881 flow [2024-01-27 15:32:21,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 164 transitions, 1756 flow, removed 62 selfloop flow, removed 1 redundant places. [2024-01-27 15:32:21,303 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 882 flow [2024-01-27 15:32:21,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=882, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2024-01-27 15:32:21,304 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 49 predicate places. [2024-01-27 15:32:21,304 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 92 transitions, 882 flow [2024-01-27 15:32:21,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:32:21,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:21,305 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 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] [2024-01-27 15:32:21,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-01-27 15:32:21,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:21,511 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:32:21,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:21,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1911420765, now seen corresponding path program 3 times [2024-01-27 15:32:21,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:21,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136936563] [2024-01-27 15:32:21,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:21,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:32:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:21,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136936563] [2024-01-27 15:32:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136936563] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:21,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082081078] [2024-01-27 15:32:21,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:32:21,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:21,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:21,702 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:32:21,729 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:32:21,812 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-01-27 15:32:21,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:32:21,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:32:21,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:32:21,864 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:32:21,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082081078] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:32:21,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:32:21,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2024-01-27 15:32:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142148928] [2024-01-27 15:32:21,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:32:21,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-01-27 15:32:21,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:21,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-01-27 15:32:21,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-01-27 15:32:21,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-01-27 15:32:21,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 882 flow. Second operand has 11 states, 11 states have (on average 14.181818181818182) internal successors, (156), 11 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:32:21,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:21,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-01-27 15:32:21,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:25,793 INFO L124 PetriNetUnfolderBase]: 24423/36926 cut-off events. [2024-01-27 15:32:25,793 INFO L125 PetriNetUnfolderBase]: For 253707/254064 co-relation queries the response was YES. [2024-01-27 15:32:25,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153462 conditions, 36926 events. 24423/36926 cut-off events. For 253707/254064 co-relation queries the response was YES. Maximal size of possible extension queue 1337. Compared 248448 event pairs, 1317 based on Foata normal form. 1111/33394 useless extension candidates. Maximal degree in co-relation 146797. Up to 6927 conditions per place. [2024-01-27 15:32:26,001 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 154 selfloop transitions, 94 changer transitions 209/469 dead transitions. [2024-01-27 15:32:26,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 469 transitions, 5081 flow [2024-01-27 15:32:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-01-27 15:32:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-01-27 15:32:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 540 transitions. [2024-01-27 15:32:26,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5538461538461539 [2024-01-27 15:32:26,004 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 882 flow. Second operand 25 states and 540 transitions. [2024-01-27 15:32:26,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 469 transitions, 5081 flow [2024-01-27 15:32:26,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 469 transitions, 5007 flow, removed 37 selfloop flow, removed 0 redundant places. [2024-01-27 15:32:26,295 INFO L231 Difference]: Finished difference. Result has 130 places, 150 transitions, 2222 flow [2024-01-27 15:32:26,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2222, PETRI_PLACES=130, PETRI_TRANSITIONS=150} [2024-01-27 15:32:26,296 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 89 predicate places. [2024-01-27 15:32:26,297 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 150 transitions, 2222 flow [2024-01-27 15:32:26,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.181818181818182) internal successors, (156), 11 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:32:26,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:26,297 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 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] [2024-01-27 15:32:26,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-27 15:32:26,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:26,505 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:32:26,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:26,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1807559217, now seen corresponding path program 4 times [2024-01-27 15:32:26,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:26,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327117091] [2024-01-27 15:32:26,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:26,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:32:26,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:26,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327117091] [2024-01-27 15:32:26,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327117091] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:26,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731075800] [2024-01-27 15:32:26,577 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:32:26,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:26,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:26,579 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:32:26,605 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:32:26,653 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:32:26,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:32:26,654 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:32:26,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:32:26,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:32:26,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731075800] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:32:26,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:32:26,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2024-01-27 15:32:26,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149081001] [2024-01-27 15:32:26,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:32:26,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:32:26,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:26,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:32:26,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:32:26,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-27 15:32:26,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 150 transitions, 2222 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:32:26,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:26,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-27 15:32:26,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:31,079 INFO L124 PetriNetUnfolderBase]: 22854/36263 cut-off events. [2024-01-27 15:32:31,079 INFO L125 PetriNetUnfolderBase]: For 527966/529248 co-relation queries the response was YES. [2024-01-27 15:32:31,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181963 conditions, 36263 events. 22854/36263 cut-off events. For 527966/529248 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 258289 event pairs, 6959 based on Foata normal form. 823/31717 useless extension candidates. Maximal degree in co-relation 180613. Up to 10269 conditions per place. [2024-01-27 15:32:31,420 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 224 selfloop transitions, 67 changer transitions 0/318 dead transitions. [2024-01-27 15:32:31,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 318 transitions, 5277 flow [2024-01-27 15:32:31,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:32:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:32:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2024-01-27 15:32:31,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8153846153846154 [2024-01-27 15:32:31,422 INFO L175 Difference]: Start difference. First operand has 130 places, 150 transitions, 2222 flow. Second operand 5 states and 159 transitions. [2024-01-27 15:32:31,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 318 transitions, 5277 flow [2024-01-27 15:32:33,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 318 transitions, 4690 flow, removed 290 selfloop flow, removed 9 redundant places. [2024-01-27 15:32:33,855 INFO L231 Difference]: Finished difference. Result has 115 places, 184 transitions, 2837 flow [2024-01-27 15:32:33,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1937, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2837, PETRI_PLACES=115, PETRI_TRANSITIONS=184} [2024-01-27 15:32:33,856 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 74 predicate places. [2024-01-27 15:32:33,857 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 184 transitions, 2837 flow [2024-01-27 15:32:33,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:32:33,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:33,858 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 3, 3, 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] [2024-01-27 15:32:33,879 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:32:34,069 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,SelfDestructingSolverStorable9 [2024-01-27 15:32:34,069 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:32:34,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:34,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1730388281, now seen corresponding path program 2 times [2024-01-27 15:32:34,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:34,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373809091] [2024-01-27 15:32:34,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:34,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:34,159 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:32:34,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:34,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373809091] [2024-01-27 15:32:34,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373809091] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:34,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270059740] [2024-01-27 15:32:34,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:32:34,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:34,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:34,177 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:32:34,196 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:32:34,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:32:34,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:32:34,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-27 15:32:34,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:32:34,300 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-27 15:32:34,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270059740] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:32:34,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:32:34,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 5 [2024-01-27 15:32:34,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540380467] [2024-01-27 15:32:34,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:32:34,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:32:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:34,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:32:34,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:32:34,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-27 15:32:34,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 184 transitions, 2837 flow. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:32:34,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:34,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-27 15:32:34,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:42,239 INFO L124 PetriNetUnfolderBase]: 43123/68101 cut-off events. [2024-01-27 15:32:42,239 INFO L125 PetriNetUnfolderBase]: For 795658/798720 co-relation queries the response was YES. [2024-01-27 15:32:42,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327113 conditions, 68101 events. 43123/68101 cut-off events. For 795658/798720 co-relation queries the response was YES. Maximal size of possible extension queue 1693. Compared 532323 event pairs, 13567 based on Foata normal form. 1609/59534 useless extension candidates. Maximal degree in co-relation 313680. Up to 19315 conditions per place. [2024-01-27 15:32:42,839 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 340 selfloop transitions, 67 changer transitions 0/434 dead transitions. [2024-01-27 15:32:42,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 434 transitions, 7955 flow [2024-01-27 15:32:42,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:32:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:32:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-01-27 15:32:42,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7846153846153846 [2024-01-27 15:32:42,840 INFO L175 Difference]: Start difference. First operand has 115 places, 184 transitions, 2837 flow. Second operand 5 states and 153 transitions. [2024-01-27 15:32:42,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 434 transitions, 7955 flow [2024-01-27 15:32:45,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 434 transitions, 7609 flow, removed 173 selfloop flow, removed 1 redundant places. [2024-01-27 15:32:45,856 INFO L231 Difference]: Finished difference. Result has 121 places, 221 transitions, 3648 flow [2024-01-27 15:32:45,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2735, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3648, PETRI_PLACES=121, PETRI_TRANSITIONS=221} [2024-01-27 15:32:45,856 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 80 predicate places. [2024-01-27 15:32:45,856 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 221 transitions, 3648 flow [2024-01-27 15:32:45,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:32:45,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:32:45,857 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 3, 3, 3, 3, 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:32:45,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-01-27 15:32:46,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:46,059 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:32:46,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:32:46,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1125656941, now seen corresponding path program 5 times [2024-01-27 15:32:46,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:32:46,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869779227] [2024-01-27 15:32:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:32:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:32:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:32:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:32:46,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:32:46,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869779227] [2024-01-27 15:32:46,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869779227] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:32:46,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518091851] [2024-01-27 15:32:46,281 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:32:46,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:32:46,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:32:46,282 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:32:46,284 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:32:46,358 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-01-27 15:32:46,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:32:46,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 18 conjunts are in the unsatisfiable core [2024-01-27 15:32:46,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:32:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:32:46,570 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:32:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-27 15:32:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518091851] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:32:46,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:32:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 18 [2024-01-27 15:32:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39223457] [2024-01-27 15:32:46,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:32:46,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-27 15:32:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:32:46,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-27 15:32:46,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-01-27 15:32:46,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-01-27 15:32:46,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 221 transitions, 3648 flow. Second operand has 19 states, 19 states have (on average 15.052631578947368) internal successors, (286), 19 states have internal predecessors, (286), 0 states have call successors, (0), 0 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:32:46,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:32:46,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-01-27 15:32:46,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand