./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.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 eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 12:38:39,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 12:38:39,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 12:38:39,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 12:38:39,979 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 12:38:40,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 12:38:40,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 12:38:40,016 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 12:38:40,017 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 12:38:40,017 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 12:38:40,017 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 12:38:40,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 12:38:40,018 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 12:38:40,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 12:38:40,018 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 12:38:40,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 12:38:40,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 12:38:40,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 12:38:40,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 12:38:40,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 12:38:40,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 12:38:40,025 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 12:38:40,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 12:38:40,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 12:38:40,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 12:38:40,026 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 12:38:40,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 12:38:40,027 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 12:38:40,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 12:38:40,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 12:38:40,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 12:38:40,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 12:38:40,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:38:40,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 12:38:40,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 12:38:40,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 12:38:40,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 12:38:40,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 12:38:40,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 12:38:40,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 12:38:40,031 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 12:38:40,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 12:38:40,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 12:38:40,032 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 -> eecffe8522a4364afb75ce7fb01800caae42a8a3ed11b56f212b94255e6f04bc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 12:38:40,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 12:38:40,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 12:38:40,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 12:38:40,303 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 12:38:40,303 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 12:38:40,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2024-02-20 12:38:41,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 12:38:41,721 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 12:38:41,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2024-02-20 12:38:41,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9526330fe/54980be086df480a910b1d3958aa9900/FLAGf09cf1707 [2024-02-20 12:38:41,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9526330fe/54980be086df480a910b1d3958aa9900 [2024-02-20 12:38:41,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 12:38:41,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 12:38:41,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 12:38:41,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 12:38:41,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 12:38:41,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:38:41" (1/1) ... [2024-02-20 12:38:41,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf30b08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:41, skipping insertion in model container [2024-02-20 12:38:41,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 12:38:41" (1/1) ... [2024-02-20 12:38:41,794 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 12:38:41,988 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2024-02-20 12:38:42,004 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:38:42,014 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 12:38:42,051 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c[2690,2703] [2024-02-20 12:38:42,056 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 12:38:42,113 INFO L206 MainTranslator]: Completed translation [2024-02-20 12:38:42,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42 WrapperNode [2024-02-20 12:38:42,114 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 12:38:42,117 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 12:38:42,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 12:38:42,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 12:38:42,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,189 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 127 [2024-02-20 12:38:42,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 12:38:42,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 12:38:42,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 12:38:42,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 12:38:42,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,221 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,243 INFO L175 MemorySlicer]: Split 14 memory accesses to 5 slices as follows [2, 2, 6, 2, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 3, 1, 1]. [2024-02-20 12:38:42,248 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,248 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,263 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 12:38:42,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 12:38:42,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 12:38:42,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 12:38:42,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (1/1) ... [2024-02-20 12:38:42,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 12:38:42,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:38:42,337 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-02-20 12:38:42,360 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-02-20 12:38:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 12:38:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 12:38:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 12:38:42,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 12:38:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 12:38:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 12:38:42,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-20 12:38:42,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 12:38:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 12:38:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 12:38:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 12:38:42,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-20 12:38:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 12:38:42,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 12:38:42,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 12:38:42,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 12:38:42,393 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 12:38:42,393 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 12:38:42,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 12:38:42,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 12:38:42,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 12:38:42,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 12:38:42,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-20 12:38:42,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 12:38:42,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 12:38:42,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 12:38:42,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 12:38:42,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 12:38:42,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 12:38:42,398 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 12:38:42,500 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 12:38:42,503 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 12:38:42,719 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 12:38:42,720 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 12:38:42,936 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 12:38:42,937 INFO L320 CfgBuilder]: Removed 5 assume(true) statements. [2024-02-20 12:38:42,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:38:42 BoogieIcfgContainer [2024-02-20 12:38:42,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 12:38:42,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 12:38:42,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 12:38:42,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 12:38:42,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 12:38:41" (1/3) ... [2024-02-20 12:38:42,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133676eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:38:42, skipping insertion in model container [2024-02-20 12:38:42,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 12:38:42" (2/3) ... [2024-02-20 12:38:42,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@133676eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 12:38:42, skipping insertion in model container [2024-02-20 12:38:42,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 12:38:42" (3/3) ... [2024-02-20 12:38:42,946 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2024-02-20 12:38:42,962 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 12:38:42,963 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 12:38:42,963 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 12:38:43,016 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-20 12:38:43,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 40 transitions, 101 flow [2024-02-20 12:38:43,086 INFO L124 PetriNetUnfolderBase]: 6/37 cut-off events. [2024-02-20 12:38:43,086 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:38:43,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 6/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-02-20 12:38:43,092 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 40 transitions, 101 flow [2024-02-20 12:38:43,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 36 transitions, 90 flow [2024-02-20 12:38:43,107 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 12:38:43,112 INFO L369 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=All, 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;@50ff6689, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 12:38:43,112 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-20 12:38:43,153 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 12:38:43,154 INFO L124 PetriNetUnfolderBase]: 6/35 cut-off events. [2024-02-20 12:38:43,154 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 12:38:43,154 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:38:43,154 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:38:43,155 INFO L432 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-02-20 12:38:43,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:38:43,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2136115653, now seen corresponding path program 1 times [2024-02-20 12:38:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:38:43,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533537304] [2024-02-20 12:38:43,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:43,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:38:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:38:44,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:38:44,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533537304] [2024-02-20 12:38:44,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533537304] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:38:44,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:38:44,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 12:38:44,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539241882] [2024-02-20 12:38:44,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:38:44,103 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 12:38:44,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:38:44,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 12:38:44,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 12:38:44,148 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2024-02-20 12:38:44,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-02-20 12:38:44,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:38:44,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2024-02-20 12:38:44,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:38:44,387 INFO L124 PetriNetUnfolderBase]: 655/1126 cut-off events. [2024-02-20 12:38:44,387 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2024-02-20 12:38:44,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 1126 events. 655/1126 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5408 event pairs, 180 based on Foata normal form. 1/929 useless extension candidates. Maximal degree in co-relation 1147. Up to 665 conditions per place. [2024-02-20 12:38:44,399 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 41 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-02-20 12:38:44,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 58 transitions, 246 flow [2024-02-20 12:38:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:38:44,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:38:44,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-02-20 12:38:44,409 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-02-20 12:38:44,412 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-02-20 12:38:44,412 INFO L507 AbstractCegarLoop]: Abstraction has has 43 places, 58 transitions, 246 flow [2024-02-20 12:38:44,412 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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-02-20 12:38:44,413 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:38:44,413 INFO L234 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-02-20 12:38:44,413 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 12:38:44,413 INFO L432 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-02-20 12:38:44,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:38:44,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1097717588, now seen corresponding path program 1 times [2024-02-20 12:38:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:38:44,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226699935] [2024-02-20 12:38:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:44,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:38:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:44,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:38:44,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:38:44,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226699935] [2024-02-20 12:38:44,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226699935] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:38:44,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791330310] [2024-02-20 12:38:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:44,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:44,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:38:44,519 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-02-20 12:38:44,544 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-02-20 12:38:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:44,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 12:38:44,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:38:44,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:38:44,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:38:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:38:44,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791330310] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-20 12:38:44,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:38:44,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-02-20 12:38:44,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441783706] [2024-02-20 12:38:44,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:38:44,721 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:38:44,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:38:44,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:38:44,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-02-20 12:38:44,730 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 40 [2024-02-20 12:38:44,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 58 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:38:44,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:38:44,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 40 [2024-02-20 12:38:44,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:38:45,030 INFO L124 PetriNetUnfolderBase]: 1270/2187 cut-off events. [2024-02-20 12:38:45,030 INFO L125 PetriNetUnfolderBase]: For 510/878 co-relation queries the response was YES. [2024-02-20 12:38:45,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5653 conditions, 2187 events. 1270/2187 cut-off events. For 510/878 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12450 event pairs, 306 based on Foata normal form. 0/1825 useless extension candidates. Maximal degree in co-relation 2053. Up to 1279 conditions per place. [2024-02-20 12:38:45,055 INFO L140 encePairwiseOnDemand]: 35/40 looper letters, 79 selfloop transitions, 6 changer transitions 2/98 dead transitions. [2024-02-20 12:38:45,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 98 transitions, 613 flow [2024-02-20 12:38:45,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:38:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:38:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-02-20 12:38:45,057 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.605 [2024-02-20 12:38:45,057 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-02-20 12:38:45,058 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 98 transitions, 613 flow [2024-02-20 12:38:45,058 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:38:45,058 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:38:45,058 INFO L234 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-02-20 12:38:45,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-20 12:38:45,273 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:45,273 INFO L432 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-02-20 12:38:45,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:38:45,274 INFO L85 PathProgramCache]: Analyzing trace with hash 656289037, now seen corresponding path program 1 times [2024-02-20 12:38:45,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:38:45,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147578786] [2024-02-20 12:38:45,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:45,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:38:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:38:45,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:38:45,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147578786] [2024-02-20 12:38:45,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147578786] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:38:45,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:38:45,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:38:45,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608086256] [2024-02-20 12:38:45,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:38:45,364 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:38:45,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:38:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:38:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:38:45,378 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-02-20 12:38:45,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 98 transitions, 613 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:38:45,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:38:45,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-02-20 12:38:45,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:38:45,688 INFO L124 PetriNetUnfolderBase]: 1381/2496 cut-off events. [2024-02-20 12:38:45,688 INFO L125 PetriNetUnfolderBase]: For 1464/2192 co-relation queries the response was YES. [2024-02-20 12:38:45,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7910 conditions, 2496 events. 1381/2496 cut-off events. For 1464/2192 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 15397 event pairs, 314 based on Foata normal form. 0/2252 useless extension candidates. Maximal degree in co-relation 2267. Up to 1215 conditions per place. [2024-02-20 12:38:45,707 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 112 selfloop transitions, 12 changer transitions 6/140 dead transitions. [2024-02-20 12:38:45,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 140 transitions, 1136 flow [2024-02-20 12:38:45,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 12:38:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 12:38:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-02-20 12:38:45,713 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5958333333333333 [2024-02-20 12:38:45,714 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2024-02-20 12:38:45,714 INFO L507 AbstractCegarLoop]: Abstraction has has 52 places, 140 transitions, 1136 flow [2024-02-20 12:38:45,714 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:38:45,714 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:38:45,714 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:38:45,714 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 12:38:45,715 INFO L432 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-02-20 12:38:45,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:38:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1139562212, now seen corresponding path program 1 times [2024-02-20 12:38:45,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:38:45,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378917699] [2024-02-20 12:38:45,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:45,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:38:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:38:45,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:38:45,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378917699] [2024-02-20 12:38:45,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378917699] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:38:45,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572173540] [2024-02-20 12:38:45,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:45,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:45,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:38:45,818 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-02-20 12:38:45,840 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-02-20 12:38:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:45,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-20 12:38:45,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:38:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:38:45,951 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:38:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:38:45,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572173540] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-20 12:38:45,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:38:45,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-02-20 12:38:45,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360094573] [2024-02-20 12:38:45,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:38:45,984 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:38:45,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:38:45,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:38:45,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-02-20 12:38:45,995 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-02-20 12:38:45,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 140 transitions, 1136 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02-20 12:38:45,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:38:45,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-02-20 12:38:45,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:38:46,272 INFO L124 PetriNetUnfolderBase]: 1254/2244 cut-off events. [2024-02-20 12:38:46,273 INFO L125 PetriNetUnfolderBase]: For 2594/3614 co-relation queries the response was YES. [2024-02-20 12:38:46,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8792 conditions, 2244 events. 1254/2244 cut-off events. For 2594/3614 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 13402 event pairs, 198 based on Foata normal form. 58/2089 useless extension candidates. Maximal degree in co-relation 3335. Up to 1176 conditions per place. [2024-02-20 12:38:46,292 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 83 selfloop transitions, 5 changer transitions 42/140 dead transitions. [2024-02-20 12:38:46,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 140 transitions, 1380 flow [2024-02-20 12:38:46,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:38:46,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:38:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-02-20 12:38:46,294 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.64 [2024-02-20 12:38:46,296 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2024-02-20 12:38:46,296 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 140 transitions, 1380 flow [2024-02-20 12:38:46,297 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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-02-20 12:38:46,297 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:38:46,297 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:38:46,310 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-02-20 12:38:46,509 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-02-20 12:38:46,510 INFO L432 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-02-20 12:38:46,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:38:46,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1097230214, now seen corresponding path program 1 times [2024-02-20 12:38:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:38:46,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157619762] [2024-02-20 12:38:46,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:46,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:38:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:38:46,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:38:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157619762] [2024-02-20 12:38:46,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157619762] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:38:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639256922] [2024-02-20 12:38:46,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:46,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:46,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:38:46,653 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-02-20 12:38:46,676 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-02-20 12:38:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:46,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-20 12:38:46,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:38:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:38:46,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:38:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:38:46,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639256922] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-20 12:38:46,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:38:46,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-02-20 12:38:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200592382] [2024-02-20 12:38:46,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:38:46,859 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:38:46,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:38:46,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:38:46,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-02-20 12:38:46,876 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-02-20 12:38:46,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 140 transitions, 1380 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:38:46,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:38:46,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-02-20 12:38:46,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:38:47,192 INFO L124 PetriNetUnfolderBase]: 1605/2800 cut-off events. [2024-02-20 12:38:47,192 INFO L125 PetriNetUnfolderBase]: For 9095/12185 co-relation queries the response was YES. [2024-02-20 12:38:47,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12562 conditions, 2800 events. 1605/2800 cut-off events. For 9095/12185 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16606 event pairs, 221 based on Foata normal form. 91/2625 useless extension candidates. Maximal degree in co-relation 4860. Up to 1414 conditions per place. [2024-02-20 12:38:47,214 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 118 selfloop transitions, 12 changer transitions 62/202 dead transitions. [2024-02-20 12:38:47,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 202 transitions, 2385 flow [2024-02-20 12:38:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 12:38:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 12:38:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-02-20 12:38:47,215 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-02-20 12:38:47,216 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2024-02-20 12:38:47,216 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 202 transitions, 2385 flow [2024-02-20 12:38:47,216 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:38:47,216 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:38:47,217 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:38:47,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-20 12:38:47,429 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:47,432 INFO L432 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-02-20 12:38:47,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:38:47,432 INFO L85 PathProgramCache]: Analyzing trace with hash -586592670, now seen corresponding path program 1 times [2024-02-20 12:38:47,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:38:47,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164433147] [2024-02-20 12:38:47,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:47,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:38:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:47,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 12:38:47,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:38:47,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164433147] [2024-02-20 12:38:47,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164433147] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:38:47,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:38:47,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 12:38:47,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709525757] [2024-02-20 12:38:47,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:38:47,536 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:38:47,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:38:47,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:38:47,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:38:47,551 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-02-20 12:38:47,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 202 transitions, 2385 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:38:47,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:38:47,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-02-20 12:38:47,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:38:47,835 INFO L124 PetriNetUnfolderBase]: 1368/2197 cut-off events. [2024-02-20 12:38:47,835 INFO L125 PetriNetUnfolderBase]: For 12603/13041 co-relation queries the response was YES. [2024-02-20 12:38:47,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12080 conditions, 2197 events. 1368/2197 cut-off events. For 12603/13041 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11323 event pairs, 263 based on Foata normal form. 109/2131 useless extension candidates. Maximal degree in co-relation 6619. Up to 1170 conditions per place. [2024-02-20 12:38:47,857 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 54 selfloop transitions, 4 changer transitions 101/169 dead transitions. [2024-02-20 12:38:47,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 169 transitions, 2286 flow [2024-02-20 12:38:47,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 12:38:47,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 12:38:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-02-20 12:38:47,859 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5541666666666667 [2024-02-20 12:38:47,859 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2024-02-20 12:38:47,860 INFO L507 AbstractCegarLoop]: Abstraction has has 66 places, 169 transitions, 2286 flow [2024-02-20 12:38:47,860 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:38:47,860 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:38:47,860 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:38:47,860 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 12:38:47,861 INFO L432 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-02-20 12:38:47,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:38:47,861 INFO L85 PathProgramCache]: Analyzing trace with hash 507087279, now seen corresponding path program 1 times [2024-02-20 12:38:47,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:38:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545440856] [2024-02-20 12:38:47,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:38:47,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:38:47,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:38:47,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545440856] [2024-02-20 12:38:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545440856] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:38:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352042362] [2024-02-20 12:38:47,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:47,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:47,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:38:47,981 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-02-20 12:38:48,000 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-02-20 12:38:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:48,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 6 conjunts are in the unsatisfiable core [2024-02-20 12:38:48,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:38:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:38:48,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:38:48,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:38:48,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352042362] provided 1 perfect and 1 imperfect interpolant sequences [2024-02-20 12:38:48,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-02-20 12:38:48,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-02-20 12:38:48,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884998703] [2024-02-20 12:38:48,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:38:48,159 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:38:48,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:38:48,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:38:48,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-02-20 12:38:48,168 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-02-20 12:38:48,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 169 transitions, 2286 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:38:48,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:38:48,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-02-20 12:38:48,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:38:48,417 INFO L124 PetriNetUnfolderBase]: 1421/2327 cut-off events. [2024-02-20 12:38:48,417 INFO L125 PetriNetUnfolderBase]: For 17899/18517 co-relation queries the response was YES. [2024-02-20 12:38:48,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14047 conditions, 2327 events. 1421/2327 cut-off events. For 17899/18517 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 12169 event pairs, 178 based on Foata normal form. 203/2339 useless extension candidates. Maximal degree in co-relation 8069. Up to 1215 conditions per place. [2024-02-20 12:38:48,443 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 73 selfloop transitions, 8 changer transitions 98/189 dead transitions. [2024-02-20 12:38:48,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 189 transitions, 2905 flow [2024-02-20 12:38:48,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 12:38:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 12:38:48,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-02-20 12:38:48,444 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-02-20 12:38:48,445 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2024-02-20 12:38:48,445 INFO L507 AbstractCegarLoop]: Abstraction has has 70 places, 189 transitions, 2905 flow [2024-02-20 12:38:48,445 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:38:48,445 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:38:48,445 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:38:48,460 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-02-20 12:38:48,658 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:48,658 INFO L432 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-02-20 12:38:48,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:38:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1489973714, now seen corresponding path program 1 times [2024-02-20 12:38:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:38:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803417574] [2024-02-20 12:38:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:38:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:48,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:38:48,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:38:48,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803417574] [2024-02-20 12:38:48,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803417574] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 12:38:48,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 12:38:48,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-20 12:38:48,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424930487] [2024-02-20 12:38:48,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 12:38:48,823 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 12:38:48,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:38:48,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 12:38:48,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-20 12:38:48,846 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 40 [2024-02-20 12:38:48,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 189 transitions, 2905 flow. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-02-20 12:38:48,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:38:48,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 40 [2024-02-20 12:38:48,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:38:49,569 INFO L124 PetriNetUnfolderBase]: 3308/5020 cut-off events. [2024-02-20 12:38:49,570 INFO L125 PetriNetUnfolderBase]: For 47725/48313 co-relation queries the response was YES. [2024-02-20 12:38:49,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34639 conditions, 5020 events. 3308/5020 cut-off events. For 47725/48313 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 25191 event pairs, 275 based on Foata normal form. 222/4941 useless extension candidates. Maximal degree in co-relation 19127. Up to 2477 conditions per place. [2024-02-20 12:38:49,615 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 195 selfloop transitions, 20 changer transitions 244/466 dead transitions. [2024-02-20 12:38:49,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 466 transitions, 8123 flow [2024-02-20 12:38:49,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-20 12:38:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-20 12:38:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2024-02-20 12:38:49,617 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-02-20 12:38:49,618 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2024-02-20 12:38:49,618 INFO L507 AbstractCegarLoop]: Abstraction has has 78 places, 466 transitions, 8123 flow [2024-02-20 12:38:49,618 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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-02-20 12:38:49,619 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:38:49,619 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:38:49,619 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 12:38:49,619 INFO L432 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-02-20 12:38:49,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:38:49,620 INFO L85 PathProgramCache]: Analyzing trace with hash 952292731, now seen corresponding path program 2 times [2024-02-20 12:38:49,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:38:49,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795237049] [2024-02-20 12:38:49,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:49,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:38:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:38:49,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:38:49,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795237049] [2024-02-20 12:38:49,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795237049] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:38:49,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261603735] [2024-02-20 12:38:49,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 12:38:49,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:49,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:38:49,757 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-02-20 12:38:49,840 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-02-20 12:38:49,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 12:38:49,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:38:49,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 12:38:49,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:38:50,026 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:38:50,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:38:50,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-02-20 12:38:50,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261603735] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:38:50,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:38:50,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-02-20 12:38:50,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713918034] [2024-02-20 12:38:50,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:38:50,097 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-20 12:38:50,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:38:50,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-20 12:38:50,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-02-20 12:38:50,128 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-02-20 12:38:50,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 466 transitions, 8123 flow. Second operand has 14 states, 14 states have (on average 15.5) internal successors, (217), 14 states have internal predecessors, (217), 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-02-20 12:38:50,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:38:50,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-02-20 12:38:50,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:38:50,872 INFO L124 PetriNetUnfolderBase]: 3584/5423 cut-off events. [2024-02-20 12:38:50,872 INFO L125 PetriNetUnfolderBase]: For 68033/69379 co-relation queries the response was YES. [2024-02-20 12:38:50,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40754 conditions, 5423 events. 3584/5423 cut-off events. For 68033/69379 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 27454 event pairs, 294 based on Foata normal form. 118/5127 useless extension candidates. Maximal degree in co-relation 21391. Up to 3362 conditions per place. [2024-02-20 12:38:50,921 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 194 selfloop transitions, 6 changer transitions 274/498 dead transitions. [2024-02-20 12:38:50,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 498 transitions, 9623 flow [2024-02-20 12:38:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-20 12:38:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-20 12:38:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 197 transitions. [2024-02-20 12:38:50,922 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4925 [2024-02-20 12:38:50,923 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2024-02-20 12:38:50,923 INFO L507 AbstractCegarLoop]: Abstraction has has 87 places, 498 transitions, 9623 flow [2024-02-20 12:38:50,923 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.5) internal successors, (217), 14 states have internal predecessors, (217), 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-02-20 12:38:50,923 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:38:50,923 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:38:50,937 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-02-20 12:38:51,135 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:51,136 INFO L432 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-02-20 12:38:51,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:38:51,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1093835966, now seen corresponding path program 3 times [2024-02-20 12:38:51,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:38:51,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372936843] [2024-02-20 12:38:51,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:51,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:38:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-20 12:38:51,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:38:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372936843] [2024-02-20 12:38:51,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372936843] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:38:51,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327409034] [2024-02-20 12:38:51,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 12:38:51,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:51,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:38:51,329 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-02-20 12:38:51,360 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-02-20 12:38:51,496 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-20 12:38:51,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:38:51,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 12:38:51,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:38:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-20 12:38:51,580 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:38:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-20 12:38:51,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327409034] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:38:51,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:38:51,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-02-20 12:38:51,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623204590] [2024-02-20 12:38:51,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:38:51,651 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-20 12:38:51,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:38:51,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-20 12:38:51,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-02-20 12:38:51,688 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 40 [2024-02-20 12:38:51,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 498 transitions, 9623 flow. Second operand has 15 states, 15 states have (on average 14.733333333333333) internal successors, (221), 15 states have internal predecessors, (221), 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-02-20 12:38:51,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:38:51,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 40 [2024-02-20 12:38:51,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:38:53,541 INFO L124 PetriNetUnfolderBase]: 7082/10677 cut-off events. [2024-02-20 12:38:53,541 INFO L125 PetriNetUnfolderBase]: For 173319/175578 co-relation queries the response was YES. [2024-02-20 12:38:53,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86376 conditions, 10677 events. 7082/10677 cut-off events. For 173319/175578 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 56471 event pairs, 385 based on Foata normal form. 373/10331 useless extension candidates. Maximal degree in co-relation 46968. Up to 7018 conditions per place. [2024-02-20 12:38:53,646 INFO L140 encePairwiseOnDemand]: 28/40 looper letters, 318 selfloop transitions, 82 changer transitions 498/921 dead transitions. [2024-02-20 12:38:53,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 921 transitions, 19572 flow [2024-02-20 12:38:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-20 12:38:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-20 12:38:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 397 transitions. [2024-02-20 12:38:53,649 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5223684210526316 [2024-02-20 12:38:53,649 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 65 predicate places. [2024-02-20 12:38:53,650 INFO L507 AbstractCegarLoop]: Abstraction has has 105 places, 921 transitions, 19572 flow [2024-02-20 12:38:53,650 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 14.733333333333333) internal successors, (221), 15 states have internal predecessors, (221), 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-02-20 12:38:53,650 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:38:53,651 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:38:53,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-20 12:38:53,866 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:53,866 INFO L432 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-02-20 12:38:53,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:38:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash 111777765, now seen corresponding path program 4 times [2024-02-20 12:38:53,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:38:53,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690476513] [2024-02-20 12:38:53,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:38:53,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:38:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:38:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-20 12:38:54,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:38:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690476513] [2024-02-20 12:38:54,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690476513] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:38:54,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591051074] [2024-02-20 12:38:54,099 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 12:38:54,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:38:54,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:38:54,113 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-02-20 12:38:54,188 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-02-20 12:38:54,308 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 12:38:54,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:38:54,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 12:38:54,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:38:54,448 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-20 12:38:54,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:38:54,518 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-02-20 12:38:54,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591051074] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:38:54,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:38:54,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-02-20 12:38:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523053187] [2024-02-20 12:38:54,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:38:54,520 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-20 12:38:54,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:38:54,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-20 12:38:54,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-02-20 12:38:54,580 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-02-20 12:38:54,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 921 transitions, 19572 flow. Second operand has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 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-02-20 12:38:54,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:38:54,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-02-20 12:38:54,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:39:01,191 INFO L124 PetriNetUnfolderBase]: 19784/28465 cut-off events. [2024-02-20 12:39:01,192 INFO L125 PetriNetUnfolderBase]: For 522452/527330 co-relation queries the response was YES. [2024-02-20 12:39:01,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256891 conditions, 28465 events. 19784/28465 cut-off events. For 522452/527330 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 158656 event pairs, 556 based on Foata normal form. 482/26990 useless extension candidates. Maximal degree in co-relation 157362. Up to 19260 conditions per place. [2024-02-20 12:39:01,467 INFO L140 encePairwiseOnDemand]: 30/40 looper letters, 1697 selfloop transitions, 241 changer transitions 1238/3198 dead transitions. [2024-02-20 12:39:01,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 3198 transitions, 74273 flow [2024-02-20 12:39:01,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-02-20 12:39:01,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-02-20 12:39:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 816 transitions. [2024-02-20 12:39:01,471 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2024-02-20 12:39:01,471 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 109 predicate places. [2024-02-20 12:39:01,471 INFO L507 AbstractCegarLoop]: Abstraction has has 149 places, 3198 transitions, 74273 flow [2024-02-20 12:39:01,472 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.866666666666667) internal successors, (163), 15 states have internal predecessors, (163), 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-02-20 12:39:01,472 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:39:01,472 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:39:01,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-20 12:39:01,685 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:39:01,686 INFO L432 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-02-20 12:39:01,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:39:01,687 INFO L85 PathProgramCache]: Analyzing trace with hash 519139909, now seen corresponding path program 5 times [2024-02-20 12:39:01,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:39:01,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723261578] [2024-02-20 12:39:01,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:39:01,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:39:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:39:01,945 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-20 12:39:01,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:39:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723261578] [2024-02-20 12:39:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723261578] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:39:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804752537] [2024-02-20 12:39:01,946 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 12:39:01,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:39:01,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:39:01,961 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:39:02,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-20 12:39:02,243 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-20 12:39:02,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:39:02,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 12:39:02,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:39:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-20 12:39:02,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:39:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-20 12:39:02,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804752537] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:39:02,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:39:02,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-02-20 12:39:02,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326504600] [2024-02-20 12:39:02,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:39:02,389 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-20 12:39:02,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:39:02,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-20 12:39:02,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-02-20 12:39:02,415 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 40 [2024-02-20 12:39:02,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 3198 transitions, 74273 flow. Second operand has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 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-02-20 12:39:02,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:39:02,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 40 [2024-02-20 12:39:02,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:39:19,557 INFO L124 PetriNetUnfolderBase]: 22290/32336 cut-off events. [2024-02-20 12:39:19,557 INFO L125 PetriNetUnfolderBase]: For 592728/597509 co-relation queries the response was YES. [2024-02-20 12:39:19,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316402 conditions, 32336 events. 22290/32336 cut-off events. For 592728/597509 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 185237 event pairs, 576 based on Foata normal form. 390/30592 useless extension candidates. Maximal degree in co-relation 196116. Up to 21499 conditions per place. [2024-02-20 12:39:19,887 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 2212 selfloop transitions, 260 changer transitions 1637/4131 dead transitions. [2024-02-20 12:39:19,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 4131 transitions, 104216 flow [2024-02-20 12:39:19,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-02-20 12:39:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-02-20 12:39:19,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 511 transitions. [2024-02-20 12:39:19,889 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.45625 [2024-02-20 12:39:19,889 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 136 predicate places. [2024-02-20 12:39:19,889 INFO L507 AbstractCegarLoop]: Abstraction has has 176 places, 4131 transitions, 104216 flow [2024-02-20 12:39:19,890 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 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-02-20 12:39:19,890 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:39:19,890 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:39:19,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-02-20 12:39:20,102 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-02-20 12:39:20,103 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 12:39:20,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:39:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1154401356, now seen corresponding path program 6 times [2024-02-20 12:39:20,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:39:20,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568491652] [2024-02-20 12:39:20,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:39:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:39:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:39:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-20 12:39:20,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:39:20,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568491652] [2024-02-20 12:39:20,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568491652] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:39:20,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171787579] [2024-02-20 12:39:20,245 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-20 12:39:20,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:39:20,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:39:20,248 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:39:20,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-02-20 12:39:20,395 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-02-20 12:39:20,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:39:20,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 12:39:20,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:39:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-20 12:39:20,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:39:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-02-20 12:39:20,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171787579] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:39:20,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:39:20,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-02-20 12:39:20,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589529807] [2024-02-20 12:39:20,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:39:20,599 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-20 12:39:20,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:39:20,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-20 12:39:20,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2024-02-20 12:39:20,650 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-02-20 12:39:20,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 4131 transitions, 104216 flow. Second operand has 19 states, 19 states have (on average 14.947368421052632) internal successors, (284), 19 states have internal predecessors, (284), 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-02-20 12:39:20,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:39:20,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-02-20 12:39:20,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:39:44,663 INFO L124 PetriNetUnfolderBase]: 28889/41955 cut-off events. [2024-02-20 12:39:44,664 INFO L125 PetriNetUnfolderBase]: For 908080/918695 co-relation queries the response was YES. [2024-02-20 12:39:44,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439333 conditions, 41955 events. 28889/41955 cut-off events. For 908080/918695 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 250409 event pairs, 756 based on Foata normal form. 364/39387 useless extension candidates. Maximal degree in co-relation 209946. Up to 28306 conditions per place. [2024-02-20 12:39:45,252 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 2271 selfloop transitions, 8 changer transitions 3179/5675 dead transitions. [2024-02-20 12:39:45,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 5675 transitions, 155648 flow [2024-02-20 12:39:45,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 12:39:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 12:39:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 256 transitions. [2024-02-20 12:39:45,254 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2024-02-20 12:39:45,254 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 148 predicate places. [2024-02-20 12:39:45,254 INFO L507 AbstractCegarLoop]: Abstraction has has 188 places, 5675 transitions, 155648 flow [2024-02-20 12:39:45,255 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.947368421052632) internal successors, (284), 19 states have internal predecessors, (284), 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-02-20 12:39:45,255 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:39:45,255 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:39:45,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-02-20 12:39:45,469 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-02-20 12:39:45,469 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 12:39:45,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:39:45,469 INFO L85 PathProgramCache]: Analyzing trace with hash 794092093, now seen corresponding path program 7 times [2024-02-20 12:39:45,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:39:45,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764401376] [2024-02-20 12:39:45,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:39:45,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:39:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:39:45,693 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-02-20 12:39:45,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:39:45,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764401376] [2024-02-20 12:39:45,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764401376] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:39:45,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209995033] [2024-02-20 12:39:45,694 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-20 12:39:45,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:39:45,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:39:45,709 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:39:45,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-02-20 12:39:45,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:39:45,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 12:39:45,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:39:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-02-20 12:39:46,001 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:39:46,077 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-02-20 12:39:46,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [209995033] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:39:46,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:39:46,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-02-20 12:39:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977773661] [2024-02-20 12:39:46,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:39:46,078 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-20 12:39:46,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:39:46,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-20 12:39:46,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-02-20 12:39:46,122 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 40 [2024-02-20 12:39:46,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 5675 transitions, 155648 flow. Second operand has 19 states, 19 states have (on average 15.421052631578947) internal successors, (293), 19 states have internal predecessors, (293), 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-02-20 12:39:46,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:39:46,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 40 [2024-02-20 12:39:46,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:40:37,020 INFO L124 PetriNetUnfolderBase]: 42505/61672 cut-off events. [2024-02-20 12:40:37,020 INFO L125 PetriNetUnfolderBase]: For 1603378/1618330 co-relation queries the response was YES. [2024-02-20 12:40:37,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 689074 conditions, 61672 events. 42505/61672 cut-off events. For 1603378/1618330 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 390551 event pairs, 1178 based on Foata normal form. 315/57861 useless extension candidates. Maximal degree in co-relation 271202. Up to 42181 conditions per place. [2024-02-20 12:40:37,671 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 2302 selfloop transitions, 537 changer transitions 5846/8904 dead transitions. [2024-02-20 12:40:37,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 8904 transitions, 264079 flow [2024-02-20 12:40:37,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-20 12:40:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-20 12:40:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 254 transitions. [2024-02-20 12:40:37,672 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5291666666666667 [2024-02-20 12:40:37,673 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 159 predicate places. [2024-02-20 12:40:37,673 INFO L507 AbstractCegarLoop]: Abstraction has has 199 places, 8904 transitions, 264079 flow [2024-02-20 12:40:37,673 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.421052631578947) internal successors, (293), 19 states have internal predecessors, (293), 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-02-20 12:40:37,673 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:40:37,673 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:40:37,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-02-20 12:40:37,885 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-02-20 12:40:37,886 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 12:40:37,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:40:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash 804205595, now seen corresponding path program 8 times [2024-02-20 12:40:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:40:37,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640032533] [2024-02-20 12:40:37,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:40:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:40:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:40:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-02-20 12:40:38,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:40:38,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640032533] [2024-02-20 12:40:38,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640032533] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:40:38,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008623613] [2024-02-20 12:40:38,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 12:40:38,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:40:38,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:40:38,034 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:40:38,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-02-20 12:40:38,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 12:40:38,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:40:38,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 12:40:38,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:40:38,330 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-02-20 12:40:38,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:40:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-02-20 12:40:38,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008623613] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:40:38,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:40:38,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-02-20 12:40:38,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832648003] [2024-02-20 12:40:38,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:40:38,467 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-02-20 12:40:38,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:40:38,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-02-20 12:40:38,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-02-20 12:40:38,509 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 40 [2024-02-20 12:40:38,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 8904 transitions, 264079 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-02-20 12:40:38,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:40:38,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 40 [2024-02-20 12:40:38,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:42:28,644 INFO L124 PetriNetUnfolderBase]: 44934/65138 cut-off events. [2024-02-20 12:42:28,644 INFO L125 PetriNetUnfolderBase]: For 2015038/2032700 co-relation queries the response was YES. [2024-02-20 12:42:28,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774426 conditions, 65138 events. 44934/65138 cut-off events. For 2015038/2032700 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 412613 event pairs, 961 based on Foata normal form. 453/61530 useless extension candidates. Maximal degree in co-relation 306197. Up to 45034 conditions per place. [2024-02-20 12:42:29,368 INFO L140 encePairwiseOnDemand]: 31/40 looper letters, 2853 selfloop transitions, 101 changer transitions 6267/9411 dead transitions. [2024-02-20 12:42:29,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 9411 transitions, 297067 flow [2024-02-20 12:42:29,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-20 12:42:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-20 12:42:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 293 transitions. [2024-02-20 12:42:29,369 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5232142857142857 [2024-02-20 12:42:29,370 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 172 predicate places. [2024-02-20 12:42:29,370 INFO L507 AbstractCegarLoop]: Abstraction has has 212 places, 9411 transitions, 297067 flow [2024-02-20 12:42:29,370 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has 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-02-20 12:42:29,370 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:42:29,370 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-02-20 12:42:29,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-02-20 12:42:29,583 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-02-20 12:42:29,584 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 12:42:29,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:42:29,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1355119618, now seen corresponding path program 9 times [2024-02-20 12:42:29,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:42:29,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939091580] [2024-02-20 12:42:29,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:42:29,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:42:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:42:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-02-20 12:42:29,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:42:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939091580] [2024-02-20 12:42:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939091580] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:42:29,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277788619] [2024-02-20 12:42:29,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 12:42:29,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:42:29,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:42:29,841 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 12:42:29,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-02-20 12:42:30,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-20 12:42:30,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:42:30,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-20 12:42:30,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:42:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-02-20 12:42:30,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:42:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-02-20 12:42:30,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277788619] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:42:30,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:42:30,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2024-02-20 12:42:30,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943066368] [2024-02-20 12:42:30,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:42:30,232 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 12:42:30,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:42:30,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 12:42:30,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-02-20 12:42:30,257 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 40 [2024-02-20 12:42:30,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 9411 transitions, 297067 flow. Second operand has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 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-02-20 12:42:30,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:42:30,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 40 [2024-02-20 12:42:30,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:46:09,860 INFO L124 PetriNetUnfolderBase]: 61278/88789 cut-off events. [2024-02-20 12:46:09,861 INFO L125 PetriNetUnfolderBase]: For 2443944/2445434 co-relation queries the response was YES. [2024-02-20 12:46:10,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087310 conditions, 88789 events. 61278/88789 cut-off events. For 2443944/2445434 co-relation queries the response was YES. Maximal size of possible extension queue 1272. Compared 569365 event pairs, 139 based on Foata normal form. 398/85232 useless extension candidates. Maximal degree in co-relation 468087. Up to 58863 conditions per place. [2024-02-20 12:46:10,772 INFO L140 encePairwiseOnDemand]: 27/40 looper letters, 0 selfloop transitions, 0 changer transitions 16337/16337 dead transitions. [2024-02-20 12:46:10,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 16337 transitions, 539230 flow [2024-02-20 12:46:10,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2024-02-20 12:46:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2024-02-20 12:46:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 1446 transitions. [2024-02-20 12:46:10,776 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3615 [2024-02-20 12:46:10,776 INFO L308 CegarLoopForPetriNet]: 40 programPoint places, 269 predicate places. [2024-02-20 12:46:10,776 INFO L507 AbstractCegarLoop]: Abstraction has has 309 places, 16337 transitions, 539230 flow [2024-02-20 12:46:10,776 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.0) internal successors, (160), 16 states have internal predecessors, (160), 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-02-20 12:46:10,779 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-02-20 12:46:10,779 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-02-20 12:46:10,779 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-02-20 12:46:10,780 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-02-20 12:46:10,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-02-20 12:46:10,984 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15