/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:33:52,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:33:52,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:33:52,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:33:52,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:33:52,442 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:33:52,443 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:33:52,443 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:33:52,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:33:52,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:33:52,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:33:52,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:33:52,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:33:52,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:33:52,444 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:33:52,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:33:52,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:33:52,444 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:33:52,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:52,445 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:33:52,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:52,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:33:52,446 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:33:52,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:33:52,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:33:52,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:33:52,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:33:52,674 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:33:52,675 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2025-04-14 01:33:53,953 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae2951eb/164bc073df284bba9417db70b7f129dd/FLAG028ffa3f6 [2025-04-14 01:33:54,153 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:33:54,154 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2025-04-14 01:33:54,159 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae2951eb/164bc073df284bba9417db70b7f129dd/FLAG028ffa3f6 [2025-04-14 01:33:55,003 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae2951eb/164bc073df284bba9417db70b7f129dd [2025-04-14 01:33:55,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:33:55,008 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:33:55,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:33:55,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:33:55,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:33:55,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba91e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55, skipping insertion in model container [2025-04-14 01:33:55,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:33:55,233 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2730,2743] [2025-04-14 01:33:55,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:33:55,258 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:33:55,291 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2730,2743] [2025-04-14 01:33:55,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:33:55,314 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:33:55,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55 WrapperNode [2025-04-14 01:33:55,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:33:55,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:33:55,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:33:55,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:33:55,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,347 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 129 [2025-04-14 01:33:55,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:33:55,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:33:55,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:33:55,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:33:55,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,362 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,374 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-14 01:33:55,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,396 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:33:55,396 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:33:55,396 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:33:55,397 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:33:55,397 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (1/1) ... [2025-04-14 01:33:55,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:33:55,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:55,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:33:55,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:33:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:33:55,446 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:33:55,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:33:55,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:33:55,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:33:55,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:33:55,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:33:55,448 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:33:55,541 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:33:55,542 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:33:55,803 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:33:55,804 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:33:55,804 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:33:56,047 WARN L179 LargeBlockEncoding]: Complex 3:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:33:56,049 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:33:56,051 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:33:56,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:33:56 BoogieIcfgContainer [2025-04-14 01:33:56,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:33:56,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:33:56,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:33:56,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:33:56,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:33:55" (1/3) ... [2025-04-14 01:33:56,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55aa1a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:33:56, skipping insertion in model container [2025-04-14 01:33:56,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:33:55" (2/3) ... [2025-04-14 01:33:56,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55aa1a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:33:56, skipping insertion in model container [2025-04-14 01:33:56,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:33:56" (3/3) ... [2025-04-14 01:33:56,059 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-04-14 01:33:56,068 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:33:56,069 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 29 locations, 35 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-14 01:33:56,070 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:33:56,117 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:33:56,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 38 transitions, 97 flow [2025-04-14 01:33:56,163 INFO L116 PetriNetUnfolderBase]: 10/35 cut-off events. [2025-04-14 01:33:56,167 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:33:56,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 10/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 26. Up to 3 conditions per place. [2025-04-14 01:33:56,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 38 transitions, 97 flow [2025-04-14 01:33:56,175 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 34 transitions, 86 flow [2025-04-14 01:33:56,182 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:33:56,190 INFO L340 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;@47c96541, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:33:56,191 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:33:56,206 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:33:56,206 INFO L116 PetriNetUnfolderBase]: 10/33 cut-off events. [2025-04-14 01:33:56,206 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:33:56,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:56,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:56,207 INFO L403 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)] === [2025-04-14 01:33:56,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:56,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2086156113, now seen corresponding path program 1 times [2025-04-14 01:33:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:56,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089943599] [2025-04-14 01:33:56,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:56,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:56,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 01:33:56,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 01:33:56,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:56,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:56,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:56,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089943599] [2025-04-14 01:33:56,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089943599] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:56,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:56,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:33:56,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414698298] [2025-04-14 01:33:56,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:56,781 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:33:56,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:56,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:33:56,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:33:56,803 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:56,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2025-04-14 01:33:56,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:56,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:56,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:57,038 INFO L116 PetriNetUnfolderBase]: 903/1245 cut-off events. [2025-04-14 01:33:57,038 INFO L117 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-04-14 01:33:57,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2562 conditions, 1245 events. 903/1245 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4193 event pairs, 226 based on Foata normal form. 1/872 useless extension candidates. Maximal degree in co-relation 2166. Up to 708 conditions per place. [2025-04-14 01:33:57,047 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 51 selfloop transitions, 3 changer transitions 1/56 dead transitions. [2025-04-14 01:33:57,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 56 transitions, 255 flow [2025-04-14 01:33:57,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:33:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:33:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-14 01:33:57,056 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2025-04-14 01:33:57,057 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 86 flow. Second operand 3 states and 68 transitions. [2025-04-14 01:33:57,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 56 transitions, 255 flow [2025-04-14 01:33:57,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 56 transitions, 233 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:33:57,065 INFO L231 Difference]: Finished difference. Result has 31 places, 36 transitions, 93 flow [2025-04-14 01:33:57,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=31, PETRI_TRANSITIONS=36} [2025-04-14 01:33:57,070 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, -3 predicate places. [2025-04-14 01:33:57,070 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 36 transitions, 93 flow [2025-04-14 01:33:57,070 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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) [2025-04-14 01:33:57,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:57,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:57,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:33:57,071 INFO L403 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)] === [2025-04-14 01:33:57,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:57,071 INFO L85 PathProgramCache]: Analyzing trace with hash -529363696, now seen corresponding path program 1 times [2025-04-14 01:33:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:57,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848981722] [2025-04-14 01:33:57,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:57,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:57,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-14 01:33:57,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:33:57,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:57,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:57,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:57,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848981722] [2025-04-14 01:33:57,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848981722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:57,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:57,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:33:57,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946335232] [2025-04-14 01:33:57,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:57,155 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:57,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:57,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:57,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:57,156 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:57,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 36 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2025-04-14 01:33:57,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:57,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:57,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:57,362 INFO L116 PetriNetUnfolderBase]: 1082/1488 cut-off events. [2025-04-14 01:33:57,362 INFO L117 PetriNetUnfolderBase]: For 175/175 co-relation queries the response was YES. [2025-04-14 01:33:57,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3236 conditions, 1488 events. 1082/1488 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5160 event pairs, 396 based on Foata normal form. 24/1190 useless extension candidates. Maximal degree in co-relation 1125. Up to 1104 conditions per place. [2025-04-14 01:33:57,368 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 60 selfloop transitions, 6 changer transitions 6/73 dead transitions. [2025-04-14 01:33:57,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 73 transitions, 326 flow [2025-04-14 01:33:57,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-14 01:33:57,369 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5723684210526315 [2025-04-14 01:33:57,369 INFO L175 Difference]: Start difference. First operand has 31 places, 36 transitions, 93 flow. Second operand 4 states and 87 transitions. [2025-04-14 01:33:57,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 73 transitions, 326 flow [2025-04-14 01:33:57,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 73 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:57,371 INFO L231 Difference]: Finished difference. Result has 35 places, 40 transitions, 133 flow [2025-04-14 01:33:57,371 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=35, PETRI_TRANSITIONS=40} [2025-04-14 01:33:57,371 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2025-04-14 01:33:57,371 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 40 transitions, 133 flow [2025-04-14 01:33:57,371 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2025-04-14 01:33:57,371 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:57,371 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:57,371 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:33:57,372 INFO L403 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)] === [2025-04-14 01:33:57,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1068052184, now seen corresponding path program 2 times [2025-04-14 01:33:57,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:57,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885919518] [2025-04-14 01:33:57,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:57,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:57,380 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:33:57,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:33:57,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:57,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:57,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:57,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885919518] [2025-04-14 01:33:57,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885919518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:57,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886756259] [2025-04-14 01:33:57,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:57,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:57,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:57,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:33:57,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:33:57,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:33:57,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:33:57,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:57,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:57,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 01:33:57,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:57,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:57,526 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:57,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886756259] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:57,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:57,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-14 01:33:57,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081564557] [2025-04-14 01:33:57,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:57,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:33:57,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:57,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:33:57,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:33:57,543 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:57,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 40 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2025-04-14 01:33:57,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:57,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:57,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:57,773 INFO L116 PetriNetUnfolderBase]: 909/1348 cut-off events. [2025-04-14 01:33:57,773 INFO L117 PetriNetUnfolderBase]: For 1031/1031 co-relation queries the response was YES. [2025-04-14 01:33:57,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3490 conditions, 1348 events. 909/1348 cut-off events. For 1031/1031 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5312 event pairs, 95 based on Foata normal form. 171/1334 useless extension candidates. Maximal degree in co-relation 1258. Up to 636 conditions per place. [2025-04-14 01:33:57,780 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 76 selfloop transitions, 12 changer transitions 2/91 dead transitions. [2025-04-14 01:33:57,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 91 transitions, 457 flow [2025-04-14 01:33:57,781 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:33:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:33:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-04-14 01:33:57,781 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5087719298245614 [2025-04-14 01:33:57,782 INFO L175 Difference]: Start difference. First operand has 35 places, 40 transitions, 133 flow. Second operand 6 states and 116 transitions. [2025-04-14 01:33:57,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 91 transitions, 457 flow [2025-04-14 01:33:57,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 91 transitions, 451 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-04-14 01:33:57,784 INFO L231 Difference]: Finished difference. Result has 45 places, 46 transitions, 221 flow [2025-04-14 01:33:57,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=45, PETRI_TRANSITIONS=46} [2025-04-14 01:33:57,785 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2025-04-14 01:33:57,785 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 221 flow [2025-04-14 01:33:57,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 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) [2025-04-14 01:33:57,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:57,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:57,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 01:33:57,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:57,989 INFO L403 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)] === [2025-04-14 01:33:57,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1801786604, now seen corresponding path program 3 times [2025-04-14 01:33:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:57,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394332992] [2025-04-14 01:33:57,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:33:57,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:57,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:33:58,006 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:33:58,006 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:33:58,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:58,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:58,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394332992] [2025-04-14 01:33:58,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394332992] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:58,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:58,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:33:58,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18256262] [2025-04-14 01:33:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:58,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:58,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:58,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:58,073 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:58,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 221 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2025-04-14 01:33:58,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:58,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:58,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:58,253 INFO L116 PetriNetUnfolderBase]: 887/1323 cut-off events. [2025-04-14 01:33:58,253 INFO L117 PetriNetUnfolderBase]: For 2693/2693 co-relation queries the response was YES. [2025-04-14 01:33:58,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4115 conditions, 1323 events. 887/1323 cut-off events. For 2693/2693 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5006 event pairs, 374 based on Foata normal form. 23/1161 useless extension candidates. Maximal degree in co-relation 2750. Up to 1185 conditions per place. [2025-04-14 01:33:58,261 INFO L140 encePairwiseOnDemand]: 31/38 looper letters, 41 selfloop transitions, 0 changer transitions 19/61 dead transitions. [2025-04-14 01:33:58,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 415 flow [2025-04-14 01:33:58,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:33:58,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:33:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-14 01:33:58,262 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45394736842105265 [2025-04-14 01:33:58,262 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 221 flow. Second operand 4 states and 69 transitions. [2025-04-14 01:33:58,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 415 flow [2025-04-14 01:33:58,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 399 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:58,267 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 190 flow [2025-04-14 01:33:58,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-04-14 01:33:58,268 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2025-04-14 01:33:58,268 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 190 flow [2025-04-14 01:33:58,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2025-04-14 01:33:58,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:58,268 INFO L206 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] [2025-04-14 01:33:58,268 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:33:58,268 INFO L403 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)] === [2025-04-14 01:33:58,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash 598001285, now seen corresponding path program 1 times [2025-04-14 01:33:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:58,269 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468729409] [2025-04-14 01:33:58,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:58,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:58,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 01:33:58,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:33:58,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:58,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:33:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:58,313 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468729409] [2025-04-14 01:33:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468729409] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:58,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:58,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:33:58,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302281927] [2025-04-14 01:33:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:58,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:33:58,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:58,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:33:58,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:33:58,314 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:58,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2025-04-14 01:33:58,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:58,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:58,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:58,445 INFO L116 PetriNetUnfolderBase]: 744/1122 cut-off events. [2025-04-14 01:33:58,445 INFO L117 PetriNetUnfolderBase]: For 1957/1957 co-relation queries the response was YES. [2025-04-14 01:33:58,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 1122 events. 744/1122 cut-off events. For 1957/1957 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4130 event pairs, 124 based on Foata normal form. 0/1010 useless extension candidates. Maximal degree in co-relation 3326. Up to 674 conditions per place. [2025-04-14 01:33:58,451 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 48 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-04-14 01:33:58,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 352 flow [2025-04-14 01:33:58,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:33:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:33:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-04-14 01:33:58,452 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4649122807017544 [2025-04-14 01:33:58,452 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 190 flow. Second operand 3 states and 53 transitions. [2025-04-14 01:33:58,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 352 flow [2025-04-14 01:33:58,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 302 flow, removed 10 selfloop flow, removed 6 redundant places. [2025-04-14 01:33:58,477 INFO L231 Difference]: Finished difference. Result has 42 places, 41 transitions, 157 flow [2025-04-14 01:33:58,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=42, PETRI_TRANSITIONS=41} [2025-04-14 01:33:58,478 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2025-04-14 01:33:58,478 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 41 transitions, 157 flow [2025-04-14 01:33:58,478 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2025-04-14 01:33:58,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:58,478 INFO L206 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] [2025-04-14 01:33:58,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:33:58,478 INFO L403 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)] === [2025-04-14 01:33:58,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:58,479 INFO L85 PathProgramCache]: Analyzing trace with hash 800307048, now seen corresponding path program 1 times [2025-04-14 01:33:58,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:58,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215911540] [2025-04-14 01:33:58,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:58,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:58,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:33:58,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:33:58,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:58,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:58,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215911540] [2025-04-14 01:33:58,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215911540] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:33:58,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:33:58,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:33:58,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320265261] [2025-04-14 01:33:58,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:58,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:33:58,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:58,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:33:58,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:33:58,546 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:58,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 41 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2025-04-14 01:33:58,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:58,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:58,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:58,674 INFO L116 PetriNetUnfolderBase]: 776/1184 cut-off events. [2025-04-14 01:33:58,674 INFO L117 PetriNetUnfolderBase]: For 1579/1579 co-relation queries the response was YES. [2025-04-14 01:33:58,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3358 conditions, 1184 events. 776/1184 cut-off events. For 1579/1579 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4270 event pairs, 351 based on Foata normal form. 34/1136 useless extension candidates. Maximal degree in co-relation 3349. Up to 1057 conditions per place. [2025-04-14 01:33:58,680 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 37 selfloop transitions, 6 changer transitions 23/67 dead transitions. [2025-04-14 01:33:58,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 367 flow [2025-04-14 01:33:58,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:33:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:33:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2025-04-14 01:33:58,682 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-04-14 01:33:58,682 INFO L175 Difference]: Start difference. First operand has 42 places, 41 transitions, 157 flow. Second operand 5 states and 76 transitions. [2025-04-14 01:33:58,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 367 flow [2025-04-14 01:33:58,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:33:58,684 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 199 flow [2025-04-14 01:33:58,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-04-14 01:33:58,685 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2025-04-14 01:33:58,685 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 199 flow [2025-04-14 01:33:58,685 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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) [2025-04-14 01:33:58,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:58,686 INFO L206 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] [2025-04-14 01:33:58,686 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:33:58,686 INFO L403 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)] === [2025-04-14 01:33:58,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1779189271, now seen corresponding path program 1 times [2025-04-14 01:33:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:58,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106551361] [2025-04-14 01:33:58,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:58,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:33:58,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:33:58,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:58,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:58,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:58,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:58,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106551361] [2025-04-14 01:33:58,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106551361] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:58,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783505380] [2025-04-14 01:33:58,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:58,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:58,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:58,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:33:58,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:33:58,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-14 01:33:58,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:33:58,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:58,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:58,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:33:58,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:58,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:33:58,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783505380] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:58,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:33:58,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-04-14 01:33:58,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976705804] [2025-04-14 01:33:58,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:33:58,938 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:33:58,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:58,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:33:58,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:33:58,939 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:33:58,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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) [2025-04-14 01:33:58,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:58,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:33:58,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:59,052 INFO L116 PetriNetUnfolderBase]: 654/968 cut-off events. [2025-04-14 01:33:59,052 INFO L117 PetriNetUnfolderBase]: For 1371/1371 co-relation queries the response was YES. [2025-04-14 01:33:59,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 968 events. 654/968 cut-off events. For 1371/1371 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3224 event pairs, 268 based on Foata normal form. 6/875 useless extension candidates. Maximal degree in co-relation 2769. Up to 679 conditions per place. [2025-04-14 01:33:59,059 INFO L140 encePairwiseOnDemand]: 33/38 looper letters, 51 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2025-04-14 01:33:59,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 362 flow [2025-04-14 01:33:59,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:33:59,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:33:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2025-04-14 01:33:59,061 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35789473684210527 [2025-04-14 01:33:59,061 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 199 flow. Second operand 5 states and 68 transitions. [2025-04-14 01:33:59,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 362 flow [2025-04-14 01:33:59,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 59 transitions, 342 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-04-14 01:33:59,076 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 186 flow [2025-04-14 01:33:59,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2025-04-14 01:33:59,077 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2025-04-14 01:33:59,077 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 186 flow [2025-04-14 01:33:59,077 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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) [2025-04-14 01:33:59,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:59,077 INFO L206 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] [2025-04-14 01:33:59,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:33:59,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-14 01:33:59,278 INFO L403 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)] === [2025-04-14 01:33:59,278 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1964920118, now seen corresponding path program 1 times [2025-04-14 01:33:59,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:59,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401833404] [2025-04-14 01:33:59,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:33:59,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:59,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:33:59,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:33:59,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:33:59,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:34:00,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:00,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401833404] [2025-04-14 01:34:00,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401833404] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:34:00,145 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257514660] [2025-04-14 01:34:00,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:34:00,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:00,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:34:00,148 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:34:00,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:34:00,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:34:00,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:34:00,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:34:00,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:00,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 01:34:00,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:34:00,422 INFO L325 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-04-14 01:34:00,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2025-04-14 01:34:01,322 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:34:01,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 499 [2025-04-14 01:34:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:34:05,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:34:26,046 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:34:26,047 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2025-04-14 01:34:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:34:27,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257514660] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:34:27,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:34:27,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 25 [2025-04-14 01:34:27,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754558425] [2025-04-14 01:34:27,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:34:27,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:34:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:27,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:34:27,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=595, Unknown=4, NotChecked=0, Total=702 [2025-04-14 01:34:27,868 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:34:27,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 186 flow. Second operand has 27 states, 27 states have (on average 7.0) internal successors, (189), 27 states have internal predecessors, (189), 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) [2025-04-14 01:34:27,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:27,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:34:27,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:29,103 INFO L116 PetriNetUnfolderBase]: 1312/1917 cut-off events. [2025-04-14 01:34:29,103 INFO L117 PetriNetUnfolderBase]: For 2752/2758 co-relation queries the response was YES. [2025-04-14 01:34:29,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5506 conditions, 1917 events. 1312/1917 cut-off events. For 2752/2758 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7591 event pairs, 46 based on Foata normal form. 1/1733 useless extension candidates. Maximal degree in co-relation 5495. Up to 894 conditions per place. [2025-04-14 01:34:29,125 INFO L140 encePairwiseOnDemand]: 25/38 looper letters, 127 selfloop transitions, 42 changer transitions 1/171 dead transitions. [2025-04-14 01:34:29,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 171 transitions, 972 flow [2025-04-14 01:34:29,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-14 01:34:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-14 01:34:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 223 transitions. [2025-04-14 01:34:29,126 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3912280701754386 [2025-04-14 01:34:29,126 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 186 flow. Second operand 15 states and 223 transitions. [2025-04-14 01:34:29,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 171 transitions, 972 flow [2025-04-14 01:34:29,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 171 transitions, 930 flow, removed 12 selfloop flow, removed 4 redundant places. [2025-04-14 01:34:29,136 INFO L231 Difference]: Finished difference. Result has 65 places, 79 transitions, 518 flow [2025-04-14 01:34:29,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=518, PETRI_PLACES=65, PETRI_TRANSITIONS=79} [2025-04-14 01:34:29,137 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2025-04-14 01:34:29,137 INFO L485 AbstractCegarLoop]: Abstraction has has 65 places, 79 transitions, 518 flow [2025-04-14 01:34:29,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.0) internal successors, (189), 27 states have internal predecessors, (189), 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) [2025-04-14 01:34:29,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:29,137 INFO L206 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] [2025-04-14 01:34:29,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 01:34:29,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:29,338 INFO L403 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)] === [2025-04-14 01:34:29,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:29,338 INFO L85 PathProgramCache]: Analyzing trace with hash -916306642, now seen corresponding path program 2 times [2025-04-14 01:34:29,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:29,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907438359] [2025-04-14 01:34:29,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:34:29,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:29,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:34:29,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-14 01:34:29,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:34:29,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:29,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:34:29,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:29,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907438359] [2025-04-14 01:34:29,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907438359] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:34:29,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:34:29,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:34:29,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231390548] [2025-04-14 01:34:29,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:34:29,459 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:34:29,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:29,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:34:29,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:34:29,462 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 38 [2025-04-14 01:34:29,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 79 transitions, 518 flow. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) [2025-04-14 01:34:29,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:29,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 38 [2025-04-14 01:34:29,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:29,709 INFO L116 PetriNetUnfolderBase]: 1737/2454 cut-off events. [2025-04-14 01:34:29,709 INFO L117 PetriNetUnfolderBase]: For 5532/5532 co-relation queries the response was YES. [2025-04-14 01:34:29,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9106 conditions, 2454 events. 1737/2454 cut-off events. For 5532/5532 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9384 event pairs, 324 based on Foata normal form. 0/2123 useless extension candidates. Maximal degree in co-relation 9088. Up to 1910 conditions per place. [2025-04-14 01:34:29,720 INFO L140 encePairwiseOnDemand]: 32/38 looper letters, 119 selfloop transitions, 20 changer transitions 0/139 dead transitions. [2025-04-14 01:34:29,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 139 transitions, 1212 flow [2025-04-14 01:34:29,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 01:34:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 01:34:29,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-14 01:34:29,721 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37719298245614036 [2025-04-14 01:34:29,722 INFO L175 Difference]: Start difference. First operand has 65 places, 79 transitions, 518 flow. Second operand 6 states and 86 transitions. [2025-04-14 01:34:29,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 139 transitions, 1212 flow [2025-04-14 01:34:29,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 139 transitions, 1028 flow, removed 86 selfloop flow, removed 2 redundant places. [2025-04-14 01:34:29,739 INFO L231 Difference]: Finished difference. Result has 72 places, 95 transitions, 605 flow [2025-04-14 01:34:29,739 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=605, PETRI_PLACES=72, PETRI_TRANSITIONS=95} [2025-04-14 01:34:29,740 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2025-04-14 01:34:29,740 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 95 transitions, 605 flow [2025-04-14 01:34:29,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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) [2025-04-14 01:34:29,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:29,740 INFO L206 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] [2025-04-14 01:34:29,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 01:34:29,740 INFO L403 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)] === [2025-04-14 01:34:29,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1039199466, now seen corresponding path program 3 times [2025-04-14 01:34:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:29,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634208203] [2025-04-14 01:34:29,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:34:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:29,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:34:29,790 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:34:29,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:34:29,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:34:30,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:30,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634208203] [2025-04-14 01:34:30,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634208203] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:34:30,453 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773529415] [2025-04-14 01:34:30,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:34:30,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:30,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:34:30,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:34:30,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:34:30,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:34:30,540 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:34:30,540 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:34:30,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:30,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:34:30,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:34:30,884 INFO L325 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-04-14 01:34:30,884 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 54 [2025-04-14 01:34:31,269 INFO L325 Elim1Store]: treesize reduction 72, result has 71.1 percent of original size [2025-04-14 01:34:31,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 120 treesize of output 244 [2025-04-14 01:34:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:34:31,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:34:36,032 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~C~0.base Int)) (= (mod (+ c_~asum~0 c_~bsum~0) 4294967296) (mod (+ (select (let ((.cse0 (* c_thread2Thread1of1ForFork2_~i~1 4))) (store (select |c_#memory_int#1| ~C~0.base) (+ ~C~0.offset .cse0) (+ (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int#1| c_~B~0.base) (+ c_~B~0.offset .cse0))))) (+ ~C~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))) c_~csum~0) 4294967296))) is different from false [2025-04-14 01:34:51,125 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:34:51,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2025-04-14 01:35:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:35:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773529415] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:35:09,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:35:09,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 26 [2025-04-14 01:35:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997086488] [2025-04-14 01:35:09,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:35:09,356 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-14 01:35:09,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:35:09,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-14 01:35:09,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=589, Unknown=2, NotChecked=50, Total=756 [2025-04-14 01:35:09,357 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:35:09,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 95 transitions, 605 flow. Second operand has 28 states, 28 states have (on average 6.892857142857143) internal successors, (193), 28 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:09,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:35:09,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:35:09,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:25,557 INFO L116 PetriNetUnfolderBase]: 2227/3218 cut-off events. [2025-04-14 01:35:25,557 INFO L117 PetriNetUnfolderBase]: For 6166/6174 co-relation queries the response was YES. [2025-04-14 01:35:25,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12128 conditions, 3218 events. 2227/3218 cut-off events. For 6166/6174 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 13958 event pairs, 141 based on Foata normal form. 7/2882 useless extension candidates. Maximal degree in co-relation 12105. Up to 1603 conditions per place. [2025-04-14 01:35:25,580 INFO L140 encePairwiseOnDemand]: 27/38 looper letters, 184 selfloop transitions, 73 changer transitions 1/259 dead transitions. [2025-04-14 01:35:25,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 259 transitions, 2011 flow [2025-04-14 01:35:25,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 01:35:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-14 01:35:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 220 transitions. [2025-04-14 01:35:25,582 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41353383458646614 [2025-04-14 01:35:25,582 INFO L175 Difference]: Start difference. First operand has 72 places, 95 transitions, 605 flow. Second operand 14 states and 220 transitions. [2025-04-14 01:35:25,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 259 transitions, 2011 flow [2025-04-14 01:35:25,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 259 transitions, 1949 flow, removed 31 selfloop flow, removed 0 redundant places. [2025-04-14 01:35:25,605 INFO L231 Difference]: Finished difference. Result has 89 places, 151 transitions, 1201 flow [2025-04-14 01:35:25,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1201, PETRI_PLACES=89, PETRI_TRANSITIONS=151} [2025-04-14 01:35:25,606 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 55 predicate places. [2025-04-14 01:35:25,606 INFO L485 AbstractCegarLoop]: Abstraction has has 89 places, 151 transitions, 1201 flow [2025-04-14 01:35:25,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.892857142857143) internal successors, (193), 28 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:25,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:25,607 INFO L206 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] [2025-04-14 01:35:25,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:35:25,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:25,808 INFO L403 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)] === [2025-04-14 01:35:25,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:25,808 INFO L85 PathProgramCache]: Analyzing trace with hash 91438220, now seen corresponding path program 4 times [2025-04-14 01:35:25,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:25,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565176273] [2025-04-14 01:35:25,808 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:35:25,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:25,814 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:35:25,832 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:35:25,832 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:35:25,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:35:27,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:27,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565176273] [2025-04-14 01:35:27,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565176273] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:27,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023048103] [2025-04-14 01:35:27,393 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:35:27,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:27,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:27,400 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:35:27,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:35:27,455 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:35:27,487 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:35:27,487 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:35:27,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:27,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-14 01:35:27,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:33,111 INFO L325 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-04-14 01:35:33,112 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 54 [2025-04-14 01:35:37,234 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:35:37,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 250 [2025-04-14 01:35:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:35:41,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:35:47,319 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~C~0.base Int)) (= (mod (+ c_~asum~0 c_~bsum~0) 4294967296) (mod (+ (select (let ((.cse0 (* c_thread2Thread1of1ForFork2_~i~1 4))) (store (select |c_#memory_int#1| ~C~0.base) (+ ~C~0.offset .cse0) (+ (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int#1| c_~B~0.base) (+ c_~B~0.offset .cse0))))) (+ ~C~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))) c_~csum~0) 4294967296))) is different from false [2025-04-14 01:36:21,433 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:36:21,433 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2025-04-14 01:36:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:36:29,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023048103] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:36:29,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:36:29,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 21 [2025-04-14 01:36:29,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933120812] [2025-04-14 01:36:29,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:36:29,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-14 01:36:29,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:36:29,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-14 01:36:29,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=369, Unknown=5, NotChecked=40, Total=506 [2025-04-14 01:36:29,361 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 38 [2025-04-14 01:36:29,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 151 transitions, 1201 flow. Second operand has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 23 states have internal predecessors, (173), 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) [2025-04-14 01:36:29,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:36:29,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 38 [2025-04-14 01:36:29,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:36:43,386 INFO L116 PetriNetUnfolderBase]: 2656/3860 cut-off events. [2025-04-14 01:36:43,386 INFO L117 PetriNetUnfolderBase]: For 9217/9233 co-relation queries the response was YES. [2025-04-14 01:36:43,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16129 conditions, 3860 events. 2656/3860 cut-off events. For 9217/9233 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17598 event pairs, 195 based on Foata normal form. 17/3477 useless extension candidates. Maximal degree in co-relation 16101. Up to 2295 conditions per place. [2025-04-14 01:36:43,404 INFO L140 encePairwiseOnDemand]: 29/38 looper letters, 187 selfloop transitions, 55 changer transitions 1/244 dead transitions. [2025-04-14 01:36:43,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 244 transitions, 2197 flow [2025-04-14 01:36:43,405 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 01:36:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-14 01:36:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2025-04-14 01:36:43,406 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-04-14 01:36:43,406 INFO L175 Difference]: Start difference. First operand has 89 places, 151 transitions, 1201 flow. Second operand 10 states and 160 transitions. [2025-04-14 01:36:43,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 244 transitions, 2197 flow [2025-04-14 01:36:43,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 244 transitions, 2057 flow, removed 69 selfloop flow, removed 1 redundant places. [2025-04-14 01:36:43,463 INFO L231 Difference]: Finished difference. Result has 100 places, 165 transitions, 1344 flow [2025-04-14 01:36:43,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1344, PETRI_PLACES=100, PETRI_TRANSITIONS=165} [2025-04-14 01:36:43,465 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 66 predicate places. [2025-04-14 01:36:43,465 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 165 transitions, 1344 flow [2025-04-14 01:36:43,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.521739130434782) internal successors, (173), 23 states have internal predecessors, (173), 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) [2025-04-14 01:36:43,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:36:43,465 INFO L206 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] [2025-04-14 01:36:43,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:36:43,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-14 01:36:43,666 INFO L403 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)] === [2025-04-14 01:36:43,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:36:43,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1277303628, now seen corresponding path program 5 times [2025-04-14 01:36:43,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:36:43,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137326844] [2025-04-14 01:36:43,667 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:36:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:36:43,677 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:36:43,708 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:36:43,712 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:36:43,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:36:50,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:36:50,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137326844] [2025-04-14 01:36:50,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137326844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:36:50,696 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520135295] [2025-04-14 01:36:50,696 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:36:50,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:36:50,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:36:50,699 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:36:50,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:36:50,746 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-14 01:36:50,778 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:36:50,778 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:36:50,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:36:50,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-14 01:36:50,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:36:50,848 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-04-14 01:36:52,033 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-14 01:36:52,033 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-14 01:36:53,347 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-14 01:36:53,347 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-14 01:36:58,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2025-04-14 01:37:02,683 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-04-14 01:37:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 01:37:03,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:37:06,229 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:37:06,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 356 treesize of output 336 [2025-04-14 01:37:14,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2025-04-14 01:37:20,781 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:37:20,781 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 155 [2025-04-14 01:37:20,933 INFO L204 Elim1Store]: Index analysis took 115 ms [2025-04-14 01:37:21,321 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:37:21,322 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 99 [2025-04-14 01:37:45,504 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:39:25,686 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 39 [2025-04-14 01:39:25,726 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 87 treesize of output 71 [2025-04-14 01:40:00,323 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:41:33,980 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:41:41,050 WARN L286 SmtUtils]: Spent 7.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:41:49,964 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:42:06,293 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:42:14,306 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:42:30,330 WARN L286 SmtUtils]: Spent 16.02s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:42:35,912 WARN L286 SmtUtils]: Spent 5.58s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:42:47,304 WARN L286 SmtUtils]: Spent 6.77s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:43:03,424 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:43:11,439 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:43:27,468 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:44:03,889 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:44:26,990 WARN L286 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 14 DAG size of output: 1 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:45:25,263 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:45:40,992 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:45:53,512 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:46:01,525 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:47:09,084 WARN L286 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:47:20,405 WARN L286 SmtUtils]: Spent 7.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:47:29,050 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:47:34,059 WARN L286 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:47:46,679 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-14 01:48:25,745 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:48:25,747 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:48:26,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-14 01:48:26,950 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 01:48:27,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2025-04-14 01:48:27,116 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:48:27,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:48:27,116 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2025-04-14 01:48:27,117 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:48:27,117 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:48:27,117 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:48:27,117 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1] [2025-04-14 01:48:27,120 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:48:27,120 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:48:27,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:48:27 BasicIcfg [2025-04-14 01:48:27,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:48:27,122 INFO L158 Benchmark]: Toolchain (without parser) took 872115.08ms. Allocated memory was 125.8MB in the beginning and 155.2MB in the end (delta: 29.4MB). Free memory was 84.9MB in the beginning and 107.8MB in the end (delta: -22.8MB). Peak memory consumption was 382.3MB. Max. memory is 8.0GB. [2025-04-14 01:48:27,123 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 167.8MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:48:27,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.30ms. Allocated memory is still 125.8MB. Free memory was 84.9MB in the beginning and 69.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 01:48:27,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.37ms. Allocated memory is still 125.8MB. Free memory was 69.2MB in the beginning and 67.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:48:27,123 INFO L158 Benchmark]: Boogie Preprocessor took 48.04ms. Allocated memory is still 125.8MB. Free memory was 67.4MB in the beginning and 65.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:48:27,123 INFO L158 Benchmark]: IcfgBuilder took 655.59ms. Allocated memory is still 125.8MB. Free memory was 65.0MB in the beginning and 67.7MB in the end (delta: -2.7MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. [2025-04-14 01:48:27,123 INFO L158 Benchmark]: TraceAbstraction took 871068.92ms. Allocated memory was 125.8MB in the beginning and 155.2MB in the end (delta: 29.4MB). Free memory was 67.7MB in the beginning and 107.8MB in the end (delta: -40.1MB). Peak memory consumption was 363.5MB. Max. memory is 8.0GB. [2025-04-14 01:48:27,124 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 167.8MB. Free memory is still 92.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.30ms. Allocated memory is still 125.8MB. Free memory was 84.9MB in the beginning and 69.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.37ms. Allocated memory is still 125.8MB. Free memory was 69.2MB in the beginning and 67.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 48.04ms. Allocated memory is still 125.8MB. Free memory was 67.4MB in the beginning and 65.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 655.59ms. Allocated memory is still 125.8MB. Free memory was 65.0MB in the beginning and 67.7MB in the end (delta: -2.7MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB. * TraceAbstraction took 871068.92ms. Allocated memory was 125.8MB in the beginning and 155.2MB in the end (delta: 29.4MB). Free memory was 67.7MB in the beginning and 107.8MB in the end (delta: -40.1MB). Peak memory consumption was 363.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 45 locations, 61 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 871.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 33.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 709 SdHoareTripleChecker+Valid, 27.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 708 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 26.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 280 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3772 IncrementalHoareTripleChecker+Invalid, 4099 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 0 mSDtfsCounter, 3772 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 215 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 87.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1344occurred in iteration=11, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 132.3s InterpolantComputationTime, 391 NumberOfCodeBlocks, 387 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 500 ConstructedInterpolants, 21 QuantifiedInterpolants, 5966 SizeOfPredicates, 47 NumberOfNonLiveVariables, 1265 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 41/55 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown