./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 91d7b70e505e7aef19ce206c76dac3b8838d1608e22286f0e4e4335d9f63c057 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:32:17,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:32:17,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:32:17,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:32:17,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:32:17,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:32:17,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:32:17,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:32:17,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:32:17,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:32:17,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:32:17,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:32:17,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:32:17,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:32:17,189 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:32:17,190 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:32:17,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:32:17,190 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:32:17,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:32:17,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:32:17,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:32:17,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:32:17,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:32:17,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:32:17,196 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:32:17,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:32:17,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:32:17,197 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:32:17,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:32:17,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:32:17,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:32:17,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:32:17,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:32:17,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:32:17,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:32:17,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:32:17,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:32:17,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:32:17,200 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:32:17,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:32:17,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:32:17,201 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:32:17,201 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-clean/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-clean/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 -> 91d7b70e505e7aef19ce206c76dac3b8838d1608e22286f0e4e4335d9f63c057 [2024-10-11 14:32:17,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:32:17,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:32:17,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:32:17,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:32:17,467 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:32:17,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2024-10-11 14:32:18,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:32:19,083 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:32:19,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c [2024-10-11 14:32:19,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/babbca52e/b9cd24f68c704f1a98c4e330f62f2037/FLAGe52818eb2 [2024-10-11 14:32:19,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/babbca52e/b9cd24f68c704f1a98c4e330f62f2037 [2024-10-11 14:32:19,116 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:32:19,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:32:19,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:32:19,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:32:19,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:32:19,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d714b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19, skipping insertion in model container [2024-10-11 14:32:19,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:32:19,379 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c[2800,2813] [2024-10-11 14:32:19,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:32:19,413 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:32:19,463 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-array-sum-alt.wvr.c[2800,2813] [2024-10-11 14:32:19,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:32:19,501 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:32:19,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19 WrapperNode [2024-10-11 14:32:19,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:32:19,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:32:19,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:32:19,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:32:19,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,563 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 12, calls inlined = 16, statements flattened = 194 [2024-10-11 14:32:19,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:32:19,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:32:19,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:32:19,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:32:19,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,599 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-10-11 14:32:19,603 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,603 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:32:19,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:32:19,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:32:19,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:32:19,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (1/1) ... [2024-10-11 14:32:19,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:32:19,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:32:19,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:32:19,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:32:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:32:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 14:32:19,721 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 14:32:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 14:32:19,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 14:32:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 14:32:19,722 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 14:32:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:32:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:32:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:32:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:32:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 14:32:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 14:32:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 14:32:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:32:19,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:32:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:32:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:32:19,726 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:32:19,868 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:32:19,870 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:32:20,260 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:32:20,260 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:32:20,521 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:32:20,521 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 14:32:20,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:32:20 BoogieIcfgContainer [2024-10-11 14:32:20,523 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:32:20,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:32:20,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:32:20,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:32:20,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:32:19" (1/3) ... [2024-10-11 14:32:20,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b64e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:32:20, skipping insertion in model container [2024-10-11 14:32:20,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:32:19" (2/3) ... [2024-10-11 14:32:20,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b64e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:32:20, skipping insertion in model container [2024-10-11 14:32:20,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:32:20" (3/3) ... [2024-10-11 14:32:20,534 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt.wvr.c [2024-10-11 14:32:20,551 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:32:20,551 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:32:20,551 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:32:20,614 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 14:32:20,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 93 flow [2024-10-11 14:32:20,691 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-10-11 14:32:20,692 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:32:20,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 33 events. 4/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2024-10-11 14:32:20,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 93 flow [2024-10-11 14:32:20,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 32 transitions, 82 flow [2024-10-11 14:32:20,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:32:20,717 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@59f1cf15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:32:20,717 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 14:32:20,727 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:32:20,727 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2024-10-11 14:32:20,728 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 14:32:20,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:20,729 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:20,729 INFO L396 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-10-11 14:32:20,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash 869360933, now seen corresponding path program 1 times [2024-10-11 14:32:20,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:20,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778329847] [2024-10-11 14:32:20,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:20,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:32:21,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:21,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778329847] [2024-10-11 14:32:21,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778329847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:32:21,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:32:21,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:32:21,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893770244] [2024-10-11 14:32:21,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:32:21,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:32:21,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:32:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:32:21,416 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-10-11 14:32:21,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-10-11 14:32:21,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:21,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-10-11 14:32:21,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:21,883 INFO L124 PetriNetUnfolderBase]: 1210/1831 cut-off events. [2024-10-11 14:32:21,884 INFO L125 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2024-10-11 14:32:21,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3724 conditions, 1831 events. 1210/1831 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8535 event pairs, 308 based on Foata normal form. 1/1823 useless extension candidates. Maximal degree in co-relation 3364. Up to 1239 conditions per place. [2024-10-11 14:32:21,906 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 43 selfloop transitions, 6 changer transitions 1/54 dead transitions. [2024-10-11 14:32:21,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 241 flow [2024-10-11 14:32:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:32:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:32:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2024-10-11 14:32:21,921 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2024-10-11 14:32:21,923 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 82 flow. Second operand 4 states and 79 transitions. [2024-10-11 14:32:21,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 241 flow [2024-10-11 14:32:21,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 54 transitions, 219 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 14:32:21,934 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 112 flow [2024-10-11 14:32:21,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2024-10-11 14:32:21,942 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2024-10-11 14:32:21,942 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 112 flow [2024-10-11 14:32:21,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-10-11 14:32:21,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:21,943 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:21,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:32:21,944 INFO L396 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-10-11 14:32:21,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:21,946 INFO L85 PathProgramCache]: Analyzing trace with hash -84376906, now seen corresponding path program 1 times [2024-10-11 14:32:21,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:21,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942606586] [2024-10-11 14:32:21,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:21,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:32:22,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:22,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942606586] [2024-10-11 14:32:22,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942606586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:32:22,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:32:22,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:32:22,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509933827] [2024-10-11 14:32:22,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:32:22,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:32:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:22,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:32:22,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:32:22,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-10-11 14:32:22,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:32:22,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:22,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-10-11 14:32:22,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:22,540 INFO L124 PetriNetUnfolderBase]: 1772/2859 cut-off events. [2024-10-11 14:32:22,540 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-10-11 14:32:22,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 2859 events. 1772/2859 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15902 event pairs, 1073 based on Foata normal form. 0/2717 useless extension candidates. Maximal degree in co-relation 3817. Up to 1631 conditions per place. [2024-10-11 14:32:22,560 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 56 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2024-10-11 14:32:22,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 70 transitions, 310 flow [2024-10-11 14:32:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:32:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:32:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-10-11 14:32:22,564 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5944444444444444 [2024-10-11 14:32:22,564 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 112 flow. Second operand 5 states and 107 transitions. [2024-10-11 14:32:22,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 70 transitions, 310 flow [2024-10-11 14:32:22,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 70 transitions, 304 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-11 14:32:22,569 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 131 flow [2024-10-11 14:32:22,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2024-10-11 14:32:22,570 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2024-10-11 14:32:22,570 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 131 flow [2024-10-11 14:32:22,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:32:22,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:22,571 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:22,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:32:22,571 INFO L396 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-10-11 14:32:22,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2067289702, now seen corresponding path program 1 times [2024-10-11 14:32:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:22,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39645284] [2024-10-11 14:32:22,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:22,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:32:22,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:22,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39645284] [2024-10-11 14:32:22,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39645284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:32:22,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:32:22,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:32:22,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362593369] [2024-10-11 14:32:22,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:32:22,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:32:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:22,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:32:22,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:32:22,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-10-11 14:32:22,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:32:22,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:22,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-10-11 14:32:22,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:23,024 INFO L124 PetriNetUnfolderBase]: 1478/2414 cut-off events. [2024-10-11 14:32:23,024 INFO L125 PetriNetUnfolderBase]: For 554/658 co-relation queries the response was YES. [2024-10-11 14:32:23,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5200 conditions, 2414 events. 1478/2414 cut-off events. For 554/658 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12930 event pairs, 1040 based on Foata normal form. 0/2290 useless extension candidates. Maximal degree in co-relation 3971. Up to 1623 conditions per place. [2024-10-11 14:32:23,042 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 51 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2024-10-11 14:32:23,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 313 flow [2024-10-11 14:32:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:32:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:32:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2024-10-11 14:32:23,045 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-10-11 14:32:23,045 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 131 flow. Second operand 5 states and 102 transitions. [2024-10-11 14:32:23,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 313 flow [2024-10-11 14:32:23,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 308 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:32:23,048 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 151 flow [2024-10-11 14:32:23,048 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-10-11 14:32:23,050 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2024-10-11 14:32:23,051 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 151 flow [2024-10-11 14:32:23,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:32:23,051 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:23,052 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:23,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:32:23,052 INFO L396 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-10-11 14:32:23,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash -677159742, now seen corresponding path program 1 times [2024-10-11 14:32:23,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:23,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869341801] [2024-10-11 14:32:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:23,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:32:23,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:23,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869341801] [2024-10-11 14:32:23,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869341801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:32:23,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:32:23,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 14:32:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014284844] [2024-10-11 14:32:23,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:32:23,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:32:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:23,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:32:23,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 14:32:23,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-10-11 14:32:23,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:32:23,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:23,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-10-11 14:32:23,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:23,435 INFO L124 PetriNetUnfolderBase]: 1274/1967 cut-off events. [2024-10-11 14:32:23,435 INFO L125 PetriNetUnfolderBase]: For 753/955 co-relation queries the response was YES. [2024-10-11 14:32:23,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4658 conditions, 1967 events. 1274/1967 cut-off events. For 753/955 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9562 event pairs, 936 based on Foata normal form. 0/1839 useless extension candidates. Maximal degree in co-relation 3980. Up to 1604 conditions per place. [2024-10-11 14:32:23,448 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 25 selfloop transitions, 2 changer transitions 23/59 dead transitions. [2024-10-11 14:32:23,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 311 flow [2024-10-11 14:32:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:32:23,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:32:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-10-11 14:32:23,451 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-10-11 14:32:23,451 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 151 flow. Second operand 5 states and 96 transitions. [2024-10-11 14:32:23,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 311 flow [2024-10-11 14:32:23,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 306 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:32:23,454 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 122 flow [2024-10-11 14:32:23,455 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2024-10-11 14:32:23,455 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2024-10-11 14:32:23,456 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 122 flow [2024-10-11 14:32:23,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:32:23,456 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:23,456 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:23,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:32:23,457 INFO L396 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-10-11 14:32:23,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:23,457 INFO L85 PathProgramCache]: Analyzing trace with hash 864869867, now seen corresponding path program 1 times [2024-10-11 14:32:23,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:23,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952969739] [2024-10-11 14:32:23,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:23,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:23,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952969739] [2024-10-11 14:32:23,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952969739] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050496169] [2024-10-11 14:32:23,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:23,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:23,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:32:23,614 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:32:23,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:32:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:23,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:32:23,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:32:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:23,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:32:23,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:23,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2050496169] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:23,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:32:23,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2024-10-11 14:32:23,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121347535] [2024-10-11 14:32:23,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:32:23,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:32:23,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:23,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:32:23,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:32:23,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-10-11 14:32:23,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 122 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-10-11 14:32:23,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:23,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-10-11 14:32:23,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:24,481 INFO L124 PetriNetUnfolderBase]: 1963/3045 cut-off events. [2024-10-11 14:32:24,482 INFO L125 PetriNetUnfolderBase]: For 839/1009 co-relation queries the response was YES. [2024-10-11 14:32:24,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7397 conditions, 3045 events. 1963/3045 cut-off events. For 839/1009 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 16526 event pairs, 387 based on Foata normal form. 0/2702 useless extension candidates. Maximal degree in co-relation 7378. Up to 773 conditions per place. [2024-10-11 14:32:24,504 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 76 selfloop transitions, 15 changer transitions 0/99 dead transitions. [2024-10-11 14:32:24,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 99 transitions, 491 flow [2024-10-11 14:32:24,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:32:24,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:32:24,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-10-11 14:32:24,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2024-10-11 14:32:24,509 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 122 flow. Second operand 9 states and 164 transitions. [2024-10-11 14:32:24,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 99 transitions, 491 flow [2024-10-11 14:32:24,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 99 transitions, 421 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-10-11 14:32:24,525 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 184 flow [2024-10-11 14:32:24,525 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2024-10-11 14:32:24,526 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2024-10-11 14:32:24,529 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 184 flow [2024-10-11 14:32:24,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-10-11 14:32:24,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:24,530 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:24,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:32:24,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:24,734 INFO L396 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-10-11 14:32:24,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:24,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1843011933, now seen corresponding path program 2 times [2024-10-11 14:32:24,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:24,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780435560] [2024-10-11 14:32:24,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:24,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:24,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:24,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780435560] [2024-10-11 14:32:24,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780435560] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:24,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206786944] [2024-10-11 14:32:24,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:32:24,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:24,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:32:24,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:32:24,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:32:24,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:32:24,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:32:24,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:32:24,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:32:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:25,027 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:32:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:25,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206786944] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:25,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:32:25,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2024-10-11 14:32:25,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740222222] [2024-10-11 14:32:25,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:32:25,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:32:25,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:25,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:32:25,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:32:25,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-10-11 14:32:25,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-10-11 14:32:25,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:25,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-10-11 14:32:25,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:25,632 INFO L124 PetriNetUnfolderBase]: 2336/3602 cut-off events. [2024-10-11 14:32:25,632 INFO L125 PetriNetUnfolderBase]: For 1874/1874 co-relation queries the response was YES. [2024-10-11 14:32:25,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9108 conditions, 3602 events. 2336/3602 cut-off events. For 1874/1874 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 19232 event pairs, 364 based on Foata normal form. 16/3589 useless extension candidates. Maximal degree in co-relation 9085. Up to 879 conditions per place. [2024-10-11 14:32:25,656 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 76 selfloop transitions, 28 changer transitions 0/112 dead transitions. [2024-10-11 14:32:25,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 605 flow [2024-10-11 14:32:25,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:32:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:32:25,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-10-11 14:32:25,657 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2024-10-11 14:32:25,658 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 184 flow. Second operand 9 states and 157 transitions. [2024-10-11 14:32:25,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 605 flow [2024-10-11 14:32:25,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 112 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 14:32:25,675 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 391 flow [2024-10-11 14:32:25,675 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=391, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2024-10-11 14:32:25,676 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2024-10-11 14:32:25,676 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 65 transitions, 391 flow [2024-10-11 14:32:25,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-10-11 14:32:25,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:25,677 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:25,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 14:32:25,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:25,878 INFO L396 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-10-11 14:32:25,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:25,879 INFO L85 PathProgramCache]: Analyzing trace with hash 67970723, now seen corresponding path program 3 times [2024-10-11 14:32:25,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:25,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944081532] [2024-10-11 14:32:25,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:25,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:26,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:26,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944081532] [2024-10-11 14:32:26,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944081532] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:26,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469591783] [2024-10-11 14:32:26,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 14:32:26,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:26,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:32:26,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:32:26,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:32:26,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 14:32:26,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:32:26,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:32:26,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:32:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:26,213 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:32:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:26,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469591783] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:26,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:32:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2024-10-11 14:32:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904606454] [2024-10-11 14:32:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:32:26,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:32:26,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:26,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:32:26,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:32:26,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-10-11 14:32:26,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 65 transitions, 391 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-10-11 14:32:26,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:26,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-10-11 14:32:26,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:26,936 INFO L124 PetriNetUnfolderBase]: 2959/4563 cut-off events. [2024-10-11 14:32:26,936 INFO L125 PetriNetUnfolderBase]: For 7927/7931 co-relation queries the response was YES. [2024-10-11 14:32:26,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14799 conditions, 4563 events. 2959/4563 cut-off events. For 7927/7931 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 25378 event pairs, 636 based on Foata normal form. 18/4551 useless extension candidates. Maximal degree in co-relation 14769. Up to 1384 conditions per place. [2024-10-11 14:32:26,971 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 86 selfloop transitions, 46 changer transitions 0/140 dead transitions. [2024-10-11 14:32:26,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 140 transitions, 994 flow [2024-10-11 14:32:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 14:32:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 14:32:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-10-11 14:32:26,973 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-10-11 14:32:26,973 INFO L175 Difference]: Start difference. First operand has 60 places, 65 transitions, 391 flow. Second operand 9 states and 171 transitions. [2024-10-11 14:32:26,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 140 transitions, 994 flow [2024-10-11 14:32:27,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 140 transitions, 969 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-10-11 14:32:27,057 INFO L231 Difference]: Finished difference. Result has 71 places, 85 transitions, 720 flow [2024-10-11 14:32:27,057 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=720, PETRI_PLACES=71, PETRI_TRANSITIONS=85} [2024-10-11 14:32:27,058 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2024-10-11 14:32:27,058 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 85 transitions, 720 flow [2024-10-11 14:32:27,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-10-11 14:32:27,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:27,058 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:27,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 14:32:27,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:27,260 INFO L396 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-10-11 14:32:27,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash -285916323, now seen corresponding path program 4 times [2024-10-11 14:32:27,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:27,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960095090] [2024-10-11 14:32:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:27,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960095090] [2024-10-11 14:32:27,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960095090] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787596206] [2024-10-11 14:32:27,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 14:32:27,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:27,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:32:27,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:32:27,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 14:32:27,515 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 14:32:27,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:32:27,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:32:27,517 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:32:27,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:27,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:32:27,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:27,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787596206] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:32:27,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:32:27,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-11 14:32:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294542980] [2024-10-11 14:32:27,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:32:27,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 14:32:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:27,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 14:32:27,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:32:27,694 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-10-11 14:32:27,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 85 transitions, 720 flow. Second operand has 14 states, 14 states have (on average 9.571428571428571) internal successors, (134), 14 states have internal predecessors, (134), 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-10-11 14:32:27,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:27,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-10-11 14:32:27,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:29,479 INFO L124 PetriNetUnfolderBase]: 5055/7768 cut-off events. [2024-10-11 14:32:29,480 INFO L125 PetriNetUnfolderBase]: For 27395/27466 co-relation queries the response was YES. [2024-10-11 14:32:29,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28229 conditions, 7768 events. 5055/7768 cut-off events. For 27395/27466 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 45328 event pairs, 343 based on Foata normal form. 38/7317 useless extension candidates. Maximal degree in co-relation 28193. Up to 1046 conditions per place. [2024-10-11 14:32:29,544 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 180 selfloop transitions, 149 changer transitions 0/336 dead transitions. [2024-10-11 14:32:29,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 336 transitions, 3041 flow [2024-10-11 14:32:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 14:32:29,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-10-11 14:32:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 425 transitions. [2024-10-11 14:32:29,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45405982905982906 [2024-10-11 14:32:29,546 INFO L175 Difference]: Start difference. First operand has 71 places, 85 transitions, 720 flow. Second operand 26 states and 425 transitions. [2024-10-11 14:32:29,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 336 transitions, 3041 flow [2024-10-11 14:32:29,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 336 transitions, 2896 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-10-11 14:32:29,726 INFO L231 Difference]: Finished difference. Result has 100 places, 193 transitions, 2076 flow [2024-10-11 14:32:29,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2076, PETRI_PLACES=100, PETRI_TRANSITIONS=193} [2024-10-11 14:32:29,727 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 62 predicate places. [2024-10-11 14:32:29,728 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 193 transitions, 2076 flow [2024-10-11 14:32:29,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.571428571428571) internal successors, (134), 14 states have internal predecessors, (134), 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-10-11 14:32:29,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:29,728 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:29,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 14:32:29,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 14:32:29,929 INFO L396 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-10-11 14:32:29,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash -463948317, now seen corresponding path program 5 times [2024-10-11 14:32:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:29,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205366927] [2024-10-11 14:32:29,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:29,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:30,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:30,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:30,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205366927] [2024-10-11 14:32:30,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205366927] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:30,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092876012] [2024-10-11 14:32:30,054 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 14:32:30,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:30,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:32:30,056 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:32:30,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 14:32:30,146 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:32:30,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:32:30,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:32:30,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:32:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:30,227 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:32:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:30,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092876012] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:32:30,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:32:30,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-10-11 14:32:30,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144488982] [2024-10-11 14:32:30,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:32:30,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 14:32:30,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:30,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 14:32:30,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:32:30,329 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-10-11 14:32:30,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 193 transitions, 2076 flow. Second operand has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 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-10-11 14:32:30,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:30,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-10-11 14:32:30,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:32,080 INFO L124 PetriNetUnfolderBase]: 6044/9231 cut-off events. [2024-10-11 14:32:32,080 INFO L125 PetriNetUnfolderBase]: For 41406/41544 co-relation queries the response was YES. [2024-10-11 14:32:32,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37801 conditions, 9231 events. 6044/9231 cut-off events. For 41406/41544 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 54973 event pairs, 595 based on Foata normal form. 126/9234 useless extension candidates. Maximal degree in co-relation 37755. Up to 1352 conditions per place. [2024-10-11 14:32:32,153 INFO L140 encePairwiseOnDemand]: 23/36 looper letters, 174 selfloop transitions, 225 changer transitions 0/406 dead transitions. [2024-10-11 14:32:32,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 406 transitions, 4206 flow [2024-10-11 14:32:32,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 14:32:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 14:32:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 369 transitions. [2024-10-11 14:32:32,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2024-10-11 14:32:32,156 INFO L175 Difference]: Start difference. First operand has 100 places, 193 transitions, 2076 flow. Second operand 22 states and 369 transitions. [2024-10-11 14:32:32,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 406 transitions, 4206 flow [2024-10-11 14:32:32,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 406 transitions, 4085 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-10-11 14:32:32,565 INFO L231 Difference]: Finished difference. Result has 130 places, 308 transitions, 3759 flow [2024-10-11 14:32:32,566 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1973, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3759, PETRI_PLACES=130, PETRI_TRANSITIONS=308} [2024-10-11 14:32:32,567 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 92 predicate places. [2024-10-11 14:32:32,567 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 308 transitions, 3759 flow [2024-10-11 14:32:32,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 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-10-11 14:32:32,567 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:32,568 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:32,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 14:32:32,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:32,772 INFO L396 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-10-11 14:32:32,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:32,773 INFO L85 PathProgramCache]: Analyzing trace with hash -115958229, now seen corresponding path program 6 times [2024-10-11 14:32:32,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:32,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576883596] [2024-10-11 14:32:32,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:32,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:32,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:32,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576883596] [2024-10-11 14:32:32,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576883596] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:32,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935865048] [2024-10-11 14:32:32,945 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 14:32:32,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:32,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:32:32,947 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:32:32,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 14:32:33,036 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-10-11 14:32:33,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:32:33,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:32:33,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:32:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:33,116 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:32:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:33,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935865048] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:33,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:32:33,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 15 [2024-10-11 14:32:33,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679289287] [2024-10-11 14:32:33,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:32:33,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 14:32:33,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:33,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 14:32:33,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-10-11 14:32:33,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-10-11 14:32:33,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 308 transitions, 3759 flow. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-10-11 14:32:33,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:33,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-10-11 14:32:33,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:34,398 INFO L124 PetriNetUnfolderBase]: 4996/7645 cut-off events. [2024-10-11 14:32:34,398 INFO L125 PetriNetUnfolderBase]: For 48906/49074 co-relation queries the response was YES. [2024-10-11 14:32:34,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35033 conditions, 7645 events. 4996/7645 cut-off events. For 48906/49074 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 45579 event pairs, 545 based on Foata normal form. 109/7633 useless extension candidates. Maximal degree in co-relation 34974. Up to 2394 conditions per place. [2024-10-11 14:32:34,542 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 185 selfloop transitions, 148 changer transitions 0/341 dead transitions. [2024-10-11 14:32:34,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 341 transitions, 4532 flow [2024-10-11 14:32:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:32:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-11 14:32:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-10-11 14:32:34,544 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-10-11 14:32:34,544 INFO L175 Difference]: Start difference. First operand has 130 places, 308 transitions, 3759 flow. Second operand 8 states and 145 transitions. [2024-10-11 14:32:34,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 341 transitions, 4532 flow [2024-10-11 14:32:34,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 341 transitions, 4365 flow, removed 68 selfloop flow, removed 4 redundant places. [2024-10-11 14:32:34,929 INFO L231 Difference]: Finished difference. Result has 134 places, 308 transitions, 3942 flow [2024-10-11 14:32:34,929 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3560, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3942, PETRI_PLACES=134, PETRI_TRANSITIONS=308} [2024-10-11 14:32:34,930 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 96 predicate places. [2024-10-11 14:32:34,930 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 308 transitions, 3942 flow [2024-10-11 14:32:34,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 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-10-11 14:32:34,930 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:34,930 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:34,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 14:32:35,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 14:32:35,131 INFO L396 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-10-11 14:32:35,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash 76190665, now seen corresponding path program 1 times [2024-10-11 14:32:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:35,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794500040] [2024-10-11 14:32:35,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:35,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:35,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:35,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794500040] [2024-10-11 14:32:35,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794500040] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:35,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377448634] [2024-10-11 14:32:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:35,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:35,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:32:35,224 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:32:35,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 14:32:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:35,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 14:32:35,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:32:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:35,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:32:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:32:35,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377448634] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:35,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:32:35,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2024-10-11 14:32:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023651489] [2024-10-11 14:32:35,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:32:35,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 14:32:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:35,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 14:32:35,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-11 14:32:35,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-10-11 14:32:35,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 308 transitions, 3942 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:32:35,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:35,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-10-11 14:32:35,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:35,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L66-->L60-6: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][180], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 233#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 8#L98-4true, 36#L48true, Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 229#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 25#L60-6true, Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), 35#L74true, 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0)]) [2024-10-11 14:32:35,917 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-11 14:32:35,917 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-11 14:32:35,918 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-11 14:32:35,918 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-11 14:32:35,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([579] L79-->L73-6: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post9#1=|v_thread3Thread1of1ForFork1_#t~post9#1_1|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 395#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 944#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), 8#L98-4true, 16#L73-6true, 36#L48true, 1136#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), Black: 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 28#L61true, Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0), Black: 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-10-11 14:32:35,918 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-10-11 14:32:35,918 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-10-11 14:32:35,919 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-11 14:32:35,919 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-10-11 14:32:36,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L66-->L60-6: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][180], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 233#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 8#L98-4true, Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 229#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 25#L60-6true, Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), 35#L74true, 12#L50true, 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0)]) [2024-10-11 14:32:36,064 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-10-11 14:32:36,064 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-11 14:32:36,064 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-11 14:32:36,064 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-11 14:32:36,064 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([579] L79-->L73-6: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post9#1=|v_thread3Thread1of1ForFork1_#t~post9#1_1|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 395#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 944#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), 8#L98-4true, 16#L73-6true, 1136#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), Black: 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 12#L50true, 28#L61true, Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0), Black: 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-10-11 14:32:36,065 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-10-11 14:32:36,065 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-11 14:32:36,065 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-11 14:32:36,065 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-11 14:32:36,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L66-->L60-6: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][180], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 233#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 36#L48true, Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 229#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 5#L99true, Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 25#L60-6true, Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), 35#L74true, 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0)]) [2024-10-11 14:32:36,066 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-10-11 14:32:36,066 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-11 14:32:36,066 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-11 14:32:36,066 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-11 14:32:36,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([579] L79-->L73-6: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post9#1=|v_thread3Thread1of1ForFork1_#t~post9#1_1|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 395#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 944#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), 16#L73-6true, 36#L48true, 1136#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), 5#L99true, Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), Black: 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 28#L61true, Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0), Black: 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-10-11 14:32:36,067 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2024-10-11 14:32:36,067 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-11 14:32:36,067 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-11 14:32:36,067 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2024-10-11 14:32:36,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([573] L66-->L60-6: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_10| (+ |v_thread2Thread1of1ForFork0_~i~1#1_9| 1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_9|} OutVars{thread2Thread1of1ForFork0_~tmp~1#1=|v_thread2Thread1of1ForFork0_~tmp~1#1_5|, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_10|, thread2Thread1of1ForFork0_#t~post6#1=|v_thread2Thread1of1ForFork0_#t~post6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~tmp~1#1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_#t~post6#1][180], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), 233#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), Black: 229#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), 5#L99true, Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 25#L60-6true, Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), 35#L74true, 12#L50true, 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0)]) [2024-10-11 14:32:36,124 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-10-11 14:32:36,124 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-11 14:32:36,124 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-11 14:32:36,124 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-11 14:32:36,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([579] L79-->L73-6: Formula: (= |v_thread3Thread1of1ForFork1_~i~2#1_10| (+ |v_thread3Thread1of1ForFork1_~i~2#1_9| 1)) InVars {thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_9|} OutVars{thread3Thread1of1ForFork1_#t~post9#1=|v_thread3Thread1of1ForFork1_#t~post9#1_1|, thread3Thread1of1ForFork1_~tmp~2#1=|v_thread3Thread1of1ForFork1_~tmp~2#1_5|, thread3Thread1of1ForFork1_~i~2#1=|v_thread3Thread1of1ForFork1_~i~2#1_10|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#t~post9#1, thread3Thread1of1ForFork1_~tmp~2#1, thread3Thread1of1ForFork1_~i~2#1][182], [Black: 566#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 395#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 744#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 758#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 766#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 740#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 750#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 954#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 760#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 956#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 785#(<= 1 ~N~0), Black: 635#(and (<= 1 ~N~0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 768#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 950#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 960#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 948#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), 733#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 946#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0)), Black: 966#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 962#(and (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) (+ ~N~0 ~M~0)) (<= 1 ~M~0)), Black: 937#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0)), Black: 958#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= |thread3Thread1of1ForFork1_~i~2#1| ~M~0) (<= 1 ~M~0)), Black: 952#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 397#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), Black: 399#(and (<= 1 ~N~0) (<= 1 ~M~0)), 1293#(and (<= (+ |thread1Thread1of1ForFork2_~i~0#1| 1) ~N~0) (<= 1 ~N~0)), Black: 246#(<= 1 ~N~0), Black: 401#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0)) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), 944#(and (<= 0 |thread1Thread1of1ForFork2_~i~0#1|) (<= 1 ~N~0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 1 ~M~0)), 16#L73-6true, 1136#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~M~0)), Black: 235#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), 564#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0)), Black: 231#(and (<= (+ ~M~0 1) ~N~0) (<= 1 ~N~0)), 5#L99true, Black: 237#(and (<= (+ |thread2Thread1of1ForFork0_~i~1#1| 1) ~N~0) (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0)), Black: 50#(and (= ~res2~0 ~res1~0) (or (= ~res1~0 0) (not (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0))) (or (= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|)))), Black: 48#(= ~res2~0 ~res1~0), Black: 1138#(and (<= 1 ~N~0) (or (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0) (< 0 ~M~0))), 12#L50true, 28#L61true, Black: 572#(and (<= 1 ~N~0) (or (< |thread2Thread1of1ForFork0_~i~1#1| ~M~0) (< |thread3Thread1of1ForFork1_~i~2#1| ~N~0))), Black: 414#(<= 1 ~N~0), Black: 568#(and (<= 1 ~N~0) (<= (+ |thread3Thread1of1ForFork1_~i~2#1| 1) ~N~0))]) [2024-10-11 14:32:36,125 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-10-11 14:32:36,125 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-11 14:32:36,125 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-11 14:32:36,125 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-10-11 14:32:36,488 INFO L124 PetriNetUnfolderBase]: 5543/8627 cut-off events. [2024-10-11 14:32:36,488 INFO L125 PetriNetUnfolderBase]: For 74820/75234 co-relation queries the response was YES. [2024-10-11 14:32:36,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41238 conditions, 8627 events. 5543/8627 cut-off events. For 74820/75234 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 53265 event pairs, 1534 based on Foata normal form. 577/8783 useless extension candidates. Maximal degree in co-relation 41179. Up to 3893 conditions per place. [2024-10-11 14:32:36,567 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 273 selfloop transitions, 43 changer transitions 0/387 dead transitions. [2024-10-11 14:32:36,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 387 transitions, 5734 flow [2024-10-11 14:32:36,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:32:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:32:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-10-11 14:32:36,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2024-10-11 14:32:36,569 INFO L175 Difference]: Start difference. First operand has 134 places, 308 transitions, 3942 flow. Second operand 5 states and 87 transitions. [2024-10-11 14:32:36,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 387 transitions, 5734 flow [2024-10-11 14:32:36,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 387 transitions, 5588 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-10-11 14:32:36,935 INFO L231 Difference]: Finished difference. Result has 136 places, 309 transitions, 4083 flow [2024-10-11 14:32:36,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=3832, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4083, PETRI_PLACES=136, PETRI_TRANSITIONS=309} [2024-10-11 14:32:36,937 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 98 predicate places. [2024-10-11 14:32:36,937 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 309 transitions, 4083 flow [2024-10-11 14:32:36,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 14:32:36,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:36,937 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:36,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 14:32:37,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:37,141 INFO L396 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-10-11 14:32:37,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:37,142 INFO L85 PathProgramCache]: Analyzing trace with hash 418642818, now seen corresponding path program 1 times [2024-10-11 14:32:37,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:37,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216622778] [2024-10-11 14:32:37,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:37,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:37,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:32:37,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:37,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216622778] [2024-10-11 14:32:37,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216622778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:37,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895638667] [2024-10-11 14:32:37,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:37,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:37,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:32:37,908 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:32:37,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 14:32:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:38,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 14:32:38,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:32:38,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:32:38,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 14:32:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:32:38,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:32:38,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-10-11 14:32:38,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:32:38,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2024-10-11 14:32:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:32:39,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895638667] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:32:39,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:32:39,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2024-10-11 14:32:39,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859970736] [2024-10-11 14:32:39,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:32:39,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-11 14:32:39,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:39,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-11 14:32:39,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2024-10-11 14:32:39,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-10-11 14:32:39,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 309 transitions, 4083 flow. Second operand has 29 states, 29 states have (on average 8.068965517241379) internal successors, (234), 29 states have internal predecessors, (234), 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-10-11 14:32:39,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:39,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-10-11 14:32:39,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:43,117 INFO L124 PetriNetUnfolderBase]: 11970/17369 cut-off events. [2024-10-11 14:32:43,118 INFO L125 PetriNetUnfolderBase]: For 103869/104137 co-relation queries the response was YES. [2024-10-11 14:32:43,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78482 conditions, 17369 events. 11970/17369 cut-off events. For 103869/104137 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 103287 event pairs, 1241 based on Foata normal form. 224/17573 useless extension candidates. Maximal degree in co-relation 76918. Up to 10186 conditions per place. [2024-10-11 14:32:43,257 INFO L140 encePairwiseOnDemand]: 21/36 looper letters, 826 selfloop transitions, 188 changer transitions 2/1047 dead transitions. [2024-10-11 14:32:43,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 1047 transitions, 14669 flow [2024-10-11 14:32:43,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 14:32:43,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 14:32:43,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 393 transitions. [2024-10-11 14:32:43,260 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4962121212121212 [2024-10-11 14:32:43,260 INFO L175 Difference]: Start difference. First operand has 136 places, 309 transitions, 4083 flow. Second operand 22 states and 393 transitions. [2024-10-11 14:32:43,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 1047 transitions, 14669 flow [2024-10-11 14:32:44,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 1047 transitions, 14572 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 14:32:44,344 INFO L231 Difference]: Finished difference. Result has 166 places, 496 transitions, 7131 flow [2024-10-11 14:32:44,345 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=4039, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7131, PETRI_PLACES=166, PETRI_TRANSITIONS=496} [2024-10-11 14:32:44,345 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 128 predicate places. [2024-10-11 14:32:44,345 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 496 transitions, 7131 flow [2024-10-11 14:32:44,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.068965517241379) internal successors, (234), 29 states have internal predecessors, (234), 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-10-11 14:32:44,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:32:44,346 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:32:44,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 14:32:44,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 14:32:44,551 INFO L396 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-10-11 14:32:44,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:32:44,551 INFO L85 PathProgramCache]: Analyzing trace with hash -280092252, now seen corresponding path program 2 times [2024-10-11 14:32:44,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:32:44,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186171762] [2024-10-11 14:32:44,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:32:44,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:32:44,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:32:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:32:45,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:32:45,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186171762] [2024-10-11 14:32:45,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186171762] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:32:45,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549864263] [2024-10-11 14:32:45,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:32:45,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:32:45,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:32:45,123 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:32:45,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 14:32:45,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:32:45,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:32:45,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 14:32:45,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:32:45,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:32:45,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:32:45,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-10-11 14:32:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:32:45,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:32:46,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-10-11 14:32:46,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:32:46,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2024-10-11 14:32:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:32:46,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549864263] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:32:46,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:32:46,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2024-10-11 14:32:46,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610915112] [2024-10-11 14:32:46,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:32:46,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-11 14:32:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:32:46,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-11 14:32:46,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 14:32:46,557 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2024-10-11 14:32:46,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 496 transitions, 7131 flow. Second operand has 37 states, 37 states have (on average 5.972972972972973) internal successors, (221), 37 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-10-11 14:32:46,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:32:46,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2024-10-11 14:32:46,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:32:56,540 INFO L124 PetriNetUnfolderBase]: 29791/41992 cut-off events. [2024-10-11 14:32:56,541 INFO L125 PetriNetUnfolderBase]: For 291722/291722 co-relation queries the response was YES. [2024-10-11 14:32:57,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213882 conditions, 41992 events. 29791/41992 cut-off events. For 291722/291722 co-relation queries the response was YES. Maximal size of possible extension queue 1237. Compared 253499 event pairs, 2488 based on Foata normal form. 3/41995 useless extension candidates. Maximal degree in co-relation 212141. Up to 19092 conditions per place. [2024-10-11 14:32:57,271 INFO L140 encePairwiseOnDemand]: 19/36 looper letters, 1282 selfloop transitions, 636 changer transitions 8/1927 dead transitions. [2024-10-11 14:32:57,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 1927 transitions, 28364 flow [2024-10-11 14:32:57,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-10-11 14:32:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2024-10-11 14:32:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 895 transitions. [2024-10-11 14:32:57,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3603059581320451 [2024-10-11 14:32:57,276 INFO L175 Difference]: Start difference. First operand has 166 places, 496 transitions, 7131 flow. Second operand 69 states and 895 transitions. [2024-10-11 14:32:57,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 1927 transitions, 28364 flow [2024-10-11 14:33:04,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 1927 transitions, 28132 flow, removed 115 selfloop flow, removed 1 redundant places. [2024-10-11 14:33:04,201 INFO L231 Difference]: Finished difference. Result has 282 places, 1064 transitions, 17927 flow [2024-10-11 14:33:04,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=7045, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=141, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=17927, PETRI_PLACES=282, PETRI_TRANSITIONS=1064} [2024-10-11 14:33:04,202 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 244 predicate places. [2024-10-11 14:33:04,202 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 1064 transitions, 17927 flow [2024-10-11 14:33:04,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.972972972972973) internal successors, (221), 37 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-10-11 14:33:04,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:33:04,203 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:33:04,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 14:33:04,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:33:04,403 INFO L396 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-10-11 14:33:04,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:33:04,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2136989806, now seen corresponding path program 1 times [2024-10-11 14:33:04,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:33:04,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767313306] [2024-10-11 14:33:04,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:33:04,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:33:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:33:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:33:04,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:33:04,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767313306] [2024-10-11 14:33:04,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767313306] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:33:04,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584726069] [2024-10-11 14:33:04,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:33:04,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:33:04,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:33:04,811 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:33:04,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 14:33:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:33:04,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 14:33:04,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:33:04,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 14:33:05,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:33:05,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:33:05,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:33:05,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 14:33:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 14:33:05,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584726069] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:33:05,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:33:05,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 20 [2024-10-11 14:33:05,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178425090] [2024-10-11 14:33:05,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:33:05,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 14:33:05,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:33:05,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 14:33:05,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-10-11 14:33:05,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-10-11 14:33:05,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 1064 transitions, 17927 flow. Second operand has 21 states, 21 states have (on average 9.619047619047619) internal successors, (202), 21 states have internal predecessors, (202), 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-10-11 14:33:05,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:33:05,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-10-11 14:33:05,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:33:16,793 INFO L124 PetriNetUnfolderBase]: 29013/42657 cut-off events. [2024-10-11 14:33:16,794 INFO L125 PetriNetUnfolderBase]: For 613497/614409 co-relation queries the response was YES. [2024-10-11 14:33:17,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278359 conditions, 42657 events. 29013/42657 cut-off events. For 613497/614409 co-relation queries the response was YES. Maximal size of possible extension queue 1836. Compared 298020 event pairs, 3628 based on Foata normal form. 307/42492 useless extension candidates. Maximal degree in co-relation 278038. Up to 28734 conditions per place. [2024-10-11 14:33:17,988 INFO L140 encePairwiseOnDemand]: 22/36 looper letters, 1202 selfloop transitions, 579 changer transitions 1/1934 dead transitions. [2024-10-11 14:33:17,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 1934 transitions, 33492 flow [2024-10-11 14:33:17,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 14:33:17,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-11 14:33:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 370 transitions. [2024-10-11 14:33:17,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4894179894179894 [2024-10-11 14:33:17,990 INFO L175 Difference]: Start difference. First operand has 282 places, 1064 transitions, 17927 flow. Second operand 21 states and 370 transitions. [2024-10-11 14:33:17,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 1934 transitions, 33492 flow [2024-10-11 14:33:28,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 1934 transitions, 32488 flow, removed 420 selfloop flow, removed 5 redundant places. [2024-10-11 14:33:28,727 INFO L231 Difference]: Finished difference. Result has 310 places, 1441 transitions, 24050 flow [2024-10-11 14:33:28,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=17206, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=260, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=24050, PETRI_PLACES=310, PETRI_TRANSITIONS=1441} [2024-10-11 14:33:28,728 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 272 predicate places. [2024-10-11 14:33:28,728 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 1441 transitions, 24050 flow [2024-10-11 14:33:28,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.619047619047619) internal successors, (202), 21 states have internal predecessors, (202), 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-10-11 14:33:28,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:33:28,729 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:33:28,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 14:33:28,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 14:33:28,929 INFO L396 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-10-11 14:33:28,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:33:28,930 INFO L85 PathProgramCache]: Analyzing trace with hash 694191452, now seen corresponding path program 3 times [2024-10-11 14:33:28,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:33:28,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186287908] [2024-10-11 14:33:28,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:33:28,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:33:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:33:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:33:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:33:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186287908] [2024-10-11 14:33:29,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186287908] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:33:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341733527] [2024-10-11 14:33:29,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 14:33:29,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:33:29,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:33:29,701 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:33:29,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 14:33:29,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 14:33:29,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:33:29,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-10-11 14:33:29,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:33:29,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:33:30,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:33:30,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-10-11 14:33:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:33:30,193 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:33:30,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2024-10-11 14:33:30,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:33:30,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2024-10-11 14:33:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:33:30,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341733527] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:33:30,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:33:30,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2024-10-11 14:33:30,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115900211] [2024-10-11 14:33:30,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:33:30,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-11 14:33:30,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:33:30,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-11 14:33:30,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1175, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 14:33:30,770 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 36 [2024-10-11 14:33:30,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 1441 transitions, 24050 flow. Second operand has 37 states, 37 states have (on average 5.972972972972973) internal successors, (221), 37 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-10-11 14:33:30,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:33:30,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 36 [2024-10-11 14:33:30,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand