/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:20:11,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:20:11,527 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 23:20:11,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:20:11,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:20:11,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:20:11,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:20:11,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:20:11,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:20:11,545 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:20:11,545 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:20:11,545 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:20:11,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:20:11,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:20:11,545 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:20:11,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:20:11,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:20:11,545 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:20:11,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:20:11,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:20:11,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:20:11,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:20:11,546 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:20:11,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:20:11,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:20:11,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:20:11,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:20:11,547 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:20:11,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:20:11,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:20:11,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:20:11,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:20:11,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:20:11,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:20:11,547 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:20:11,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:20:11,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:20:11,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:20:11,768 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:20:11,768 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:20:11,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2025-04-13 23:20:13,060 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8946695/fae969e6452e4e94aa0ee3ed89cdc6d2/FLAG52a49cb3c [2025-04-13 23:20:13,256 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:20:13,256 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2025-04-13 23:20:13,263 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8946695/fae969e6452e4e94aa0ee3ed89cdc6d2/FLAG52a49cb3c [2025-04-13 23:20:14,061 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd8946695/fae969e6452e4e94aa0ee3ed89cdc6d2 [2025-04-13 23:20:14,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:20:14,064 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:20:14,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:20:14,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:20:14,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:20:14,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c208cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14, skipping insertion in model container [2025-04-13 23:20:14,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:20:14,223 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2730,2743] [2025-04-13 23:20:14,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:20:14,234 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:20:14,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c[2730,2743] [2025-04-13 23:20:14,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:20:14,279 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:20:14,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14 WrapperNode [2025-04-13 23:20:14,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:20:14,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:20:14,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:20:14,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:20:14,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,289 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,309 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 129 [2025-04-13 23:20:14,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:20:14,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:20:14,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:20:14,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:20:14,316 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,342 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [2, 9]. 82 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-04-13 23:20:14,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:20:14,364 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:20:14,364 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:20:14,364 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:20:14,365 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (1/1) ... [2025-04-13 23:20:14,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:20:14,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:20:14,390 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 23:20:14,392 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 23:20:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:20:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:20:14,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:20:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:20:14,408 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:20:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 23:20:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 23:20:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:20:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:20:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:20:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:20:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:20:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:20:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 23:20:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:20:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:20:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:20:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:20:14,410 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:20:14,495 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:20:14,497 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:20:14,732 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:20:14,732 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:20:14,732 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:20:14,983 WARN L179 LargeBlockEncoding]: Complex 3:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:20:14,985 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:20:14,990 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:20:14,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:20:14 BoogieIcfgContainer [2025-04-13 23:20:14,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:20:14,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:20:14,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:20:14,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:20:14,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:20:14" (1/3) ... [2025-04-13 23:20:14,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7686b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:20:14, skipping insertion in model container [2025-04-13 23:20:14,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:20:14" (2/3) ... [2025-04-13 23:20:14,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7686b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:20:14, skipping insertion in model container [2025-04-13 23:20:14,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:20:14" (3/3) ... [2025-04-13 23:20:14,997 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2025-04-13 23:20:15,007 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:20:15,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 29 locations, 35 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 23:20:15,010 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:20:15,051 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 23:20:15,072 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 38 transitions, 97 flow [2025-04-13 23:20:15,106 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 211 states, 210 states have (on average 3.8904761904761904) internal successors, (817), 210 states have internal predecessors, (817), 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 23:20:15,127 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:20:15,133 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;@484cbdf8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:20:15,133 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:20:15,135 INFO L278 IsEmpty]: Start isEmpty. Operand has 211 states, 210 states have (on average 3.8904761904761904) internal successors, (817), 210 states have internal predecessors, (817), 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 23:20:15,145 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-04-13 23:20:15,145 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:15,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:20:15,146 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:15,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1541069215, now seen corresponding path program 1 times [2025-04-13 23:20:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:15,157 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165389992] [2025-04-13 23:20:15,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:20:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:15,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 23:20:15,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 23:20:15,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:15,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:15,704 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 23:20:15,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:15,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165389992] [2025-04-13 23:20:15,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165389992] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:20:15,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:20:15,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:20:15,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675258150] [2025-04-13 23:20:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:20:15,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:20:15,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:15,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:20:15,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:20:15,726 INFO L87 Difference]: Start difference. First operand has 211 states, 210 states have (on average 3.8904761904761904) internal successors, (817), 210 states have internal predecessors, (817), 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 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 23:20:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:15,863 INFO L93 Difference]: Finished difference Result 370 states and 1424 transitions. [2025-04-13 23:20:15,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:20:15,866 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 18 [2025-04-13 23:20:15,866 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:15,875 INFO L225 Difference]: With dead ends: 370 [2025-04-13 23:20:15,875 INFO L226 Difference]: Without dead ends: 355 [2025-04-13 23:20:15,880 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 23:20:15,882 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:15,882 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:20:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-04-13 23:20:15,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 326. [2025-04-13 23:20:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 3.873846153846154) internal successors, (1259), 325 states have internal predecessors, (1259), 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 23:20:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 1259 transitions. [2025-04-13 23:20:15,945 INFO L79 Accepts]: Start accepts. Automaton has 326 states and 1259 transitions. Word has length 18 [2025-04-13 23:20:15,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:15,946 INFO L485 AbstractCegarLoop]: Abstraction has 326 states and 1259 transitions. [2025-04-13 23:20:15,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 23:20:15,946 INFO L278 IsEmpty]: Start isEmpty. Operand 326 states and 1259 transitions. [2025-04-13 23:20:15,951 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 23:20:15,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:15,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:20:15,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:20:15,951 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:15,952 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:15,952 INFO L85 PathProgramCache]: Analyzing trace with hash 40396976, now seen corresponding path program 1 times [2025-04-13 23:20:15,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:15,952 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468593231] [2025-04-13 23:20:15,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:20:15,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:15,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:20:15,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:20:15,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:15,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:20:16,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:16,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468593231] [2025-04-13 23:20:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468593231] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:20:16,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426904551] [2025-04-13 23:20:16,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:20:16,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:16,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:20:16,035 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 23:20:16,036 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 23:20:16,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:20:16,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:20:16,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:16,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:16,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 23:20:16,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:20:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:20:16,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:20:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:20:16,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426904551] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:20:16,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:20:16,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-13 23:20:16,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835782148] [2025-04-13 23:20:16,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:20:16,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:20:16,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:16,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:20:16,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:20:16,179 INFO L87 Difference]: Start difference. First operand 326 states and 1259 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 23:20:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:16,361 INFO L93 Difference]: Finished difference Result 553 states and 2041 transitions. [2025-04-13 23:20:16,361 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:20:16,362 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 19 [2025-04-13 23:20:16,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:16,365 INFO L225 Difference]: With dead ends: 553 [2025-04-13 23:20:16,365 INFO L226 Difference]: Without dead ends: 388 [2025-04-13 23:20:16,365 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:20:16,366 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 74 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:16,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 4 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:20:16,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-04-13 23:20:16,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 330. [2025-04-13 23:20:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 329 states have (on average 3.4893617021276597) internal successors, (1148), 329 states have internal predecessors, (1148), 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 23:20:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 1148 transitions. [2025-04-13 23:20:16,389 INFO L79 Accepts]: Start accepts. Automaton has 330 states and 1148 transitions. Word has length 19 [2025-04-13 23:20:16,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:16,389 INFO L485 AbstractCegarLoop]: Abstraction has 330 states and 1148 transitions. [2025-04-13 23:20:16,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 23:20:16,389 INFO L278 IsEmpty]: Start isEmpty. Operand 330 states and 1148 transitions. [2025-04-13 23:20:16,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 23:20:16,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:16,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:20:16,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 23:20:16,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:16,591 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:16,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:16,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1991042936, now seen corresponding path program 2 times [2025-04-13 23:20:16,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:16,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997948348] [2025-04-13 23:20:16,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:20:16,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:16,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-13 23:20:16,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:20:16,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:20:16,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:16,659 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 23:20:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:16,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997948348] [2025-04-13 23:20:16,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997948348] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:20:16,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:20:16,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:20:16,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398761452] [2025-04-13 23:20:16,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:20:16,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:20:16,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:16,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:20:16,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:20:16,661 INFO L87 Difference]: Start difference. First operand 330 states and 1148 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 23:20:16,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:16,765 INFO L93 Difference]: Finished difference Result 409 states and 1361 transitions. [2025-04-13 23:20:16,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:20:16,766 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2025-04-13 23:20:16,766 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:16,768 INFO L225 Difference]: With dead ends: 409 [2025-04-13 23:20:16,768 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 23:20:16,769 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:20:16,769 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 17 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:16,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:20:16,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 23:20:16,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2025-04-13 23:20:16,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 3.4561933534743203) internal successors, (1144), 331 states have internal predecessors, (1144), 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 23:20:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 1144 transitions. [2025-04-13 23:20:16,795 INFO L79 Accepts]: Start accepts. Automaton has 332 states and 1144 transitions. Word has length 19 [2025-04-13 23:20:16,795 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:16,795 INFO L485 AbstractCegarLoop]: Abstraction has 332 states and 1144 transitions. [2025-04-13 23:20:16,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 23:20:16,795 INFO L278 IsEmpty]: Start isEmpty. Operand 332 states and 1144 transitions. [2025-04-13 23:20:16,796 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 23:20:16,796 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:16,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] [2025-04-13 23:20:16,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:20:16,797 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:16,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1801786604, now seen corresponding path program 3 times [2025-04-13 23:20:16,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:16,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369775111] [2025-04-13 23:20:16,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:20:16,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:16,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-04-13 23:20:16,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:20:16,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:20:16,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:16,849 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 23:20:16,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:16,849 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369775111] [2025-04-13 23:20:16,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369775111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:20:16,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:20:16,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:20:16,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298253911] [2025-04-13 23:20:16,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:20:16,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:20:16,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:16,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:20:16,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:20:16,850 INFO L87 Difference]: Start difference. First operand 332 states and 1144 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 23:20:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:16,939 INFO L93 Difference]: Finished difference Result 437 states and 1411 transitions. [2025-04-13 23:20:16,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:20:16,940 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2025-04-13 23:20:16,940 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:16,942 INFO L225 Difference]: With dead ends: 437 [2025-04-13 23:20:16,943 INFO L226 Difference]: Without dead ends: 318 [2025-04-13 23:20:16,944 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:20:16,944 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 7 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:16,944 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:20:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-04-13 23:20:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-04-13 23:20:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 3.441640378548896) internal successors, (1091), 317 states have internal predecessors, (1091), 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 23:20:16,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 1091 transitions. [2025-04-13 23:20:16,968 INFO L79 Accepts]: Start accepts. Automaton has 318 states and 1091 transitions. Word has length 19 [2025-04-13 23:20:16,968 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:16,968 INFO L485 AbstractCegarLoop]: Abstraction has 318 states and 1091 transitions. [2025-04-13 23:20:16,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 23:20:16,968 INFO L278 IsEmpty]: Start isEmpty. Operand 318 states and 1091 transitions. [2025-04-13 23:20:16,969 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:20:16,969 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:16,970 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] [2025-04-13 23:20:16,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:20:16,970 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:16,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:16,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1671794929, now seen corresponding path program 1 times [2025-04-13 23:20:16,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:16,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509865622] [2025-04-13 23:20:16,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:20:16,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:16,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 23:20:16,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:20:16,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:16,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:17,006 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 23:20:17,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:17,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509865622] [2025-04-13 23:20:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509865622] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:20:17,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:20:17,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:20:17,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196691592] [2025-04-13 23:20:17,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:20:17,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:20:17,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:17,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:20:17,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:20:17,008 INFO L87 Difference]: Start difference. First operand 318 states and 1091 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23:20:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:17,079 INFO L93 Difference]: Finished difference Result 357 states and 1182 transitions. [2025-04-13 23:20:17,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:20:17,079 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-04-13 23:20:17,079 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:17,082 INFO L225 Difference]: With dead ends: 357 [2025-04-13 23:20:17,082 INFO L226 Difference]: Without dead ends: 318 [2025-04-13 23:20:17,083 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 23:20:17,084 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:17,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:20:17,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-04-13 23:20:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 269. [2025-04-13 23:20:17,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 268 states have (on average 3.4365671641791047) internal successors, (921), 268 states have internal predecessors, (921), 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 23:20:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 921 transitions. [2025-04-13 23:20:17,112 INFO L79 Accepts]: Start accepts. Automaton has 269 states and 921 transitions. Word has length 23 [2025-04-13 23:20:17,112 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:17,112 INFO L485 AbstractCegarLoop]: Abstraction has 269 states and 921 transitions. [2025-04-13 23:20:17,112 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23:20:17,112 INFO L278 IsEmpty]: Start isEmpty. Operand 269 states and 921 transitions. [2025-04-13 23:20:17,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:20:17,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:17,113 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] [2025-04-13 23:20:17,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 23:20:17,113 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:17,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:17,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1747592312, now seen corresponding path program 1 times [2025-04-13 23:20:17,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:17,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461878981] [2025-04-13 23:20:17,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:20:17,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:17,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:20:17,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:20:17,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:17,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:17,214 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 23:20:17,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:17,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461878981] [2025-04-13 23:20:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461878981] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:20:17,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:20:17,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:20:17,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181840052] [2025-04-13 23:20:17,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:20:17,215 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:20:17,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:17,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:20:17,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:20:17,215 INFO L87 Difference]: Start difference. First operand 269 states and 921 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 23:20:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:17,318 INFO L93 Difference]: Finished difference Result 541 states and 1849 transitions. [2025-04-13 23:20:17,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:20:17,318 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2025-04-13 23:20:17,318 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:17,321 INFO L225 Difference]: With dead ends: 541 [2025-04-13 23:20:17,321 INFO L226 Difference]: Without dead ends: 272 [2025-04-13 23:20:17,322 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 23:20:17,323 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:17,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:20:17,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-13 23:20:17,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-04-13 23:20:17,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.4095940959409594) internal successors, (924), 271 states have internal predecessors, (924), 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 23:20:17,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 924 transitions. [2025-04-13 23:20:17,346 INFO L79 Accepts]: Start accepts. Automaton has 272 states and 924 transitions. Word has length 24 [2025-04-13 23:20:17,346 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:17,346 INFO L485 AbstractCegarLoop]: Abstraction has 272 states and 924 transitions. [2025-04-13 23:20:17,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 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 23:20:17,346 INFO L278 IsEmpty]: Start isEmpty. Operand 272 states and 924 transitions. [2025-04-13 23:20:17,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 23:20:17,347 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:17,348 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] [2025-04-13 23:20:17,348 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:20:17,348 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:17,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:17,348 INFO L85 PathProgramCache]: Analyzing trace with hash -40164905, now seen corresponding path program 1 times [2025-04-13 23:20:17,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:17,349 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629181511] [2025-04-13 23:20:17,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:20:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:17,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:20:17,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:20:17,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:17,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:20:17,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:17,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629181511] [2025-04-13 23:20:17,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629181511] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:20:17,455 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531486249] [2025-04-13 23:20:17,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:20:17,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:20:17,458 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 23:20:17,459 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 23:20:17,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 23:20:17,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:20:17,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:17,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:17,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:20:17,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:20:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:20:17,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:20:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:20:17,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531486249] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:20:17,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:20:17,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-04-13 23:20:17,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948850704] [2025-04-13 23:20:17,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:20:17,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:20:17,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:17,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:20:17,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:20:17,614 INFO L87 Difference]: Start difference. First operand 272 states and 924 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 23:20:17,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:17,697 INFO L93 Difference]: Finished difference Result 362 states and 1161 transitions. [2025-04-13 23:20:17,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:20:17,698 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2025-04-13 23:20:17,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:17,700 INFO L225 Difference]: With dead ends: 362 [2025-04-13 23:20:17,700 INFO L226 Difference]: Without dead ends: 272 [2025-04-13 23:20:17,701 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:20:17,701 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 62 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:17,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:20:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-13 23:20:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2025-04-13 23:20:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 3.3874538745387452) internal successors, (918), 271 states have internal predecessors, (918), 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 23:20:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 918 transitions. [2025-04-13 23:20:17,734 INFO L79 Accepts]: Start accepts. Automaton has 272 states and 918 transitions. Word has length 27 [2025-04-13 23:20:17,734 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:17,734 INFO L485 AbstractCegarLoop]: Abstraction has 272 states and 918 transitions. [2025-04-13 23:20:17,734 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 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 23:20:17,734 INFO L278 IsEmpty]: Start isEmpty. Operand 272 states and 918 transitions. [2025-04-13 23:20:17,735 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:20:17,735 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:17,735 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 23:20:17,741 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 23:20:17,935 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-13 23:20:17,936 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:17,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:17,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1665740066, now seen corresponding path program 1 times [2025-04-13 23:20:17,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:17,936 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421339106] [2025-04-13 23:20:17,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:20:17,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:17,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:20:17,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:20:17,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:17,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:18,787 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 23:20:18,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:18,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421339106] [2025-04-13 23:20:18,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421339106] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:20:18,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58218875] [2025-04-13 23:20:18,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:20:18,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:18,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:20:18,790 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 23:20:18,791 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 23:20:18,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:20:18,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:20:18,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:20:18,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:18,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:20:18,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:20:19,062 INFO L325 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-04-13 23:20:19,063 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2025-04-13 23:20:19,915 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:20:19,915 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 107 treesize of output 499 [2025-04-13 23:20:24,066 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 23:20:24,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:20:52,729 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:20:52,730 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2025-04-13 23:20:54,383 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 23:20:54,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58218875] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:20:54,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:20:54,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 25 [2025-04-13 23:20:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079783677] [2025-04-13 23:20:54,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:20:54,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 23:20:54,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:20:54,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 23:20:54,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=595, Unknown=4, NotChecked=0, Total=702 [2025-04-13 23:20:54,386 INFO L87 Difference]: Start difference. First operand 272 states and 918 transitions. Second operand has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:55,354 INFO L93 Difference]: Finished difference Result 654 states and 2266 transitions. [2025-04-13 23:20:55,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:20:55,354 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:20:55,354 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:55,359 INFO L225 Difference]: With dead ends: 654 [2025-04-13 23:20:55,359 INFO L226 Difference]: Without dead ends: 642 [2025-04-13 23:20:55,360 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 29.3s TimeCoverageRelationStatistics Valid=210, Invalid=1268, Unknown=4, NotChecked=0, Total=1482 [2025-04-13 23:20:55,361 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 265 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:55,361 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 41 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:20:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-04-13 23:20:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 386. [2025-04-13 23:20:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 3.394805194805195) internal successors, (1307), 385 states have internal predecessors, (1307), 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 23:20:55,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 1307 transitions. [2025-04-13 23:20:55,415 INFO L79 Accepts]: Start accepts. Automaton has 386 states and 1307 transitions. Word has length 28 [2025-04-13 23:20:55,415 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:55,415 INFO L485 AbstractCegarLoop]: Abstraction has 386 states and 1307 transitions. [2025-04-13 23:20:55,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:20:55,416 INFO L278 IsEmpty]: Start isEmpty. Operand 386 states and 1307 transitions. [2025-04-13 23:20:55,418 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:20:55,418 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:55,418 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 23:20:55,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 23:20:55,618 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:55,619 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:20:55,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1524632538, now seen corresponding path program 2 times [2025-04-13 23:20:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:55,619 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501683065] [2025-04-13 23:20:55,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:20:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:55,629 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:20:55,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:20:55,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:20:55,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:56,295 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 23:20:56,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:56,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501683065] [2025-04-13 23:20:56,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501683065] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:20:56,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082784455] [2025-04-13 23:20:56,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:20:56,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:56,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:20:56,298 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 23:20:56,299 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 23:20:56,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:20:56,394 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:20:56,394 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:20:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:56,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:20:56,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:20:56,641 INFO L325 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-04-13 23:20:56,642 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 54 [2025-04-13 23:20:57,109 INFO L325 Elim1Store]: treesize reduction 72, result has 71.1 percent of original size [2025-04-13 23:20:57,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 120 treesize of output 244 [2025-04-13 23:20:57,629 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 23:20:57,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:21:02,536 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~C~0.base Int)) (= (mod (+ c_~asum~0 c_~bsum~0) 4294967296) (mod (+ (select (let ((.cse0 (* c_thread2Thread1of1ForFork2_~i~1 4))) (store (select |c_#memory_int#1| ~C~0.base) (+ ~C~0.offset .cse0) (+ (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int#1| c_~B~0.base) (+ c_~B~0.offset .cse0))))) (+ ~C~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))) c_~csum~0) 4294967296))) is different from false [2025-04-13 23:21:08,260 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:21:08,260 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2025-04-13 23:21:23,549 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 23:21:23,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082784455] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:21:23,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:21:23,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 25 [2025-04-13 23:21:23,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940537365] [2025-04-13 23:21:23,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:21:23,549 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 23:21:23,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:21:23,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 23:21:23,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=550, Unknown=2, NotChecked=48, Total=702 [2025-04-13 23:21:23,550 INFO L87 Difference]: Start difference. First operand 386 states and 1307 transitions. Second operand has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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 23:21:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:21:37,932 INFO L93 Difference]: Finished difference Result 685 states and 2381 transitions. [2025-04-13 23:21:37,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 23:21:37,933 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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 23:21:37,933 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:21:37,940 INFO L225 Difference]: With dead ends: 685 [2025-04-13 23:21:37,940 INFO L226 Difference]: Without dead ends: 673 [2025-04-13 23:21:37,941 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=168, Invalid=956, Unknown=2, NotChecked=64, Total=1190 [2025-04-13 23:21:37,942 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 161 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:21:37,942 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 67 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1161 Invalid, 0 Unknown, 133 Unchecked, 11.9s Time] [2025-04-13 23:21:37,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-04-13 23:21:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 401. [2025-04-13 23:21:37,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 400 states have (on average 3.4075) internal successors, (1363), 400 states have internal predecessors, (1363), 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 23:21:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 1363 transitions. [2025-04-13 23:21:37,976 INFO L79 Accepts]: Start accepts. Automaton has 401 states and 1363 transitions. Word has length 28 [2025-04-13 23:21:37,976 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:21:37,976 INFO L485 AbstractCegarLoop]: Abstraction has 401 states and 1363 transitions. [2025-04-13 23:21:37,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.1153846153846154) internal successors, (81), 26 states have internal predecessors, (81), 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 23:21:37,976 INFO L278 IsEmpty]: Start isEmpty. Operand 401 states and 1363 transitions. [2025-04-13 23:21:37,977 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:21:37,977 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:21:37,977 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 23:21:37,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 23:21:38,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:21:38,178 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:21:38,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:21:38,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1035941636, now seen corresponding path program 3 times [2025-04-13 23:21:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:21:38,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197414542] [2025-04-13 23:21:38,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:21:38,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:21:38,185 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:21:38,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 23:21:38,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:21:38,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:21:38,596 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 23:21:38,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:21:38,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197414542] [2025-04-13 23:21:38,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197414542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:21:38,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:21:38,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:21:38,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505055808] [2025-04-13 23:21:38,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:21:38,597 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:21:38,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:21:38,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:21:38,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:21:38,597 INFO L87 Difference]: Start difference. First operand 401 states and 1363 transitions. 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 23:21:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:21:40,109 INFO L93 Difference]: Finished difference Result 672 states and 2369 transitions. [2025-04-13 23:21:40,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:21:40,110 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 23:21:40,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:21:40,113 INFO L225 Difference]: With dead ends: 672 [2025-04-13 23:21:40,113 INFO L226 Difference]: Without dead ends: 448 [2025-04-13 23:21:40,114 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:21:40,114 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 26 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:21:40,114 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:21:40,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-04-13 23:21:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2025-04-13 23:21:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 3.364653243847875) internal successors, (1504), 447 states have internal predecessors, (1504), 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 23:21:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1504 transitions. [2025-04-13 23:21:40,146 INFO L79 Accepts]: Start accepts. Automaton has 448 states and 1504 transitions. Word has length 28 [2025-04-13 23:21:40,146 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:21:40,147 INFO L485 AbstractCegarLoop]: Abstraction has 448 states and 1504 transitions. [2025-04-13 23:21:40,147 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 23:21:40,147 INFO L278 IsEmpty]: Start isEmpty. Operand 448 states and 1504 transitions. [2025-04-13 23:21:40,148 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:21:40,148 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:21:40,148 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 23:21:40,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 23:21:40,148 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:21:40,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:21:40,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2106023572, now seen corresponding path program 4 times [2025-04-13 23:21:40,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:21:40,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42104990] [2025-04-13 23:21:40,149 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:21:40,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:21:40,154 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:21:40,170 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:21:40,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:21:40,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:21:41,407 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 23:21:41,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:21:41,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42104990] [2025-04-13 23:21:41,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42104990] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:21:41,407 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475489841] [2025-04-13 23:21:41,407 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:21:41,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:21:41,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:21:41,409 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 23:21:41,410 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 23:21:41,454 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:21:41,476 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:21:41,476 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:21:41,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:21:41,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:21:41,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:21:45,879 INFO L325 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-04-13 23:21:45,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 54 [2025-04-13 23:21:50,160 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:21:50,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 250 [2025-04-13 23:21:53,436 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 23:21:53,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:21:58,405 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~C~0.base Int)) (= (mod (+ c_~asum~0 c_~bsum~0) 4294967296) (mod (+ (select (let ((.cse0 (* c_thread2Thread1of1ForFork2_~i~1 4))) (store (select |c_#memory_int#1| ~C~0.base) (+ ~C~0.offset .cse0) (+ (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int#1| c_~B~0.base) (+ c_~B~0.offset .cse0))))) (+ ~C~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))) c_~csum~0) 4294967296))) is different from false [2025-04-13 23:22:27,857 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:22:27,858 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 83 [2025-04-13 23:22:32,886 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 23:22:32,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475489841] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:22:32,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:22:32,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 21 [2025-04-13 23:22:32,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157462592] [2025-04-13 23:22:32,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:22:32,886 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:22:32,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:22:32,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:22:32,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=4, NotChecked=40, Total=506 [2025-04-13 23:22:32,887 INFO L87 Difference]: Start difference. First operand 448 states and 1504 transitions. Second operand has 23 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 22 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:22:42,455 INFO L93 Difference]: Finished difference Result 829 states and 2844 transitions. [2025-04-13 23:22:42,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:22:42,455 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 22 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:22:42,456 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:22:42,460 INFO L225 Difference]: With dead ends: 829 [2025-04-13 23:22:42,460 INFO L226 Difference]: Without dead ends: 817 [2025-04-13 23:22:42,460 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 36.9s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=4, NotChecked=42, Total=552 [2025-04-13 23:22:42,461 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 129 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:22:42,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 42 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 851 Invalid, 0 Unknown, 124 Unchecked, 9.1s Time] [2025-04-13 23:22:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-04-13 23:22:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 458. [2025-04-13 23:22:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 3.3654266958424506) internal successors, (1538), 457 states have internal predecessors, (1538), 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 23:22:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1538 transitions. [2025-04-13 23:22:42,498 INFO L79 Accepts]: Start accepts. Automaton has 458 states and 1538 transitions. Word has length 28 [2025-04-13 23:22:42,498 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:22:42,498 INFO L485 AbstractCegarLoop]: Abstraction has 458 states and 1538 transitions. [2025-04-13 23:22:42,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 22 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:22:42,498 INFO L278 IsEmpty]: Start isEmpty. Operand 458 states and 1538 transitions. [2025-04-13 23:22:42,499 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:22:42,499 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:22:42,499 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 23:22:42,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 23:22:42,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 23:22:42,700 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:22:42,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:22:42,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1453437052, now seen corresponding path program 5 times [2025-04-13 23:22:42,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:22:42,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982193045] [2025-04-13 23:22:42,701 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:22:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:22:42,707 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:22:42,726 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:22:42,726 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:22:42,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:46,195 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 23:22:46,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:22:46,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982193045] [2025-04-13 23:22:46,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982193045] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:22:46,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835905421] [2025-04-13 23:22:46,195 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:22:46,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:22:46,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:22:46,197 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 23:22:46,199 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 23:22:46,241 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:22:46,261 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:22:46,261 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:22:46,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:22:46,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:22:46,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:22:49,364 INFO L325 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2025-04-13 23:22:49,364 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2025-04-13 23:22:56,483 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:22:56,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 137 treesize of output 509 [2025-04-13 23:23:08,614 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 23:23:08,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:23:47,890 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:23:47,890 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 73 [2025-04-13 23:23:47,939 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 75 treesize of output 73 [2025-04-13 23:23:48,191 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:23:48,191 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 30 treesize of output 31 [2025-04-13 23:23:48,279 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:23:48,280 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 22 treesize of output 23 [2025-04-13 23:23:52,668 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 23:23:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835905421] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:23:52,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:23:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 6] total 25 [2025-04-13 23:23:52,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010200263] [2025-04-13 23:23:52,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:23:52,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 23:23:52,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:23:52,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 23:23:52,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=582, Unknown=2, NotChecked=0, Total=702 [2025-04-13 23:23:52,670 INFO L87 Difference]: Start difference. First operand 458 states and 1538 transitions. Second operand has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:11,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:24:11,729 INFO L93 Difference]: Finished difference Result 784 states and 2727 transitions. [2025-04-13 23:24:11,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:24:11,730 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:24:11,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:24:11,734 INFO L225 Difference]: With dead ends: 784 [2025-04-13 23:24:11,734 INFO L226 Difference]: Without dead ends: 772 [2025-04-13 23:24:11,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 51.5s TimeCoverageRelationStatistics Valid=216, Invalid=1113, Unknown=3, NotChecked=0, Total=1332 [2025-04-13 23:24:11,735 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 206 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:24:11,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 48 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2025-04-13 23:24:11,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2025-04-13 23:24:11,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 471. [2025-04-13 23:24:11,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 470 states have (on average 3.3617021276595747) internal successors, (1580), 470 states have internal predecessors, (1580), 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 23:24:11,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1580 transitions. [2025-04-13 23:24:11,781 INFO L79 Accepts]: Start accepts. Automaton has 471 states and 1580 transitions. Word has length 28 [2025-04-13 23:24:11,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:24:11,781 INFO L485 AbstractCegarLoop]: Abstraction has 471 states and 1580 transitions. [2025-04-13 23:24:11,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:24:11,781 INFO L278 IsEmpty]: Start isEmpty. Operand 471 states and 1580 transitions. [2025-04-13 23:24:11,782 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:24:11,783 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:24:11,783 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 23:24:11,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 23:24:11,983 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:24:11,983 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 1 more)] === [2025-04-13 23:24:11,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:24:11,984 INFO L85 PathProgramCache]: Analyzing trace with hash -348842360, now seen corresponding path program 6 times [2025-04-13 23:24:11,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:24:11,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701111564] [2025-04-13 23:24:11,984 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:24:11,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:24:11,989 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:24:12,004 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:24:12,004 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:24:12,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:16,067 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 23:24:16,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:24:16,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701111564] [2025-04-13 23:24:16,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701111564] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:24:16,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121398231] [2025-04-13 23:24:16,067 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:24:16,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:24:16,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:24:16,069 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 23:24:16,070 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 23:24:16,113 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 2 equivalence classes. [2025-04-13 23:24:16,136 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:24:16,136 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:24:16,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:24:16,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:24:16,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:24:21,362 INFO L325 Elim1Store]: treesize reduction 36, result has 52.0 percent of original size [2025-04-13 23:24:21,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 54 [2025-04-13 23:24:25,750 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:24:25,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 90 treesize of output 250 [2025-04-13 23:24:31,239 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 23:24:31,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:24:36,306 WARN L849 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (~C~0.base Int)) (= (mod (+ c_~asum~0 c_~bsum~0) 4294967296) (mod (+ (select (let ((.cse0 (* c_thread2Thread1of1ForFork2_~i~1 4))) (store (select |c_#memory_int#1| ~C~0.base) (+ ~C~0.offset .cse0) (+ (select (select |c_#memory_int#1| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int#1| c_~B~0.base) (+ c_~B~0.offset .cse0))))) (+ ~C~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))) c_~csum~0) 4294967296))) is different from false [2025-04-13 23:25:13,829 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:13,829 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 73 [2025-04-13 23:25:13,876 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 75 treesize of output 73 [2025-04-13 23:25:14,055 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:14,055 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 30 treesize of output 31 [2025-04-13 23:25:14,144 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:14,144 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 73 treesize of output 61 [2025-04-13 23:25:19,188 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 23:25:19,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121398231] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:25:19,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:25:19,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 6] total 27 [2025-04-13 23:25:19,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641173453] [2025-04-13 23:25:19,189 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:25:19,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 23:25:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:25:19,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 23:25:19,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=629, Unknown=6, NotChecked=52, Total=812 [2025-04-13 23:25:19,191 INFO L87 Difference]: Start difference. First operand 471 states and 1580 transitions. Second operand has 29 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:25:40,059 INFO L93 Difference]: Finished difference Result 708 states and 2463 transitions. [2025-04-13 23:25:40,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:25:40,059 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 23:25:40,060 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:25:40,069 INFO L225 Difference]: With dead ends: 708 [2025-04-13 23:25:40,069 INFO L226 Difference]: Without dead ends: 696 [2025-04-13 23:25:40,072 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=247, Invalid=1310, Unknown=7, NotChecked=76, Total=1640 [2025-04-13 23:25:40,073 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 182 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:25:40,073 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 42 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 973 Invalid, 0 Unknown, 152 Unchecked, 10.0s Time] [2025-04-13 23:25:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-04-13 23:25:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 466. [2025-04-13 23:25:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 3.3655913978494625) internal successors, (1565), 465 states have internal predecessors, (1565), 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 23:25:40,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 1565 transitions. [2025-04-13 23:25:40,161 INFO L79 Accepts]: Start accepts. Automaton has 466 states and 1565 transitions. Word has length 28 [2025-04-13 23:25:40,162 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:25:40,162 INFO L485 AbstractCegarLoop]: Abstraction has 466 states and 1565 transitions. [2025-04-13 23:25:40,162 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.0) internal successors, (84), 28 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:25:40,162 INFO L278 IsEmpty]: Start isEmpty. Operand 466 states and 1565 transitions. [2025-04-13 23:25:40,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:25:40,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:25:40,164 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 23:25:40,173 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 23:25:40,365 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 23:25:40,366 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 1 more)] === [2025-04-13 23:25:40,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:25:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1785949022, now seen corresponding path program 7 times [2025-04-13 23:25:40,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:25:40,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482529450] [2025-04-13 23:25:40,367 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:25:40,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:25:40,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:25:40,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:25:40,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:40,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:45,572 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 23:25:45,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:25:45,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482529450] [2025-04-13 23:25:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482529450] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:25:45,573 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686555297] [2025-04-13 23:25:45,573 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:25:45,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:45,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:25:45,575 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 23:25:45,577 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 23:25:45,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:25:45,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:25:45,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:25:45,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:25:45,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 23:25:45,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:25:45,822 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 23:25:46,381 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-13 23:25:46,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-13 23:25:47,040 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-13 23:25:47,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-04-13 23:25:49,735 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 23:25:49,735 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-04-13 23:25:52,297 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:52,297 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2025-04-13 23:25:52,576 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 23:25:52,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:25:54,484 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:25:54,484 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 356 treesize of output 336 [2025-04-13 23:26:02,179 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:26:02,180 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 211 treesize of output 165 Received shutdown request... [2025-04-13 23:34:30,732 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 23:34:30,766 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:34:30,861 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 23:34:30,870 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 23:34:31,064 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 23:34:31,065 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-10-2-1 context. [2025-04-13 23:34:31,067 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 23:34:31,069 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 23:34:31,069 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 23:34:31,076 INFO L422 BasicCegarLoop]: Path program histogram: [7, 3, 1, 1, 1, 1] [2025-04-13 23:34:31,081 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:34:31,081 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:34:31,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:34:31 BasicIcfg [2025-04-13 23:34:31,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:34:31,090 INFO L158 Benchmark]: Toolchain (without parser) took 857020.33ms. Allocated memory was 125.8MB in the beginning and 155.2MB in the end (delta: 29.4MB). Free memory was 90.4MB in the beginning and 71.5MB in the end (delta: 18.9MB). Peak memory consumption was 103.5MB. Max. memory is 8.0GB. [2025-04-13 23:34:31,090 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:34:31,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.24ms. Allocated memory is still 125.8MB. Free memory was 90.4MB in the beginning and 75.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 23:34:31,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.36ms. Allocated memory is still 125.8MB. Free memory was 75.1MB in the beginning and 73.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:34:31,091 INFO L158 Benchmark]: Boogie Preprocessor took 50.13ms. Allocated memory is still 125.8MB. Free memory was 73.1MB in the beginning and 71.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:34:31,092 INFO L158 Benchmark]: IcfgBuilder took 626.99ms. Allocated memory is still 125.8MB. Free memory was 71.0MB in the beginning and 72.6MB in the end (delta: -1.6MB). Peak memory consumption was 57.0MB. Max. memory is 8.0GB. [2025-04-13 23:34:31,092 INFO L158 Benchmark]: TraceAbstraction took 856092.27ms. Allocated memory was 125.8MB in the beginning and 155.2MB in the end (delta: 29.4MB). Free memory was 71.9MB in the beginning and 71.5MB in the end (delta: 410.4kB). Peak memory consumption was 84.2MB. Max. memory is 8.0GB. [2025-04-13 23:34:31,094 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.15ms. Allocated memory is still 167.8MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.24ms. Allocated memory is still 125.8MB. Free memory was 90.4MB in the beginning and 75.1MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.36ms. Allocated memory is still 125.8MB. Free memory was 75.1MB in the beginning and 73.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 50.13ms. Allocated memory is still 125.8MB. Free memory was 73.1MB in the beginning and 71.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 626.99ms. Allocated memory is still 125.8MB. Free memory was 71.0MB in the beginning and 72.6MB in the end (delta: -1.6MB). Peak memory consumption was 57.0MB. Max. memory is 8.0GB. * TraceAbstraction took 856092.27ms. Allocated memory was 125.8MB in the beginning and 155.2MB in the end (delta: 29.4MB). Free memory was 71.9MB in the beginning and 71.5MB in the end (delta: 410.4kB). Peak memory consumption was 84.2MB. 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: 102]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-10-2-1 context. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-10-2-1 context. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-10-2-1 context. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-5-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-10-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 45 locations, 61 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 856.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 67.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1160 SdHoareTripleChecker+Valid, 44.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1160 mSDsluCounter, 261 SdHoareTripleChecker+Invalid, 43.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 409 IncrementalHoareTripleChecker+Unchecked, 228 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5680 IncrementalHoareTripleChecker+Invalid, 6150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 33 mSDtfsCounter, 5680 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 298 SyntacticMatches, 6 SemanticMatches, 192 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 189.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=12, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 1556 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 255.0s InterpolantComputationTime, 503 NumberOfCodeBlocks, 499 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 662 ConstructedInterpolants, 50 QuantifiedInterpolants, 10911 SizeOfPredicates, 77 NumberOfNonLiveVariables, 1789 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 27 InterpolantComputations, 7 PerfectInterpolantSequences, 58/79 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