/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:08:41,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:08:41,098 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-13 18:08:41,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:08:41,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:08:41,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:08:41,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:08:41,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:08:41,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:08:41,117 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:08:41,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:08:41,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:08:41,118 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:08:41,118 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:08:41,118 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:08:41,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:08:41,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:08:41,119 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:08:41,119 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:08:41,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:08:41,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:08:41,119 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:08:41,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:08:41,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:08:41,119 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:08:41,120 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:08:41,120 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:08:41,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:08:41,120 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:08:41,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:08:41,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:08:41,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:08:41,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:08:41,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:08:41,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:08:41,121 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 -> FINITE_AUTOMATA [2025-04-13 18:08:41,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:08:41,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:08:41,333 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:08:41,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:08:41,334 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:08:41,335 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-04-13 18:08:42,667 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b503cbd/bd29a54b13584b2084e0170d4bbe15c9/FLAGa75556d21 [2025-04-13 18:08:42,899 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:08:42,899 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-04-13 18:08:42,909 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b503cbd/bd29a54b13584b2084e0170d4bbe15c9/FLAGa75556d21 [2025-04-13 18:08:43,716 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b503cbd/bd29a54b13584b2084e0170d4bbe15c9 [2025-04-13 18:08:43,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:08:43,719 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:08:43,720 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:08:43,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:08:43,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:08:43,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:43,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109df6f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43, skipping insertion in model container [2025-04-13 18:08:43,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:43,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:08:43,899 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-bad-buffer-mult-alt.wvr.c[4345,4358] [2025-04-13 18:08:43,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:08:43,913 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:08:43,938 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-bad-buffer-mult-alt.wvr.c[4345,4358] [2025-04-13 18:08:43,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:08:43,956 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:08:43,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43 WrapperNode [2025-04-13 18:08:43,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:08:43,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:08:43,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:08:43,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:08:43,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:43,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:43,990 INFO L138 Inliner]: procedures = 25, calls = 59, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 293 [2025-04-13 18:08:43,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:08:43,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:08:43,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:08:43,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:08:43,997 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:43,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:44,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:44,025 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 18:08:44,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:44,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:44,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:44,034 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:44,037 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:44,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:44,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:44,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:08:44,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:08:44,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:08:44,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:08:44,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (1/1) ... [2025-04-13 18:08:44,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:08:44,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:44,070 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-13 18:08:44,072 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-13 18:08:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:08:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:08:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:08:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:08:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:08:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:08:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:08:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:08:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:08:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:08:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:08:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:08:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:08:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:08:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:08:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:08:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:08:44,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:08:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:08:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:08:44,092 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:08:44,180 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:08:44,182 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:08:44,503 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:08:44,503 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:08:44,503 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:08:44,815 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:08:44,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:08:44 BoogieIcfgContainer [2025-04-13 18:08:44,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:08:44,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:08:44,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:08:44,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:08:44,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:08:43" (1/3) ... [2025-04-13 18:08:44,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502b08ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:08:44, skipping insertion in model container [2025-04-13 18:08:44,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:08:43" (2/3) ... [2025-04-13 18:08:44,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502b08ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:08:44, skipping insertion in model container [2025-04-13 18:08:44,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:08:44" (3/3) ... [2025-04-13 18:08:44,823 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-04-13 18:08:44,833 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:08:44,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt.wvr.c that has 5 procedures, 44 locations, 45 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 18:08:44,834 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:08:44,886 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 18:08:44,906 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 49 transitions, 126 flow [2025-04-13 18:08:45,155 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 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-13 18:08:45,172 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:08:45,181 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=FINITE_AUTOMATA, 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;@739a977c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:08:45,181 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 18:08:45,200 INFO L278 IsEmpty]: Start isEmpty. Operand has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 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-13 18:08:45,238 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 18:08:45,238 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:45,239 INFO L218 NwaCegarLoop]: 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-13 18:08:45,239 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 2 more)] === [2025-04-13 18:08:45,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:45,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1951841882, now seen corresponding path program 1 times [2025-04-13 18:08:45,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:45,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680806388] [2025-04-13 18:08:45,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:08:45,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:45,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 18:08:45,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 18:08:45,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:45,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:45,871 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-13 18:08:45,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:45,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680806388] [2025-04-13 18:08:45,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680806388] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:45,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:45,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:08:45,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325011125] [2025-04-13 18:08:45,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:45,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:08:45,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:45,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:08:45,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:08:45,911 INFO L87 Difference]: Start difference. First operand has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 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) Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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-13 18:08:46,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:46,286 INFO L93 Difference]: Finished difference Result 7240 states and 31416 transitions. [2025-04-13 18:08:46,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:08:46,288 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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) Word has length 28 [2025-04-13 18:08:46,289 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:46,373 INFO L225 Difference]: With dead ends: 7240 [2025-04-13 18:08:46,373 INFO L226 Difference]: Without dead ends: 6340 [2025-04-13 18:08:46,383 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:08:46,388 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 86 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:46,389 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 44 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:08:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6340 states. [2025-04-13 18:08:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6340 to 5132. [2025-04-13 18:08:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5132 states, 5131 states have (on average 4.353147534593647) internal successors, (22336), 5131 states have internal predecessors, (22336), 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-13 18:08:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5132 states to 5132 states and 22336 transitions. [2025-04-13 18:08:46,773 INFO L79 Accepts]: Start accepts. Automaton has 5132 states and 22336 transitions. Word has length 28 [2025-04-13 18:08:46,774 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:46,774 INFO L485 AbstractCegarLoop]: Abstraction has 5132 states and 22336 transitions. [2025-04-13 18:08:46,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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-13 18:08:46,775 INFO L278 IsEmpty]: Start isEmpty. Operand 5132 states and 22336 transitions. [2025-04-13 18:08:46,795 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:08:46,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:46,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:46,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:08:46,796 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 2 more)] === [2025-04-13 18:08:46,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash -545687663, now seen corresponding path program 1 times [2025-04-13 18:08:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:46,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814236317] [2025-04-13 18:08:46,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:08:46,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:46,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 18:08:46,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:08:46,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:46,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:47,006 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-13 18:08:47,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:47,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814236317] [2025-04-13 18:08:47,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814236317] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:47,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:47,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:08:47,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069711211] [2025-04-13 18:08:47,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:47,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:08:47,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:47,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:08:47,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:08:47,008 INFO L87 Difference]: Start difference. First operand 5132 states and 22336 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-13 18:08:47,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:47,310 INFO L93 Difference]: Finished difference Result 11651 states and 50793 transitions. [2025-04-13 18:08:47,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:08:47,310 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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) Word has length 32 [2025-04-13 18:08:47,310 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:47,399 INFO L225 Difference]: With dead ends: 11651 [2025-04-13 18:08:47,399 INFO L226 Difference]: Without dead ends: 5133 [2025-04-13 18:08:47,407 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:08:47,407 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:47,408 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 48 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:08:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2025-04-13 18:08:47,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 5133. [2025-04-13 18:08:47,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5133 states, 5132 states have (on average 4.352494154325799) internal successors, (22337), 5132 states have internal predecessors, (22337), 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-13 18:08:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 22337 transitions. [2025-04-13 18:08:47,587 INFO L79 Accepts]: Start accepts. Automaton has 5133 states and 22337 transitions. Word has length 32 [2025-04-13 18:08:47,588 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:47,588 INFO L485 AbstractCegarLoop]: Abstraction has 5133 states and 22337 transitions. [2025-04-13 18:08:47,588 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-13 18:08:47,588 INFO L278 IsEmpty]: Start isEmpty. Operand 5133 states and 22337 transitions. [2025-04-13 18:08:47,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 18:08:47,605 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:47,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:47,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:08:47,605 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 2 more)] === [2025-04-13 18:08:47,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:47,606 INFO L85 PathProgramCache]: Analyzing trace with hash 532086306, now seen corresponding path program 1 times [2025-04-13 18:08:47,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:47,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545933393] [2025-04-13 18:08:47,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:08:47,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:47,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 18:08:47,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:08:47,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:47,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:08:47,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:47,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545933393] [2025-04-13 18:08:47,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545933393] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:47,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609939070] [2025-04-13 18:08:47,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:08:47,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:47,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:47,865 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-13 18:08:47,867 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-13 18:08:47,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 18:08:47,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 18:08:47,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:47,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:47,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 18:08:47,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:08:48,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:48,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:08:48,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609939070] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:48,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 18:08:48,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6, 7] total 15 [2025-04-13 18:08:48,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75618672] [2025-04-13 18:08:48,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:48,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 18:08:48,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:48,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 18:08:48,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-13 18:08:48,251 INFO L87 Difference]: Start difference. First operand 5133 states and 22337 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-13 18:08:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:48,760 INFO L93 Difference]: Finished difference Result 8589 states and 37415 transitions. [2025-04-13 18:08:48,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:08:48,760 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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) Word has length 33 [2025-04-13 18:08:48,760 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:48,817 INFO L225 Difference]: With dead ends: 8589 [2025-04-13 18:08:48,818 INFO L226 Difference]: Without dead ends: 8043 [2025-04-13 18:08:48,823 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-04-13 18:08:48,824 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 139 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:48,824 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 93 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:08:48,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8043 states. [2025-04-13 18:08:49,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8043 to 6421. [2025-04-13 18:08:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6421 states, 6420 states have (on average 4.355607476635514) internal successors, (27963), 6420 states have internal predecessors, (27963), 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-13 18:08:49,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6421 states to 6421 states and 27963 transitions. [2025-04-13 18:08:49,247 INFO L79 Accepts]: Start accepts. Automaton has 6421 states and 27963 transitions. Word has length 33 [2025-04-13 18:08:49,247 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:49,247 INFO L485 AbstractCegarLoop]: Abstraction has 6421 states and 27963 transitions. [2025-04-13 18:08:49,247 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 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-13 18:08:49,247 INFO L278 IsEmpty]: Start isEmpty. Operand 6421 states and 27963 transitions. [2025-04-13 18:08:49,268 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 18:08:49,268 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:49,268 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:49,275 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-13 18:08:49,469 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-13 18:08:49,469 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 2 more)] === [2025-04-13 18:08:49,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:49,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1681543284, now seen corresponding path program 2 times [2025-04-13 18:08:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:49,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522737215] [2025-04-13 18:08:49,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:08:49,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:49,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 18:08:49,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 32 of 33 statements. [2025-04-13 18:08:49,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 18:08:49,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:49,663 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-13 18:08:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:49,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522737215] [2025-04-13 18:08:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522737215] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:08:49,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:08:49,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:08:49,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382769005] [2025-04-13 18:08:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:08:49,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:08:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:49,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:08:49,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:08:49,664 INFO L87 Difference]: Start difference. First operand 6421 states and 27963 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-13 18:08:50,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:50,203 INFO L93 Difference]: Finished difference Result 11535 states and 50601 transitions. [2025-04-13 18:08:50,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:08:50,203 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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) Word has length 33 [2025-04-13 18:08:50,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:50,257 INFO L225 Difference]: With dead ends: 11535 [2025-04-13 18:08:50,258 INFO L226 Difference]: Without dead ends: 10695 [2025-04-13 18:08:50,264 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:08:50,265 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 63 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:50,265 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 70 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:08:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10695 states. [2025-04-13 18:08:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10695 to 6503. [2025-04-13 18:08:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6503 states, 6502 states have (on average 4.360350661334974) internal successors, (28351), 6502 states have internal predecessors, (28351), 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-13 18:08:50,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 28351 transitions. [2025-04-13 18:08:50,648 INFO L79 Accepts]: Start accepts. Automaton has 6503 states and 28351 transitions. Word has length 33 [2025-04-13 18:08:50,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:50,649 INFO L485 AbstractCegarLoop]: Abstraction has 6503 states and 28351 transitions. [2025-04-13 18:08:50,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 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-13 18:08:50,649 INFO L278 IsEmpty]: Start isEmpty. Operand 6503 states and 28351 transitions. [2025-04-13 18:08:50,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:08:50,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:50,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:50,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:08:50,666 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 2 more)] === [2025-04-13 18:08:50,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash -564871018, now seen corresponding path program 1 times [2025-04-13 18:08:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:50,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488092957] [2025-04-13 18:08:50,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:08:50,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:50,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:08:50,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:08:50,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:50,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:51,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:51,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488092957] [2025-04-13 18:08:51,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488092957] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:51,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125520620] [2025-04-13 18:08:51,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:08:51,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:51,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:51,263 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-13 18:08:51,265 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-13 18:08:51,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:08:51,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:08:51,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:51,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:51,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 18:08:51,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:51,401 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 18:08:51,691 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 18:08:51,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:51,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:52,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-04-13 18:08:52,084 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 35 [2025-04-13 18:08:52,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:08:52,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125520620] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:08:52,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:08:52,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-13 18:08:52,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146879099] [2025-04-13 18:08:52,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:08:52,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 18:08:52,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:52,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 18:08:52,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-04-13 18:08:52,131 INFO L87 Difference]: Start difference. First operand 6503 states and 28351 transitions. Second operand has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:08:55,848 INFO L93 Difference]: Finished difference Result 36398 states and 158328 transitions. [2025-04-13 18:08:55,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 18:08:55,849 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:08:55,850 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:08:56,030 INFO L225 Difference]: With dead ends: 36398 [2025-04-13 18:08:56,030 INFO L226 Difference]: Without dead ends: 30322 [2025-04-13 18:08:56,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2025-04-13 18:08:56,052 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 827 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 18:08:56,052 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 523 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 18:08:56,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30322 states. [2025-04-13 18:08:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30322 to 15138. [2025-04-13 18:08:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 4.353240404307327) internal successors, (65895), 15137 states have internal predecessors, (65895), 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-13 18:08:57,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 65895 transitions. [2025-04-13 18:08:57,851 INFO L79 Accepts]: Start accepts. Automaton has 15138 states and 65895 transitions. Word has length 36 [2025-04-13 18:08:57,853 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:08:57,853 INFO L485 AbstractCegarLoop]: Abstraction has 15138 states and 65895 transitions. [2025-04-13 18:08:57,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.0588235294117645) internal successors, (86), 17 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:08:57,853 INFO L278 IsEmpty]: Start isEmpty. Operand 15138 states and 65895 transitions. [2025-04-13 18:08:57,898 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:08:57,899 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:08:57,899 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:08:57,906 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-13 18:08:58,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:58,103 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 2 more)] === [2025-04-13 18:08:58,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:08:58,104 INFO L85 PathProgramCache]: Analyzing trace with hash 629024629, now seen corresponding path program 1 times [2025-04-13 18:08:58,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:08:58,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322089730] [2025-04-13 18:08:58,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:08:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:08:58,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:08:58,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:08:58,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:58,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:08:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:08:58,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322089730] [2025-04-13 18:08:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322089730] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:08:58,950 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458724139] [2025-04-13 18:08:58,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:08:58,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:08:58,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:08:58,956 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-13 18:08:58,957 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-13 18:08:59,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:08:59,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:08:59,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:08:59,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:08:59,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 18:08:59,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:08:59,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-04-13 18:08:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:08:59,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:08:59,757 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:08:59,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-04-13 18:08:59,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:08:59,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458724139] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:08:59,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:08:59,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-04-13 18:08:59,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451802236] [2025-04-13 18:08:59,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:08:59,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 18:08:59,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:08:59,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 18:08:59,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-04-13 18:08:59,915 INFO L87 Difference]: Start difference. First operand 15138 states and 65895 transitions. Second operand has 21 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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-13 18:09:07,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:07,470 INFO L93 Difference]: Finished difference Result 54964 states and 239949 transitions. [2025-04-13 18:09:07,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 18:09:07,471 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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) Word has length 38 [2025-04-13 18:09:07,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:07,758 INFO L225 Difference]: With dead ends: 54964 [2025-04-13 18:09:07,758 INFO L226 Difference]: Without dead ends: 49015 [2025-04-13 18:09:07,788 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=874, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 18:09:07,790 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 772 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:07,790 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 532 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 18:09:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49015 states. [2025-04-13 18:09:10,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49015 to 20703. [2025-04-13 18:09:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20703 states, 20702 states have (on average 4.404646894019901) internal successors, (91185), 20702 states have internal predecessors, (91185), 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-13 18:09:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20703 states to 20703 states and 91185 transitions. [2025-04-13 18:09:10,815 INFO L79 Accepts]: Start accepts. Automaton has 20703 states and 91185 transitions. Word has length 38 [2025-04-13 18:09:10,815 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:10,815 INFO L485 AbstractCegarLoop]: Abstraction has 20703 states and 91185 transitions. [2025-04-13 18:09:10,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.6) internal successors, (92), 20 states have internal predecessors, (92), 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-13 18:09:10,815 INFO L278 IsEmpty]: Start isEmpty. Operand 20703 states and 91185 transitions. [2025-04-13 18:09:10,870 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 18:09:10,870 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:10,871 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:10,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 18:09:11,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:11,071 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 2 more)] === [2025-04-13 18:09:11,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash -203783834, now seen corresponding path program 1 times [2025-04-13 18:09:11,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:11,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678951769] [2025-04-13 18:09:11,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:09:11,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:11,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 18:09:11,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 18:09:11,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:11,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:11,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:11,138 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678951769] [2025-04-13 18:09:11,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678951769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:11,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:11,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:09:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821237765] [2025-04-13 18:09:11,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:11,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:09:11,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:11,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:09:11,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:09:11,141 INFO L87 Difference]: Start difference. First operand 20703 states and 91185 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-13 18:09:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:15,299 INFO L93 Difference]: Finished difference Result 32883 states and 144976 transitions. [2025-04-13 18:09:15,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:09:15,299 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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) Word has length 39 [2025-04-13 18:09:15,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:15,429 INFO L225 Difference]: With dead ends: 32883 [2025-04-13 18:09:15,429 INFO L226 Difference]: Without dead ends: 27185 [2025-04-13 18:09:15,451 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:09:15,451 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:15,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 18:09:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27185 states. [2025-04-13 18:09:18,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27185 to 25960. [2025-04-13 18:09:18,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25960 states, 25959 states have (on average 4.3997842752032055) internal successors, (114214), 25959 states have internal predecessors, (114214), 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-13 18:09:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25960 states to 25960 states and 114214 transitions. [2025-04-13 18:09:18,868 INFO L79 Accepts]: Start accepts. Automaton has 25960 states and 114214 transitions. Word has length 39 [2025-04-13 18:09:18,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:18,869 INFO L485 AbstractCegarLoop]: Abstraction has 25960 states and 114214 transitions. [2025-04-13 18:09:18,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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-13 18:09:18,869 INFO L278 IsEmpty]: Start isEmpty. Operand 25960 states and 114214 transitions. [2025-04-13 18:09:18,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-04-13 18:09:18,924 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:18,924 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:18,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:09:18,924 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 2 more)] === [2025-04-13 18:09:18,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash 2118659722, now seen corresponding path program 2 times [2025-04-13 18:09:18,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:18,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031429385] [2025-04-13 18:09:18,924 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:18,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:18,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 18:09:18,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:09:18,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:18,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:09:19,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:19,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031429385] [2025-04-13 18:09:19,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031429385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:19,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114593324] [2025-04-13 18:09:19,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:09:19,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:19,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:19,005 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-13 18:09:19,006 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-13 18:09:19,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-13 18:09:19,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-13 18:09:19,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:09:19,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:19,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 18:09:19,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:09:19,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 18:09:19,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114593324] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:19,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:19,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2025-04-13 18:09:19,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024135832] [2025-04-13 18:09:19,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:19,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 18:09:19,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:19,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 18:09:19,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:09:19,201 INFO L87 Difference]: Start difference. First operand 25960 states and 114214 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:24,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:24,768 INFO L93 Difference]: Finished difference Result 48628 states and 213787 transitions. [2025-04-13 18:09:24,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:09:24,769 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-04-13 18:09:24,769 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:24,929 INFO L225 Difference]: With dead ends: 48628 [2025-04-13 18:09:24,929 INFO L226 Difference]: Without dead ends: 34943 [2025-04-13 18:09:24,959 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:09:24,960 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 117 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:24,960 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 51 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:09:24,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34943 states. [2025-04-13 18:09:29,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34943 to 29463. [2025-04-13 18:09:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29463 states, 29462 states have (on average 4.400108614486457) internal successors, (129636), 29462 states have internal predecessors, (129636), 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-13 18:09:29,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29463 states to 29463 states and 129636 transitions. [2025-04-13 18:09:29,273 INFO L79 Accepts]: Start accepts. Automaton has 29463 states and 129636 transitions. Word has length 41 [2025-04-13 18:09:29,274 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:29,274 INFO L485 AbstractCegarLoop]: Abstraction has 29463 states and 129636 transitions. [2025-04-13 18:09:29,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:09:29,274 INFO L278 IsEmpty]: Start isEmpty. Operand 29463 states and 129636 transitions. [2025-04-13 18:09:29,338 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-13 18:09:29,338 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:29,338 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:29,344 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-13 18:09:29,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:29,542 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 2 more)] === [2025-04-13 18:09:29,542 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:29,542 INFO L85 PathProgramCache]: Analyzing trace with hash 882700531, now seen corresponding path program 3 times [2025-04-13 18:09:29,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:29,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127225052] [2025-04-13 18:09:29,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:29,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:29,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-04-13 18:09:29,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 42 statements. [2025-04-13 18:09:29,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:09:29,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-13 18:09:29,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:29,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127225052] [2025-04-13 18:09:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127225052] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:09:29,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604943882] [2025-04-13 18:09:29,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:09:29,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:29,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:09:29,823 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-13 18:09:29,825 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-13 18:09:29,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-04-13 18:09:29,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 42 statements. [2025-04-13 18:09:29,905 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:09:29,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:29,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 18:09:29,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:09:30,076 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:09:30,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-04-13 18:09:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:09:30,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:09:30,273 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-04-13 18:09:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-13 18:09:30,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604943882] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:09:30,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:09:30,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2025-04-13 18:09:30,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950887605] [2025-04-13 18:09:30,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:09:30,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 18:09:30,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:30,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 18:09:30,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2025-04-13 18:09:30,358 INFO L87 Difference]: Start difference. First operand 29463 states and 129636 transitions. Second operand has 22 states, 21 states have (on average 4.809523809523809) internal successors, (101), 21 states have internal predecessors, (101), 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-13 18:09:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:42,302 INFO L93 Difference]: Finished difference Result 60344 states and 259920 transitions. [2025-04-13 18:09:42,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 18:09:42,302 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.809523809523809) internal successors, (101), 21 states have internal predecessors, (101), 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) Word has length 42 [2025-04-13 18:09:42,302 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:42,597 INFO L225 Difference]: With dead ends: 60344 [2025-04-13 18:09:42,598 INFO L226 Difference]: Without dead ends: 60173 [2025-04-13 18:09:42,619 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=390, Invalid=1416, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 18:09:42,620 INFO L437 NwaCegarLoop]: 91 mSDtfsCounter, 950 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:42,620 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 751 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 18:09:42,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60173 states. [2025-04-13 18:09:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60173 to 25362. [2025-04-13 18:09:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25362 states, 25361 states have (on average 4.4163479358069475) internal successors, (112003), 25361 states have internal predecessors, (112003), 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-13 18:09:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25362 states to 25362 states and 112003 transitions. [2025-04-13 18:09:47,321 INFO L79 Accepts]: Start accepts. Automaton has 25362 states and 112003 transitions. Word has length 42 [2025-04-13 18:09:47,322 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:09:47,322 INFO L485 AbstractCegarLoop]: Abstraction has 25362 states and 112003 transitions. [2025-04-13 18:09:47,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.809523809523809) internal successors, (101), 21 states have internal predecessors, (101), 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-13 18:09:47,322 INFO L278 IsEmpty]: Start isEmpty. Operand 25362 states and 112003 transitions. [2025-04-13 18:09:47,375 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:09:47,375 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:09:47,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:09:47,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 18:09:47,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:09:47,580 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 2 more)] === [2025-04-13 18:09:47,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:09:47,580 INFO L85 PathProgramCache]: Analyzing trace with hash 606953881, now seen corresponding path program 1 times [2025-04-13 18:09:47,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:09:47,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312481646] [2025-04-13 18:09:47,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:09:47,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:09:47,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 18:09:47,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:09:47,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:09:47,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:09:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:09:47,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:09:47,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312481646] [2025-04-13 18:09:47,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312481646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:09:47,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:09:47,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:09:47,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486222500] [2025-04-13 18:09:47,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:09:47,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:09:47,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:09:47,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:09:47,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:09:47,666 INFO L87 Difference]: Start difference. First operand 25362 states and 112003 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-13 18:09:55,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:09:55,576 INFO L93 Difference]: Finished difference Result 51531 states and 226793 transitions. [2025-04-13 18:09:55,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:09:55,576 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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) Word has length 43 [2025-04-13 18:09:55,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:09:55,762 INFO L225 Difference]: With dead ends: 51531 [2025-04-13 18:09:55,762 INFO L226 Difference]: Without dead ends: 31168 [2025-04-13 18:09:55,801 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:09:55,802 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:09:55,802 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:09:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31168 states. [2025-04-13 18:10:00,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31168 to 29381. [2025-04-13 18:10:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29381 states, 29380 states have (on average 4.379816201497618) internal successors, (128679), 29380 states have internal predecessors, (128679), 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-13 18:10:00,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29381 states to 29381 states and 128679 transitions. [2025-04-13 18:10:00,656 INFO L79 Accepts]: Start accepts. Automaton has 29381 states and 128679 transitions. Word has length 43 [2025-04-13 18:10:00,657 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:10:00,657 INFO L485 AbstractCegarLoop]: Abstraction has 29381 states and 128679 transitions. [2025-04-13 18:10:00,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-13 18:10:00,657 INFO L278 IsEmpty]: Start isEmpty. Operand 29381 states and 128679 transitions. [2025-04-13 18:10:00,717 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:10:00,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:10:00,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:10:00,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:10:00,718 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 2 more)] === [2025-04-13 18:10:00,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:10:00,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1378098420, now seen corresponding path program 4 times [2025-04-13 18:10:00,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:10:00,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912503186] [2025-04-13 18:10:00,718 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:00,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:10:00,725 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:10:00,738 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:10:00,738 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:10:00,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:10:01,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:10:01,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912503186] [2025-04-13 18:10:01,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912503186] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:10:01,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526819531] [2025-04-13 18:10:01,150 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:10:01,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:10:01,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:10:01,152 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-13 18:10:01,154 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-13 18:10:01,214 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:10:01,248 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:10:01,248 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:10:01,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:10:01,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 18:10:01,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:10:01,292 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 18:10:01,745 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:01,745 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-04-13 18:10:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:01,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:10:02,231 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 82 [2025-04-13 18:10:02,237 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 18:10:02,237 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 123 [2025-04-13 18:10:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:10:02,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526819531] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:10:02,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:10:02,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2025-04-13 18:10:02,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899844357] [2025-04-13 18:10:02,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:10:02,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 18:10:02,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:10:02,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 18:10:02,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2025-04-13 18:10:02,320 INFO L87 Difference]: Start difference. First operand 29381 states and 128679 transitions. Second operand has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 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-13 18:10:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:10:59,229 INFO L93 Difference]: Finished difference Result 229605 states and 997125 transitions. [2025-04-13 18:10:59,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2025-04-13 18:10:59,229 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 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) Word has length 44 [2025-04-13 18:10:59,229 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:11:00,914 INFO L225 Difference]: With dead ends: 229605 [2025-04-13 18:11:00,914 INFO L226 Difference]: Without dead ends: 213728 [2025-04-13 18:11:01,005 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3832 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1978, Invalid=9152, Unknown=0, NotChecked=0, Total=11130 [2025-04-13 18:11:01,005 INFO L437 NwaCegarLoop]: 143 mSDtfsCounter, 2560 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2560 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 3953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:11:01,005 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2560 Valid, 2111 Invalid, 3953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-04-13 18:11:01,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213728 states. [2025-04-13 18:11:21,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213728 to 78733. [2025-04-13 18:11:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78733 states, 78732 states have (on average 4.524361123812427) internal successors, (356212), 78732 states have internal predecessors, (356212), 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-13 18:11:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78733 states to 78733 states and 356212 transitions. [2025-04-13 18:11:22,086 INFO L79 Accepts]: Start accepts. Automaton has 78733 states and 356212 transitions. Word has length 44 [2025-04-13 18:11:22,086 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:11:22,086 INFO L485 AbstractCegarLoop]: Abstraction has 78733 states and 356212 transitions. [2025-04-13 18:11:22,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 states have internal predecessors, (122), 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-13 18:11:22,086 INFO L278 IsEmpty]: Start isEmpty. Operand 78733 states and 356212 transitions. [2025-04-13 18:11:22,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:11:22,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:11:22,258 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:11:22,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 18:11:22,459 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:11:22,459 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 2 more)] === [2025-04-13 18:11:22,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:11:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash 513347721, now seen corresponding path program 1 times [2025-04-13 18:11:22,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:11:22,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286338128] [2025-04-13 18:11:22,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:11:22,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:11:22,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 18:11:22,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:11:22,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:11:22,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:11:22,594 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-13 18:11:22,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:11:22,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286338128] [2025-04-13 18:11:22,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286338128] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:11:22,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:11:22,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:11:22,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541104723] [2025-04-13 18:11:22,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:11:22,595 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:11:22,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:11:22,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:11:22,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:11:22,595 INFO L87 Difference]: Start difference. First operand 78733 states and 356212 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-13 18:11:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:11:53,622 INFO L93 Difference]: Finished difference Result 103089 states and 470802 transitions. [2025-04-13 18:11:53,623 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:11:53,623 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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) Word has length 44 [2025-04-13 18:11:53,623 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:11:54,332 INFO L225 Difference]: With dead ends: 103089 [2025-04-13 18:11:54,332 INFO L226 Difference]: Without dead ends: 97246 [2025-04-13 18:11:54,380 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:11:54,382 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 89 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:11:54,382 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 128 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:11:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97246 states. [2025-04-13 18:12:16,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97246 to 79983. [2025-04-13 18:12:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79983 states, 79982 states have (on average 4.525918331624616) internal successors, (361992), 79982 states have internal predecessors, (361992), 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-13 18:12:17,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79983 states to 79983 states and 361992 transitions. [2025-04-13 18:12:17,504 INFO L79 Accepts]: Start accepts. Automaton has 79983 states and 361992 transitions. Word has length 44 [2025-04-13 18:12:17,511 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:12:17,511 INFO L485 AbstractCegarLoop]: Abstraction has 79983 states and 361992 transitions. [2025-04-13 18:12:17,511 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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-13 18:12:17,511 INFO L278 IsEmpty]: Start isEmpty. Operand 79983 states and 361992 transitions. [2025-04-13 18:12:17,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:12:17,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:12:17,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:12:17,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:12:17,966 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:12:17,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:12:17,968 INFO L85 PathProgramCache]: Analyzing trace with hash -374470177, now seen corresponding path program 2 times [2025-04-13 18:12:17,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:12:17,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213027821] [2025-04-13 18:12:17,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:12:17,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:12:18,022 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:12:18,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:12:18,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:12:18,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:12:18,832 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-13 18:12:18,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:12:18,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213027821] [2025-04-13 18:12:18,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213027821] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:12:18,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596043308] [2025-04-13 18:12:18,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:12:18,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:12:18,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:12:18,835 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:12:18,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 18:12:18,920 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:12:18,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:12:18,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:12:18,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:12:18,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 18:12:18,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:12:19,146 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-13 18:12:19,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:12:19,382 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-13 18:12:19,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596043308] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:12:19,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:12:19,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 11] total 24 [2025-04-13 18:12:19,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067999310] [2025-04-13 18:12:19,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:12:19,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 18:12:19,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:12:19,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 18:12:19,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2025-04-13 18:12:19,384 INFO L87 Difference]: Start difference. First operand 79983 states and 361992 transitions. Second operand has 25 states, 25 states have (on average 3.4) internal successors, (85), 24 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:13:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:13:16,707 INFO L93 Difference]: Finished difference Result 156662 states and 699976 transitions. [2025-04-13 18:13:16,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 18:13:16,710 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 24 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 18:13:16,714 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:13:18,359 INFO L225 Difference]: With dead ends: 156662 [2025-04-13 18:13:18,359 INFO L226 Difference]: Without dead ends: 152478 [2025-04-13 18:13:18,445 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2044 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1139, Invalid=5341, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 18:13:18,446 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 2199 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2199 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 18:13:18,446 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2199 Valid, 608 Invalid, 2285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2199 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 18:13:19,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152478 states. [2025-04-13 18:13:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152478 to 105010. [2025-04-13 18:13:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105010 states, 105009 states have (on average 4.592539687074441) internal successors, (482258), 105009 states have internal predecessors, (482258), 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-13 18:13:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105010 states to 105010 states and 482258 transitions. [2025-04-13 18:13:53,193 INFO L79 Accepts]: Start accepts. Automaton has 105010 states and 482258 transitions. Word has length 44 [2025-04-13 18:13:53,198 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:13:53,198 INFO L485 AbstractCegarLoop]: Abstraction has 105010 states and 482258 transitions. [2025-04-13 18:13:53,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 24 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:13:53,198 INFO L278 IsEmpty]: Start isEmpty. Operand 105010 states and 482258 transitions. [2025-04-13 18:13:53,843 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:13:53,843 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:13:53,843 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:13:53,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 18:13:54,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:13:54,048 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:13:54,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:13:54,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1022568739, now seen corresponding path program 3 times [2025-04-13 18:13:54,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:13:54,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705493547] [2025-04-13 18:13:54,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:13:54,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:13:54,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:13:54,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:13:54,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:13:54,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:13:54,698 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-13 18:13:54,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:13:54,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705493547] [2025-04-13 18:13:54,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705493547] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:13:54,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911989353] [2025-04-13 18:13:54,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 18:13:54,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:13:54,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:13:54,705 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:13:54,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 18:13:54,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:13:54,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:13:54,826 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 18:13:54,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:13:54,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 18:13:54,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:13:55,043 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-13 18:13:55,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:13:55,368 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-13 18:13:55,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911989353] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:13:55,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:13:55,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 13] total 26 [2025-04-13 18:13:55,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125555012] [2025-04-13 18:13:55,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:13:55,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 18:13:55,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:13:55,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 18:13:55,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2025-04-13 18:13:55,373 INFO L87 Difference]: Start difference. First operand 105010 states and 482258 transitions. Second operand has 27 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 26 states have internal predecessors, (99), 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-13 18:15:23,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:15:23,856 INFO L93 Difference]: Finished difference Result 210955 states and 905516 transitions. [2025-04-13 18:15:23,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2025-04-13 18:15:23,856 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 26 states have internal predecessors, (99), 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) Word has length 44 [2025-04-13 18:15:23,857 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:15:25,646 INFO L225 Difference]: With dead ends: 210955 [2025-04-13 18:15:25,647 INFO L226 Difference]: Without dead ends: 207658 [2025-04-13 18:15:25,731 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16648 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5615, Invalid=34585, Unknown=0, NotChecked=0, Total=40200 [2025-04-13 18:15:25,731 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 3854 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 4799 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3854 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 5032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 4799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-04-13 18:15:25,732 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3854 Valid, 1112 Invalid, 5032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 4799 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-04-13 18:15:25,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207658 states. [2025-04-13 18:16:02,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207658 to 108230. [2025-04-13 18:16:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108230 states, 108229 states have (on average 4.5923273799074185) internal successors, (497023), 108229 states have internal predecessors, (497023), 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-13 18:16:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108230 states to 108230 states and 497023 transitions. [2025-04-13 18:16:02,975 INFO L79 Accepts]: Start accepts. Automaton has 108230 states and 497023 transitions. Word has length 44 [2025-04-13 18:16:02,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:16:02,976 INFO L485 AbstractCegarLoop]: Abstraction has 108230 states and 497023 transitions. [2025-04-13 18:16:02,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.6666666666666665) internal successors, (99), 26 states have internal predecessors, (99), 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-13 18:16:02,976 INFO L278 IsEmpty]: Start isEmpty. Operand 108230 states and 497023 transitions. [2025-04-13 18:16:03,241 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 18:16:03,241 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:16:03,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:16:03,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 18:16:03,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 18:16:03,442 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:16:03,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:16:03,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1331330265, now seen corresponding path program 4 times [2025-04-13 18:16:03,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:16:03,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527356627] [2025-04-13 18:16:03,443 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:16:03,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:16:03,452 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:16:03,474 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:16:03,474 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:16:03,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:04,510 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-13 18:16:04,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:16:04,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527356627] [2025-04-13 18:16:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527356627] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 18:16:04,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64623400] [2025-04-13 18:16:04,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 18:16:04,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 18:16:04,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:16:04,513 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 18:16:04,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 18:16:04,587 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 18:16:04,620 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 18:16:04,621 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 18:16:04,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:16:04,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 18:16:04,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 18:16:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:16:04,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 18:16:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:16:05,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64623400] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 18:16:05,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 18:16:05,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 11] total 25 [2025-04-13 18:16:05,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286684742] [2025-04-13 18:16:05,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 18:16:05,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 18:16:05,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:16:05,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 18:16:05,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2025-04-13 18:16:05,080 INFO L87 Difference]: Start difference. First operand 108230 states and 497023 transitions. Second operand has 26 states, 26 states have (on average 4.0) internal successors, (104), 25 states have internal predecessors, (104), 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) Received shutdown request... [2025-04-13 18:20:14,691 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-13 18:20:14,691 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 18:20:14,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 277 states. [2025-04-13 18:20:14,718 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39520 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=15102, Invalid=69870, Unknown=0, NotChecked=0, Total=84972 [2025-04-13 18:20:14,719 INFO L437 NwaCegarLoop]: 45 mSDtfsCounter, 2500 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 6759 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2500 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 6938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 6759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:20:14,719 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2500 Valid, 1282 Invalid, 6938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 6759 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-04-13 18:20:14,721 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 18:20:14,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 18:20:14,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 18:20:14,922 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (108230states) and FLOYD_HOARE automaton (currently 277 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (537958 states constructed, input type IntersectNwa). [2025-04-13 18:20:14,924 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 18:20:14,929 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 18:20:14,929 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 18:20:14,929 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 18:20:14,932 INFO L422 BasicCegarLoop]: Path program histogram: [4, 4, 2, 1, 1, 1, 1, 1] [2025-04-13 18:20:14,940 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:20:14,940 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:20:14,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:20:14 BasicIcfg [2025-04-13 18:20:14,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:20:14,949 INFO L158 Benchmark]: Toolchain (without parser) took 691230.05ms. Allocated memory was 155.2MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 107.0MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. [2025-04-13 18:20:14,950 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:20:14,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.30ms. Allocated memory is still 155.2MB. Free memory was 107.0MB in the beginning and 91.0MB in the end (delta: 16.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:20:14,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.95ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 88.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:20:14,950 INFO L158 Benchmark]: Boogie Preprocessor took 51.36ms. Allocated memory is still 155.2MB. Free memory was 88.5MB in the beginning and 86.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:20:14,950 INFO L158 Benchmark]: RCFGBuilder took 773.01ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 47.5MB in the end (delta: 37.7MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. [2025-04-13 18:20:14,952 INFO L158 Benchmark]: TraceAbstraction took 690131.62ms. Allocated memory was 155.2MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 46.7MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. [2025-04-13 18:20:14,953 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.17ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.30ms. Allocated memory is still 155.2MB. Free memory was 107.0MB in the beginning and 91.0MB in the end (delta: 16.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.95ms. Allocated memory is still 155.2MB. Free memory was 91.0MB in the beginning and 88.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 51.36ms. Allocated memory is still 155.2MB. Free memory was 88.5MB in the beginning and 86.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 773.01ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 47.5MB in the end (delta: 37.7MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. * TraceAbstraction took 690131.62ms. Allocated memory was 155.2MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 46.7MB in the beginning and 2.5GB in the end (delta: -2.5GB). Peak memory consumption was 5.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (108230states) and FLOYD_HOARE automaton (currently 277 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (537958 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (108230states) and FLOYD_HOARE automaton (currently 277 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (537958 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (108230states) and FLOYD_HOARE automaton (currently 277 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (537958 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (108230states) and FLOYD_HOARE automaton (currently 277 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (537958 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (108230states) and FLOYD_HOARE automaton (currently 277 states, 26 states before enhancement),while ReachableStatesComputation was computing reachable states (537958 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 74 locations, 83 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 690.0s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 2.0s, AutomataDifference: 533.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14191 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14191 mSDsluCounter, 7428 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6749 mSDsCounter, 737 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21623 IncrementalHoareTripleChecker+Invalid, 22360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 737 mSolverCounterUnsat, 679 mSDtfsCounter, 21623 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1433 GetRequests, 616 SyntacticMatches, 5 SemanticMatches, 812 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62767 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108230occurred in iteration=14, InterpolantAutomatonStates: 448, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 138.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 392975 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.5s InterpolantComputationTime, 951 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1284 ConstructedInterpolants, 4 QuantifiedInterpolants, 13720 SizeOfPredicates, 169 NumberOfNonLiveVariables, 2733 ConjunctsInSsa, 164 ConjunctsInUnsatCore, 33 InterpolantComputations, 7 PerfectInterpolantSequences, 101/198 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