/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-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:16:29,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:16:29,670 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:16:29,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:16:29,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:16:29,699 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:16:29,700 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:16:29,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:16:29,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:16:29,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:16:29,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:16:29,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:16:29,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:16:29,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:16:29,703 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:16:29,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:16:29,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:16:29,703 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:16:29,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:16:29,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:16:29,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:16:29,704 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:16:29,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:16:29,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:16:29,705 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:16:29,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:16:29,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:16:29,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:16:29,705 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:16:29,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:16:29,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:16:29,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:16:29,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:16:29,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:16:29,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:16:29,705 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:16:29,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:16:29,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:16:29,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:16:29,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:16:29,908 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:16:29,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2025-04-13 23:16:31,143 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a308b71b/c447dff9dd7b4304bb79b5773dbced5d/FLAGe4da4d138 [2025-04-13 23:16:31,341 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:16:31,342 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2025-04-13 23:16:31,348 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a308b71b/c447dff9dd7b4304bb79b5773dbced5d/FLAGe4da4d138 [2025-04-13 23:16:32,143 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a308b71b/c447dff9dd7b4304bb79b5773dbced5d [2025-04-13 23:16:32,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:16:32,146 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:16:32,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:16:32,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:16:32,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:16:32,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18b1f7f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32, skipping insertion in model container [2025-04-13 23:16:32,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,163 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:16:32,331 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-send-receive.wvr.c[3146,3159] [2025-04-13 23:16:32,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:16:32,343 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:16:32,368 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-send-receive.wvr.c[3146,3159] [2025-04-13 23:16:32,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:16:32,382 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:16:32,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32 WrapperNode [2025-04-13 23:16:32,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:16:32,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:16:32,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:16:32,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:16:32,386 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:16:32" (1/1) ... [2025-04-13 23:16:32,391 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:16:32" (1/1) ... [2025-04-13 23:16:32,409 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 139 [2025-04-13 23:16:32,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:16:32,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:16:32,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:16:32,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:16:32,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,430 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 23:16:32,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,437 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:16:32,449 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:16:32,449 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:16:32,449 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:16:32,450 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32" (1/1) ... [2025-04-13 23:16:32,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:16:32,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:32,473 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:16:32,475 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:16:32,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:16:32,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:16:32,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:16:32,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:16:32,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:16:32,491 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 23:16:32,491 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 23:16:32,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:16:32,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:16:32,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:16:32,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:16:32,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:16:32,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:16:32,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 23:16:32,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:16:32,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:16:32,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:16:32,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:16:32,493 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:16:32,581 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:16:32,582 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:16:32,755 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:16:32,756 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:16:32,756 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:16:32,933 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:16:32,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:16:32 BoogieIcfgContainer [2025-04-13 23:16:32,933 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:16:32,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:16:32,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:16:32,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:16:32,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:16:32" (1/3) ... [2025-04-13 23:16:32,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47132775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:16:32, skipping insertion in model container [2025-04-13 23:16:32,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:16:32" (2/3) ... [2025-04-13 23:16:32,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47132775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:16:32, skipping insertion in model container [2025-04-13 23:16:32,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:16:32" (3/3) ... [2025-04-13 23:16:32,941 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2025-04-13 23:16:32,950 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:16:32,951 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive.wvr.c that has 4 procedures, 32 locations, 32 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 23:16:32,951 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:16:32,987 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 23:16:33,004 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 91 flow [2025-04-13 23:16:33,072 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 533 states, 532 states have (on average 3.242481203007519) internal successors, (1725), 532 states have internal predecessors, (1725), 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:16:33,092 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:16:33,101 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;@2970c0ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:16:33,101 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:16:33,103 INFO L278 IsEmpty]: Start isEmpty. Operand has 533 states, 532 states have (on average 3.242481203007519) internal successors, (1725), 532 states have internal predecessors, (1725), 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:16:33,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:16:33,114 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:33,115 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] [2025-04-13 23:16:33,115 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:16:33,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:33,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1438049461, now seen corresponding path program 1 times [2025-04-13 23:16:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:33,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880989886] [2025-04-13 23:16:33,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:16:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:33,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:16:33,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:16:33,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:16:33,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:33,453 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:16:33,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:33,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880989886] [2025-04-13 23:16:33,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880989886] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:16:33,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:16:33,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:16:33,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294809306] [2025-04-13 23:16:33,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:16:33,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:16:33,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:33,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:16:33,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:16:33,474 INFO L87 Difference]: Start difference. First operand has 533 states, 532 states have (on average 3.242481203007519) internal successors, (1725), 532 states have internal predecessors, (1725), 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 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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:16:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:33,650 INFO L93 Difference]: Finished difference Result 693 states and 2218 transitions. [2025-04-13 23:16:33,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:16:33,652 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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 21 [2025-04-13 23:16:33,652 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:33,665 INFO L225 Difference]: With dead ends: 693 [2025-04-13 23:16:33,667 INFO L226 Difference]: Without dead ends: 623 [2025-04-13 23:16:33,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:16:33,672 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:33,673 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 19 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:16:33,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2025-04-13 23:16:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 519. [2025-04-13 23:16:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 3.277992277992278) internal successors, (1698), 518 states have internal predecessors, (1698), 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:16:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 1698 transitions. [2025-04-13 23:16:33,728 INFO L79 Accepts]: Start accepts. Automaton has 519 states and 1698 transitions. Word has length 21 [2025-04-13 23:16:33,729 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:33,729 INFO L485 AbstractCegarLoop]: Abstraction has 519 states and 1698 transitions. [2025-04-13 23:16:33,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 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:16:33,729 INFO L278 IsEmpty]: Start isEmpty. Operand 519 states and 1698 transitions. [2025-04-13 23:16:33,732 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:16:33,732 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:33,732 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] [2025-04-13 23:16:33,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:16:33,732 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:16:33,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:33,750 INFO L85 PathProgramCache]: Analyzing trace with hash 2141294039, now seen corresponding path program 2 times [2025-04-13 23:16:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:33,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935202029] [2025-04-13 23:16:33,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:16:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:33,757 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:16:33,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:16:33,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:16:33,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:33,987 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:16:33,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:33,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935202029] [2025-04-13 23:16:33,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935202029] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:16:33,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:16:33,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:16:33,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134739083] [2025-04-13 23:16:33,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:16:33,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:16:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:33,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:16:33,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 23:16:33,989 INFO L87 Difference]: Start difference. First operand 519 states and 1698 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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:16:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:34,176 INFO L93 Difference]: Finished difference Result 943 states and 3080 transitions. [2025-04-13 23:16:34,176 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:16:34,176 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 21 [2025-04-13 23:16:34,177 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:34,181 INFO L225 Difference]: With dead ends: 943 [2025-04-13 23:16:34,181 INFO L226 Difference]: Without dead ends: 535 [2025-04-13 23:16:34,182 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:16:34,182 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:34,183 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 22 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:16:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-04-13 23:16:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2025-04-13 23:16:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 3.202247191011236) internal successors, (1710), 534 states have internal predecessors, (1710), 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:16:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1710 transitions. [2025-04-13 23:16:34,231 INFO L79 Accepts]: Start accepts. Automaton has 535 states and 1710 transitions. Word has length 21 [2025-04-13 23:16:34,231 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:34,231 INFO L485 AbstractCegarLoop]: Abstraction has 535 states and 1710 transitions. [2025-04-13 23:16:34,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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:16:34,232 INFO L278 IsEmpty]: Start isEmpty. Operand 535 states and 1710 transitions. [2025-04-13 23:16:34,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:16:34,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:34,233 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:16:34,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:16:34,233 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:16:34,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:34,234 INFO L85 PathProgramCache]: Analyzing trace with hash -298914613, now seen corresponding path program 1 times [2025-04-13 23:16:34,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:34,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140185316] [2025-04-13 23:16:34,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:16:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:34,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 23:16:34,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:16:34,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:16:34,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:34,299 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:16:34,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:34,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140185316] [2025-04-13 23:16:34,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140185316] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:16:34,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:16:34,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:16:34,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677684149] [2025-04-13 23:16:34,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:16:34,300 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:16:34,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:34,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:16:34,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:16:34,300 INFO L87 Difference]: Start difference. First operand 535 states and 1710 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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:16:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:34,363 INFO L93 Difference]: Finished difference Result 867 states and 2818 transitions. [2025-04-13 23:16:34,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:16:34,363 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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:16:34,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:34,367 INFO L225 Difference]: With dead ends: 867 [2025-04-13 23:16:34,367 INFO L226 Difference]: Without dead ends: 511 [2025-04-13 23:16:34,368 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:16:34,369 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:34,369 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:16:34,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-04-13 23:16:34,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2025-04-13 23:16:34,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 510 states have (on average 3.184313725490196) internal successors, (1624), 510 states have internal predecessors, (1624), 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:16:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1624 transitions. [2025-04-13 23:16:34,397 INFO L79 Accepts]: Start accepts. Automaton has 511 states and 1624 transitions. Word has length 24 [2025-04-13 23:16:34,397 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:34,397 INFO L485 AbstractCegarLoop]: Abstraction has 511 states and 1624 transitions. [2025-04-13 23:16:34,397 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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:16:34,397 INFO L278 IsEmpty]: Start isEmpty. Operand 511 states and 1624 transitions. [2025-04-13 23:16:34,398 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 23:16:34,398 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:34,398 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:16:34,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:16:34,398 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:16:34,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:34,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1419788026, now seen corresponding path program 1 times [2025-04-13 23:16:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:34,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347293483] [2025-04-13 23:16:34,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:16:34,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:34,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 23:16:34,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 23:16:34,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:16:34,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:34,511 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:16:34,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:34,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347293483] [2025-04-13 23:16:34,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347293483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:16:34,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:16:34,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:16:34,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991034965] [2025-04-13 23:16:34,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:16:34,512 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:16:34,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:34,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:16:34,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:16:34,513 INFO L87 Difference]: Start difference. First operand 511 states and 1624 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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:16:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:34,614 INFO L93 Difference]: Finished difference Result 1021 states and 3247 transitions. [2025-04-13 23:16:34,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:16:34,614 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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:16:34,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:34,618 INFO L225 Difference]: With dead ends: 1021 [2025-04-13 23:16:34,618 INFO L226 Difference]: Without dead ends: 512 [2025-04-13 23:16:34,619 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:16:34,621 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:34,622 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:16:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-04-13 23:16:34,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2025-04-13 23:16:34,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 511 states have (on average 3.1800391389432487) internal successors, (1625), 511 states have internal predecessors, (1625), 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:16:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1625 transitions. [2025-04-13 23:16:34,661 INFO L79 Accepts]: Start accepts. Automaton has 512 states and 1625 transitions. Word has length 28 [2025-04-13 23:16:34,661 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:34,661 INFO L485 AbstractCegarLoop]: Abstraction has 512 states and 1625 transitions. [2025-04-13 23:16:34,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 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:16:34,661 INFO L278 IsEmpty]: Start isEmpty. Operand 512 states and 1625 transitions. [2025-04-13 23:16:34,663 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 23:16:34,663 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:34,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:34,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:16:34,664 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:16:34,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:34,664 INFO L85 PathProgramCache]: Analyzing trace with hash -138751439, now seen corresponding path program 1 times [2025-04-13 23:16:34,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:34,665 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771990010] [2025-04-13 23:16:34,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:16:34,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:34,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 23:16:34,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 23:16:34,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:16:34,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:16:34,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:34,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771990010] [2025-04-13 23:16:34,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771990010] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:34,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382591900] [2025-04-13 23:16:34,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:16:34,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:34,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:34,860 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:16:34,862 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:16:34,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 23:16:34,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 23:16:34,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:16:34,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:34,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:16:34,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:16:34,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:16:35,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382591900] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:35,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:35,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2025-04-13 23:16:35,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508147599] [2025-04-13 23:16:35,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:35,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:16:35,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:35,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:16:35,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:16:35,101 INFO L87 Difference]: Start difference. First operand 512 states and 1625 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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:16:35,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:35,512 INFO L93 Difference]: Finished difference Result 1188 states and 3922 transitions. [2025-04-13 23:16:35,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:16:35,513 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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 29 [2025-04-13 23:16:35,513 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:35,520 INFO L225 Difference]: With dead ends: 1188 [2025-04-13 23:16:35,520 INFO L226 Difference]: Without dead ends: 634 [2025-04-13 23:16:35,521 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=352, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:16:35,522 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 200 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:35,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 37 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:16:35,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-04-13 23:16:35,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 476. [2025-04-13 23:16:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 475 states have (on average 3.042105263157895) internal successors, (1445), 475 states have internal predecessors, (1445), 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:16:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1445 transitions. [2025-04-13 23:16:35,550 INFO L79 Accepts]: Start accepts. Automaton has 476 states and 1445 transitions. Word has length 29 [2025-04-13 23:16:35,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:35,550 INFO L485 AbstractCegarLoop]: Abstraction has 476 states and 1445 transitions. [2025-04-13 23:16:35,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 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:16:35,550 INFO L278 IsEmpty]: Start isEmpty. Operand 476 states and 1445 transitions. [2025-04-13 23:16:35,551 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 23:16:35,551 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:35,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:35,561 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:16:35,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:35,752 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:16:35,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:35,753 INFO L85 PathProgramCache]: Analyzing trace with hash -176130471, now seen corresponding path program 2 times [2025-04-13 23:16:35,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:35,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17482090] [2025-04-13 23:16:35,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:16:35,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:35,759 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 23:16:35,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 28 of 29 statements. [2025-04-13 23:16:35,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:16:35,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:35,988 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:16:35,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:35,988 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17482090] [2025-04-13 23:16:35,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17482090] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:16:35,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:16:35,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:16:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407655062] [2025-04-13 23:16:35,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:16:35,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:16:35,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:35,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:16:35,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:16:35,990 INFO L87 Difference]: Start difference. First operand 476 states and 1445 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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:16:36,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:36,231 INFO L93 Difference]: Finished difference Result 808 states and 2503 transitions. [2025-04-13 23:16:36,231 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:16:36,232 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2025-04-13 23:16:36,232 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:36,235 INFO L225 Difference]: With dead ends: 808 [2025-04-13 23:16:36,235 INFO L226 Difference]: Without dead ends: 566 [2025-04-13 23:16:36,235 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:16:36,237 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 138 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:36,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 32 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:16:36,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-04-13 23:16:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 566. [2025-04-13 23:16:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 565 states have (on average 3.067256637168142) internal successors, (1733), 565 states have internal predecessors, (1733), 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:16:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 1733 transitions. [2025-04-13 23:16:36,268 INFO L79 Accepts]: Start accepts. Automaton has 566 states and 1733 transitions. Word has length 29 [2025-04-13 23:16:36,268 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:36,268 INFO L485 AbstractCegarLoop]: Abstraction has 566 states and 1733 transitions. [2025-04-13 23:16:36,268 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 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:16:36,268 INFO L278 IsEmpty]: Start isEmpty. Operand 566 states and 1733 transitions. [2025-04-13 23:16:36,270 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 23:16:36,270 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:36,270 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:36,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 23:16:36,270 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:16:36,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:36,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1284463287, now seen corresponding path program 3 times [2025-04-13 23:16:36,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:36,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669529840] [2025-04-13 23:16:36,270 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:16:36,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:36,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-13 23:16:36,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 23:16:36,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:16:36,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:36,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:16:36,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:36,351 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669529840] [2025-04-13 23:16:36,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669529840] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:16:36,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:16:36,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:16:36,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144308900] [2025-04-13 23:16:36,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:16:36,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:16:36,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:36,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:16:36,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:16:36,352 INFO L87 Difference]: Start difference. First operand 566 states and 1733 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:36,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:36,475 INFO L93 Difference]: Finished difference Result 1610 states and 5027 transitions. [2025-04-13 23:16:36,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:16:36,475 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 23:16:36,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:36,483 INFO L225 Difference]: With dead ends: 1610 [2025-04-13 23:16:36,483 INFO L226 Difference]: Without dead ends: 1330 [2025-04-13 23:16:36,484 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:16:36,485 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:36,485 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 18 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:16:36,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-04-13 23:16:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1238. [2025-04-13 23:16:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 3.1309620048504447) internal successors, (3873), 1237 states have internal predecessors, (3873), 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:16:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 3873 transitions. [2025-04-13 23:16:36,574 INFO L79 Accepts]: Start accepts. Automaton has 1238 states and 3873 transitions. Word has length 32 [2025-04-13 23:16:36,574 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:36,574 INFO L485 AbstractCegarLoop]: Abstraction has 1238 states and 3873 transitions. [2025-04-13 23:16:36,574 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:36,575 INFO L278 IsEmpty]: Start isEmpty. Operand 1238 states and 3873 transitions. [2025-04-13 23:16:36,577 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 23:16:36,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:36,577 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:36,577 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 23:16:36,577 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:16:36,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:36,578 INFO L85 PathProgramCache]: Analyzing trace with hash -693144234, now seen corresponding path program 4 times [2025-04-13 23:16:36,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:36,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696172350] [2025-04-13 23:16:36,578 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:16:36,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:36,586 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 23:16:36,595 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:16:36,595 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:16:36,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:16:36,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:36,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696172350] [2025-04-13 23:16:36,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696172350] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:36,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682341782] [2025-04-13 23:16:36,687 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:16:36,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:36,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:36,689 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:16:36,691 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:16:36,734 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 36 statements into 2 equivalence classes. [2025-04-13 23:16:36,754 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 23:16:36,754 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:16:36,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:36,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:16:36,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:36,833 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:16:36,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:16:36,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682341782] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:36,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:36,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 23:16:36,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41553436] [2025-04-13 23:16:36,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:36,905 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:16:36,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:36,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:16:36,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:16:36,905 INFO L87 Difference]: Start difference. First operand 1238 states and 3873 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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:16:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:37,141 INFO L93 Difference]: Finished difference Result 2528 states and 7924 transitions. [2025-04-13 23:16:37,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:16:37,141 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 23:16:37,142 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:37,148 INFO L225 Difference]: With dead ends: 2528 [2025-04-13 23:16:37,149 INFO L226 Difference]: Without dead ends: 1239 [2025-04-13 23:16:37,150 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:16:37,151 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 39 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:37,151 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 38 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:16:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2025-04-13 23:16:37,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1239. [2025-04-13 23:16:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1238 states have (on average 3.1292407108239093) internal successors, (3874), 1238 states have internal predecessors, (3874), 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:16:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 3874 transitions. [2025-04-13 23:16:37,232 INFO L79 Accepts]: Start accepts. Automaton has 1239 states and 3874 transitions. Word has length 36 [2025-04-13 23:16:37,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:37,232 INFO L485 AbstractCegarLoop]: Abstraction has 1239 states and 3874 transitions. [2025-04-13 23:16:37,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 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:16:37,232 INFO L278 IsEmpty]: Start isEmpty. Operand 1239 states and 3874 transitions. [2025-04-13 23:16:37,235 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 23:16:37,235 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:37,235 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:37,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 23:16:37,436 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,SelfDestructingSolverStorable7 [2025-04-13 23:16:37,436 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:16:37,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:37,437 INFO L85 PathProgramCache]: Analyzing trace with hash 781675411, now seen corresponding path program 5 times [2025-04-13 23:16:37,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:37,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136377043] [2025-04-13 23:16:37,437 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:16:37,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:37,446 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 23:16:37,466 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:16:37,466 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:16:37,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:16:37,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:37,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136377043] [2025-04-13 23:16:37,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136377043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:16:37,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:16:37,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 23:16:37,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125524841] [2025-04-13 23:16:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:16:37,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:16:37,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:37,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:16:37,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:16:37,553 INFO L87 Difference]: Start difference. First operand 1239 states and 3874 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:37,766 INFO L93 Difference]: Finished difference Result 2671 states and 8498 transitions. [2025-04-13 23:16:37,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:16:37,767 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-04-13 23:16:37,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:37,776 INFO L225 Difference]: With dead ends: 2671 [2025-04-13 23:16:37,776 INFO L226 Difference]: Without dead ends: 1709 [2025-04-13 23:16:37,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:16:37,779 INFO L437 NwaCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:37,780 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 25 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:16:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2025-04-13 23:16:37,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1521. [2025-04-13 23:16:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1520 states have (on average 2.9914473684210527) internal successors, (4547), 1520 states have internal predecessors, (4547), 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:16:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 4547 transitions. [2025-04-13 23:16:37,911 INFO L79 Accepts]: Start accepts. Automaton has 1521 states and 4547 transitions. Word has length 37 [2025-04-13 23:16:37,911 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:37,911 INFO L485 AbstractCegarLoop]: Abstraction has 1521 states and 4547 transitions. [2025-04-13 23:16:37,911 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:16:37,911 INFO L278 IsEmpty]: Start isEmpty. Operand 1521 states and 4547 transitions. [2025-04-13 23:16:37,914 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 23:16:37,914 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:37,914 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:37,914 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 23:16:37,914 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:16:37,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash -218562883, now seen corresponding path program 1 times [2025-04-13 23:16:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:37,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026745184] [2025-04-13 23:16:37,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:16:37,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:37,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 23:16:37,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:16:37,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:16:37,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:38,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026745184] [2025-04-13 23:16:38,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026745184] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:38,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581442620] [2025-04-13 23:16:38,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:16:38,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:38,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:38,931 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:16:38,932 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:16:38,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 23:16:38,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:16:38,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:16:38,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:38,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 23:16:38,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:39,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:39,739 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:16:39,740 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 75 treesize of output 60 [2025-04-13 23:16:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:40,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581442620] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:16:40,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:16:40,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2025-04-13 23:16:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884488888] [2025-04-13 23:16:40,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:16:40,062 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 23:16:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:16:40,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 23:16:40,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1285, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 23:16:40,063 INFO L87 Difference]: Start difference. First operand 1521 states and 4547 transitions. Second operand has 39 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 38 states have internal predecessors, (97), 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:16:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:16:49,455 INFO L93 Difference]: Finished difference Result 9513 states and 28659 transitions. [2025-04-13 23:16:49,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-04-13 23:16:49,455 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 38 states have internal predecessors, (97), 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 37 [2025-04-13 23:16:49,455 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:16:49,494 INFO L225 Difference]: With dead ends: 9513 [2025-04-13 23:16:49,495 INFO L226 Difference]: Without dead ends: 7413 [2025-04-13 23:16:49,502 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8139 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=4004, Invalid=20176, Unknown=0, NotChecked=0, Total=24180 [2025-04-13 23:16:49,502 INFO L437 NwaCegarLoop]: 56 mSDtfsCounter, 1240 mSDsluCounter, 890 mSDsCounter, 0 mSdLazyCounter, 5161 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 5288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 5161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:16:49,502 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 946 Invalid, 5288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 5161 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-04-13 23:16:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7413 states. [2025-04-13 23:16:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7413 to 3907. [2025-04-13 23:16:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3907 states, 3906 states have (on average 3.0399385560675882) internal successors, (11874), 3906 states have internal predecessors, (11874), 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:16:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3907 states to 3907 states and 11874 transitions. [2025-04-13 23:16:49,960 INFO L79 Accepts]: Start accepts. Automaton has 3907 states and 11874 transitions. Word has length 37 [2025-04-13 23:16:49,960 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:16:49,960 INFO L485 AbstractCegarLoop]: Abstraction has 3907 states and 11874 transitions. [2025-04-13 23:16:49,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.4871794871794872) internal successors, (97), 38 states have internal predecessors, (97), 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:16:49,961 INFO L278 IsEmpty]: Start isEmpty. Operand 3907 states and 11874 transitions. [2025-04-13 23:16:49,966 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 23:16:49,966 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:16:49,966 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:16:49,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 23:16:50,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:50,170 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:16:50,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:16:50,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1888394667, now seen corresponding path program 2 times [2025-04-13 23:16:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:16:50,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174759784] [2025-04-13 23:16:50,171 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:16:50,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:16:50,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 23:16:50,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:16:50,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:16:50,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:50,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:16:50,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174759784] [2025-04-13 23:16:50,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174759784] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:16:50,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887861163] [2025-04-13 23:16:50,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:16:50,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:16:50,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:16:50,686 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:16:50,687 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:16:50,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-13 23:16:50,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 23:16:50,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:16:50,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:16:50,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 23:16:50,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:16:50,807 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:16:51,316 INFO L325 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2025-04-13 23:16:51,316 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 38 treesize of output 17 [2025-04-13 23:16:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:16:51,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:16:52,884 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 150 [2025-04-13 23:16:52,944 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:16:52,944 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 270 treesize of output 324 [2025-04-13 23:16:58,452 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-13 23:17:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:27,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887861163] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:27,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:27,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2025-04-13 23:17:27,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559178988] [2025-04-13 23:17:27,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:27,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 23:17:27,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:27,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 23:17:27,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1362, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:17:27,070 INFO L87 Difference]: Start difference. First operand 3907 states and 11874 transitions. Second operand has 41 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 40 states have internal predecessors, (97), 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:17:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:34,568 INFO L93 Difference]: Finished difference Result 15428 states and 47620 transitions. [2025-04-13 23:17:34,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 23:17:34,569 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 40 states have internal predecessors, (97), 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 37 [2025-04-13 23:17:34,569 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:34,604 INFO L225 Difference]: With dead ends: 15428 [2025-04-13 23:17:34,604 INFO L226 Difference]: Without dead ends: 10778 [2025-04-13 23:17:34,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2456 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1583, Invalid=7159, Unknown=0, NotChecked=0, Total=8742 [2025-04-13 23:17:34,615 INFO L437 NwaCegarLoop]: 27 mSDtfsCounter, 1174 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 3114 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 3231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:34,615 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 545 Invalid, 3231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3114 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-13 23:17:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10778 states. [2025-04-13 23:17:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10778 to 5797. [2025-04-13 23:17:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5797 states, 5796 states have (on average 3.0134575569358177) internal successors, (17466), 5796 states have internal predecessors, (17466), 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:17:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5797 states to 5797 states and 17466 transitions. [2025-04-13 23:17:35,664 INFO L79 Accepts]: Start accepts. Automaton has 5797 states and 17466 transitions. Word has length 37 [2025-04-13 23:17:35,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:35,665 INFO L485 AbstractCegarLoop]: Abstraction has 5797 states and 17466 transitions. [2025-04-13 23:17:35,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 40 states have internal predecessors, (97), 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:17:35,665 INFO L278 IsEmpty]: Start isEmpty. Operand 5797 states and 17466 transitions. [2025-04-13 23:17:35,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 23:17:35,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:35,673 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:35,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 23:17:35,873 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:35,873 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:17:35,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:35,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1253091926, now seen corresponding path program 3 times [2025-04-13 23:17:35,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:35,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17881452] [2025-04-13 23:17:35,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:17:35,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:35,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 3 equivalence classes. [2025-04-13 23:17:35,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 38 statements. [2025-04-13 23:17:35,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:17:35,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:17:36,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:36,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17881452] [2025-04-13 23:17:36,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17881452] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:36,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258564151] [2025-04-13 23:17:36,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:17:36,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:36,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:36,186 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:17:36,188 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:17:36,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 3 equivalence classes. [2025-04-13 23:17:36,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 38 statements. [2025-04-13 23:17:36,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:17:36,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:36,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 23:17:36,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:17:36,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:36,784 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:17:36,785 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 75 treesize of output 60 [2025-04-13 23:17:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:17:36,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258564151] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:36,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:36,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 26 [2025-04-13 23:17:36,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312029227] [2025-04-13 23:17:36,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:36,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 23:17:36,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:36,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 23:17:36,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:17:36,874 INFO L87 Difference]: Start difference. First operand 5797 states and 17466 transitions. Second operand has 27 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 26 states have internal predecessors, (94), 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:17:39,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:39,486 INFO L93 Difference]: Finished difference Result 9639 states and 29127 transitions. [2025-04-13 23:17:39,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 23:17:39,487 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 26 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 23:17:39,487 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:39,518 INFO L225 Difference]: With dead ends: 9639 [2025-04-13 23:17:39,518 INFO L226 Difference]: Without dead ends: 9079 [2025-04-13 23:17:39,521 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=400, Invalid=1580, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 23:17:39,522 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 634 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:39,522 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 167 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:17:39,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9079 states. [2025-04-13 23:17:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9079 to 6499. [2025-04-13 23:17:40,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6499 states, 6498 states have (on average 3.0027700831024933) internal successors, (19512), 6498 states have internal predecessors, (19512), 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:17:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6499 states to 6499 states and 19512 transitions. [2025-04-13 23:17:40,640 INFO L79 Accepts]: Start accepts. Automaton has 6499 states and 19512 transitions. Word has length 38 [2025-04-13 23:17:40,640 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:40,640 INFO L485 AbstractCegarLoop]: Abstraction has 6499 states and 19512 transitions. [2025-04-13 23:17:40,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 26 states have internal predecessors, (94), 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:17:40,640 INFO L278 IsEmpty]: Start isEmpty. Operand 6499 states and 19512 transitions. [2025-04-13 23:17:40,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-04-13 23:17:40,648 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:40,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:40,654 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:17:40,848 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,SelfDestructingSolverStorable11 [2025-04-13 23:17:40,848 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:17:40,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash 195618399, now seen corresponding path program 4 times [2025-04-13 23:17:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:40,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799533035] [2025-04-13 23:17:40,849 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:17:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:40,854 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 23:17:40,862 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 23:17:40,862 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:17:40,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:17:40,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:40,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799533035] [2025-04-13 23:17:40,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799533035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:40,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656835280] [2025-04-13 23:17:40,921 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:17:40,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:40,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:40,923 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:17:40,925 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:17:40,963 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-04-13 23:17:40,982 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 23:17:40,982 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:17:40,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:40,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:17:40,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:17:41,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:17:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656835280] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:41,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 9 [2025-04-13 23:17:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235074150] [2025-04-13 23:17:41,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:41,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:17:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:41,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:17:41,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:17:41,111 INFO L87 Difference]: Start difference. First operand 6499 states and 19512 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 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:17:43,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:43,429 INFO L93 Difference]: Finished difference Result 11833 states and 36056 transitions. [2025-04-13 23:17:43,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:17:43,429 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 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 40 [2025-04-13 23:17:43,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:43,460 INFO L225 Difference]: With dead ends: 11833 [2025-04-13 23:17:43,460 INFO L226 Difference]: Without dead ends: 10091 [2025-04-13 23:17:43,465 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:17:43,466 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 121 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:43,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 29 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:17:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10091 states. [2025-04-13 23:17:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10091 to 8775. [2025-04-13 23:17:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8775 states, 8774 states have (on average 3.0278094369728743) internal successors, (26566), 8774 states have internal predecessors, (26566), 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:17:45,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8775 states to 8775 states and 26566 transitions. [2025-04-13 23:17:45,072 INFO L79 Accepts]: Start accepts. Automaton has 8775 states and 26566 transitions. Word has length 40 [2025-04-13 23:17:45,072 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:45,072 INFO L485 AbstractCegarLoop]: Abstraction has 8775 states and 26566 transitions. [2025-04-13 23:17:45,072 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 9 states have internal predecessors, (68), 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:17:45,072 INFO L278 IsEmpty]: Start isEmpty. Operand 8775 states and 26566 transitions. [2025-04-13 23:17:45,080 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 23:17:45,080 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:45,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:45,086 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:17:45,281 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:45,281 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:17:45,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:45,282 INFO L85 PathProgramCache]: Analyzing trace with hash -112350792, now seen corresponding path program 5 times [2025-04-13 23:17:45,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:45,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491237654] [2025-04-13 23:17:45,282 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:17:45,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:45,286 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-04-13 23:17:45,294 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:17:45,294 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:17:45,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:45,386 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 23:17:45,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:45,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491237654] [2025-04-13 23:17:45,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491237654] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:45,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632064342] [2025-04-13 23:17:45,388 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:17:45,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:45,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:45,389 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:17:45,391 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:17:45,435 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 3 equivalence classes. [2025-04-13 23:17:45,457 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 23:17:45,457 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 23:17:45,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:45,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-13 23:17:45,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:45,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:17:45,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:17:45,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632064342] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:45,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:45,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-04-13 23:17:45,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444896661] [2025-04-13 23:17:45,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:45,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:17:45,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:45,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:17:45,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:17:45,764 INFO L87 Difference]: Start difference. First operand 8775 states and 26566 transitions. Second operand has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 22 states have internal predecessors, (90), 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:17:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:17:46,578 INFO L93 Difference]: Finished difference Result 9415 states and 28437 transitions. [2025-04-13 23:17:46,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:17:46,578 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 22 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 23:17:46,579 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:17:46,591 INFO L225 Difference]: With dead ends: 9415 [2025-04-13 23:17:46,592 INFO L226 Difference]: Without dead ends: 2322 [2025-04-13 23:17:46,600 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:17:46,600 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 140 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:17:46,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 164 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:17:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2025-04-13 23:17:46,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 2322. [2025-04-13 23:17:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 2321 states have (on average 3.010771219302025) internal successors, (6988), 2321 states have internal predecessors, (6988), 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:17:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 6988 transitions. [2025-04-13 23:17:46,907 INFO L79 Accepts]: Start accepts. Automaton has 2322 states and 6988 transitions. Word has length 44 [2025-04-13 23:17:46,908 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:17:46,908 INFO L485 AbstractCegarLoop]: Abstraction has 2322 states and 6988 transitions. [2025-04-13 23:17:46,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 22 states have internal predecessors, (90), 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:17:46,908 INFO L278 IsEmpty]: Start isEmpty. Operand 2322 states and 6988 transitions. [2025-04-13 23:17:46,911 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 23:17:46,911 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:17:46,911 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:17:46,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 23:17:47,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:47,112 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:17:47,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:17:47,112 INFO L85 PathProgramCache]: Analyzing trace with hash 138161731, now seen corresponding path program 6 times [2025-04-13 23:17:47,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:17:47,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538435139] [2025-04-13 23:17:47,112 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:17:47,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:17:47,118 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 3 equivalence classes. [2025-04-13 23:17:47,142 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:17:47,142 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:17:47,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:47,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:17:47,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538435139] [2025-04-13 23:17:47,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538435139] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:17:47,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606831723] [2025-04-13 23:17:47,746 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:17:47,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:17:47,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:17:47,747 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:17:47,748 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:17:47,788 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 3 equivalence classes. [2025-04-13 23:17:47,808 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:17:47,808 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 23:17:47,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:17:47,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 23:17:47,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:17:47,896 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:17:48,569 INFO L325 Elim1Store]: treesize reduction 99, result has 9.2 percent of original size [2025-04-13 23:17:48,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 68 treesize of output 27 [2025-04-13 23:17:48,618 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:48,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:17:49,578 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 151 [2025-04-13 23:17:49,643 INFO L325 Elim1Store]: treesize reduction 24, result has 78.0 percent of original size [2025-04-13 23:17:49,643 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 536 treesize of output 442 [2025-04-13 23:17:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:17:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606831723] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:17:54,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:17:54,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 46 [2025-04-13 23:17:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947755593] [2025-04-13 23:17:54,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:17:54,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-04-13 23:17:54,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:17:54,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-04-13 23:17:54,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1902, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 23:17:54,109 INFO L87 Difference]: Start difference. First operand 2322 states and 6988 transitions. Second operand has 47 states, 47 states have (on average 2.574468085106383) internal successors, (121), 46 states have internal predecessors, (121), 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:18:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:18:02,796 INFO L93 Difference]: Finished difference Result 9969 states and 30113 transitions. [2025-04-13 23:18:02,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:18:02,796 INFO L79 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.574468085106383) internal successors, (121), 46 states have internal predecessors, (121), 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 45 [2025-04-13 23:18:02,796 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:18:02,815 INFO L225 Difference]: With dead ends: 9969 [2025-04-13 23:18:02,815 INFO L226 Difference]: Without dead ends: 8229 [2025-04-13 23:18:02,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2767 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1981, Invalid=9149, Unknown=0, NotChecked=0, Total=11130 [2025-04-13 23:18:02,820 INFO L437 NwaCegarLoop]: 51 mSDtfsCounter, 1114 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 3878 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 3990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 3878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:18:02,821 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 846 Invalid, 3990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 3878 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-04-13 23:18:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2025-04-13 23:18:03,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 4024. [2025-04-13 23:18:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4024 states, 4023 states have (on average 2.995525727069351) internal successors, (12051), 4023 states have internal predecessors, (12051), 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:18:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4024 states to 4024 states and 12051 transitions. [2025-04-13 23:18:03,596 INFO L79 Accepts]: Start accepts. Automaton has 4024 states and 12051 transitions. Word has length 45 [2025-04-13 23:18:03,596 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:18:03,596 INFO L485 AbstractCegarLoop]: Abstraction has 4024 states and 12051 transitions. [2025-04-13 23:18:03,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.574468085106383) internal successors, (121), 46 states have internal predecessors, (121), 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:18:03,597 INFO L278 IsEmpty]: Start isEmpty. Operand 4024 states and 12051 transitions. [2025-04-13 23:18:03,602 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 23:18:03,602 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:18:03,602 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:18:03,608 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:18:03,802 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,SelfDestructingSolverStorable14 [2025-04-13 23:18:03,802 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:18:03,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:18:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1364720097, now seen corresponding path program 7 times [2025-04-13 23:18:03,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:18:03,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806788579] [2025-04-13 23:18:03,803 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:18:03,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:18:03,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 23:18:03,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:18:03,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:18:03,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:04,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:18:04,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806788579] [2025-04-13 23:18:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806788579] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:18:04,623 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854428763] [2025-04-13 23:18:04,623 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:18:04,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:18:04,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:18:04,625 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:18:04,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 23:18:04,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-13 23:18:04,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:18:04,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:18:04,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:04,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 23:18:04,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:18:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:05,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:18:05,494 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:18:05,494 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-04-13 23:18:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:05,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854428763] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:18:05,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:18:05,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 47 [2025-04-13 23:18:05,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631154052] [2025-04-13 23:18:05,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:18:05,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-04-13 23:18:05,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:18:05,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-04-13 23:18:05,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2001, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 23:18:05,830 INFO L87 Difference]: Start difference. First operand 4024 states and 12051 transitions. Second operand has 48 states, 48 states have (on average 2.5208333333333335) internal successors, (121), 47 states have internal predecessors, (121), 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:18:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:18:25,971 INFO L93 Difference]: Finished difference Result 24084 states and 73174 transitions. [2025-04-13 23:18:25,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2025-04-13 23:18:25,972 INFO L79 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.5208333333333335) internal successors, (121), 47 states have internal predecessors, (121), 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 45 [2025-04-13 23:18:25,972 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:18:26,018 INFO L225 Difference]: With dead ends: 24084 [2025-04-13 23:18:26,018 INFO L226 Difference]: Without dead ends: 21116 [2025-04-13 23:18:26,030 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27027 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=8668, Invalid=59714, Unknown=0, NotChecked=0, Total=68382 [2025-04-13 23:18:26,030 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 1385 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 10025 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1385 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 10129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 10025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:18:26,030 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1385 Valid, 1742 Invalid, 10129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 10025 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-04-13 23:18:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21116 states. [2025-04-13 23:18:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21116 to 7930. [2025-04-13 23:18:27,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7930 states, 7929 states have (on average 3.033043258922941) internal successors, (24049), 7929 states have internal predecessors, (24049), 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:18:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7930 states to 7930 states and 24049 transitions. [2025-04-13 23:18:27,764 INFO L79 Accepts]: Start accepts. Automaton has 7930 states and 24049 transitions. Word has length 45 [2025-04-13 23:18:27,764 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:18:27,764 INFO L485 AbstractCegarLoop]: Abstraction has 7930 states and 24049 transitions. [2025-04-13 23:18:27,764 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.5208333333333335) internal successors, (121), 47 states have internal predecessors, (121), 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:18:27,764 INFO L278 IsEmpty]: Start isEmpty. Operand 7930 states and 24049 transitions. [2025-04-13 23:18:27,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 23:18:27,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:18:27,773 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:18:27,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:18:27,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 23:18:27,974 INFO L403 AbstractCegarLoop]: === Iteration 17 === 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:18:27,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:18:27,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1203463947, now seen corresponding path program 8 times [2025-04-13 23:18:27,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:18:27,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049351817] [2025-04-13 23:18:27,974 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:18:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:18:27,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 23:18:27,994 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:18:27,994 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:18:27,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:28,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:18:28,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049351817] [2025-04-13 23:18:28,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049351817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:18:28,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234968571] [2025-04-13 23:18:28,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:18:28,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:18:28,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:18:28,756 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:18:28,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 23:18:28,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-13 23:18:28,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:18:28,814 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:18:28,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:18:28,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 23:18:28,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:18:28,893 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:18:29,343 INFO L325 Elim1Store]: treesize reduction 26, result has 10.3 percent of original size [2025-04-13 23:18:29,343 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 49 treesize of output 18 [2025-04-13 23:18:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:29,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:18:30,484 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 152 [2025-04-13 23:18:30,545 INFO L325 Elim1Store]: treesize reduction 26, result has 74.8 percent of original size [2025-04-13 23:18:30,545 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 549 treesize of output 446 [2025-04-13 23:18:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:18:33,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234968571] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:18:33,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:18:33,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 49 [2025-04-13 23:18:33,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895891842] [2025-04-13 23:18:33,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:18:33,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-13 23:18:33,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:18:33,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-13 23:18:33,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2167, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 23:18:33,127 INFO L87 Difference]: Start difference. First operand 7930 states and 24049 transitions. Second operand has 50 states, 50 states have (on average 2.42) internal successors, (121), 49 states have internal predecessors, (121), 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:19:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:19:23,295 INFO L93 Difference]: Finished difference Result 52211 states and 158894 transitions. [2025-04-13 23:19:23,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 313 states. [2025-04-13 23:19:23,295 INFO L79 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.42) internal successors, (121), 49 states have internal predecessors, (121), 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 45 [2025-04-13 23:19:23,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:19:23,402 INFO L225 Difference]: With dead ends: 52211 [2025-04-13 23:19:23,403 INFO L226 Difference]: Without dead ends: 41801 [2025-04-13 23:19:23,428 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 347 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51047 ImplicationChecksByTransitivity, 26.3s TimeCoverageRelationStatistics Valid=12904, Invalid=108548, Unknown=0, NotChecked=0, Total=121452 [2025-04-13 23:19:23,429 INFO L437 NwaCegarLoop]: 58 mSDtfsCounter, 2474 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 7416 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2474 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 7784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 7416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:19:23,429 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2474 Valid, 1346 Invalid, 7784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 7416 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-04-13 23:19:23,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41801 states. [2025-04-13 23:19:28,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41801 to 16316. [2025-04-13 23:19:28,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16316 states, 16315 states have (on average 3.050873429359485) internal successors, (49775), 16315 states have internal predecessors, (49775), 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:19:28,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16316 states to 16316 states and 49775 transitions. [2025-04-13 23:19:28,194 INFO L79 Accepts]: Start accepts. Automaton has 16316 states and 49775 transitions. Word has length 45 [2025-04-13 23:19:28,195 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:19:28,195 INFO L485 AbstractCegarLoop]: Abstraction has 16316 states and 49775 transitions. [2025-04-13 23:19:28,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.42) internal successors, (121), 49 states have internal predecessors, (121), 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:19:28,195 INFO L278 IsEmpty]: Start isEmpty. Operand 16316 states and 49775 transitions. [2025-04-13 23:19:28,210 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 23:19:28,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:19:28,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:19:28,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 23:19:28,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 23:19:28,411 INFO L403 AbstractCegarLoop]: === Iteration 18 === 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:19:28,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:19:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1328008339, now seen corresponding path program 9 times [2025-04-13 23:19:28,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:19:28,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169205795] [2025-04-13 23:19:28,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:19:28,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:19:28,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-04-13 23:19:28,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:19:28,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 23:19:28,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:19:29,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:19:29,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169205795] [2025-04-13 23:19:29,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169205795] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:19:29,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383103968] [2025-04-13 23:19:29,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:19:29,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:19:29,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:19:29,032 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:19:29,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 23:19:29,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-04-13 23:19:29,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:19:29,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 23:19:29,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:19:29,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 23:19:29,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:19:29,173 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:19:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:19:29,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:19:30,686 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 152 [2025-04-13 23:19:30,742 INFO L325 Elim1Store]: treesize reduction 33, result has 68.0 percent of original size [2025-04-13 23:19:30,742 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 525 treesize of output 415 [2025-04-13 23:19:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:19:32,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383103968] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:19:32,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:19:32,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 45 [2025-04-13 23:19:32,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110918776] [2025-04-13 23:19:32,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:19:32,078 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-13 23:19:32,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:19:32,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-13 23:19:32,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1717, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 23:19:32,078 INFO L87 Difference]: Start difference. First operand 16316 states and 49775 transitions. Second operand has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 45 states have internal predecessors, (121), 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:01,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:20:01,814 INFO L93 Difference]: Finished difference Result 50750 states and 155869 transitions. [2025-04-13 23:20:01,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2025-04-13 23:20:01,815 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 45 states have internal predecessors, (121), 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 45 [2025-04-13 23:20:01,815 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:20:01,963 INFO L225 Difference]: With dead ends: 50750 [2025-04-13 23:20:01,963 INFO L226 Difference]: Without dead ends: 42212 [2025-04-13 23:20:01,986 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8842 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=4874, Invalid=22848, Unknown=0, NotChecked=0, Total=27722 [2025-04-13 23:20:01,987 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 2129 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 3894 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2129 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 4271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 3894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:20:01,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2129 Valid, 787 Invalid, 4271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 3894 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-04-13 23:20:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42212 states. [2025-04-13 23:20:09,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42212 to 23439. [2025-04-13 23:20:09,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23439 states, 23438 states have (on average 3.0291833774212815) internal successors, (70998), 23438 states have internal predecessors, (70998), 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:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23439 states to 23439 states and 70998 transitions. [2025-04-13 23:20:09,327 INFO L79 Accepts]: Start accepts. Automaton has 23439 states and 70998 transitions. Word has length 45 [2025-04-13 23:20:09,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:20:09,327 INFO L485 AbstractCegarLoop]: Abstraction has 23439 states and 70998 transitions. [2025-04-13 23:20:09,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 45 states have internal predecessors, (121), 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:09,327 INFO L278 IsEmpty]: Start isEmpty. Operand 23439 states and 70998 transitions. [2025-04-13 23:20:09,349 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-13 23:20:09,349 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:20:09,349 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:20:09,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 23:20:09,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 23:20:09,550 INFO L403 AbstractCegarLoop]: === Iteration 19 === 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:09,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:20:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1034564551, now seen corresponding path program 10 times [2025-04-13 23:20:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:20:09,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075869430] [2025-04-13 23:20:09,550 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:20:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:20:09,555 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 23:20:09,561 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:20:09,561 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:20:09,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 23:20:09,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:20:09,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075869430] [2025-04-13 23:20:09,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075869430] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:20:09,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546166134] [2025-04-13 23:20:09,877 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:20:09,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:20:09,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:20:09,879 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:20:09,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 23:20:09,929 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-13 23:20:09,950 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:20:09,950 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:20:09,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:20:09,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 23:20:09,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:20:10,005 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 23:20:10,489 INFO L325 Elim1Store]: treesize reduction 99, result has 9.2 percent of original size [2025-04-13 23:20:10,489 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 68 treesize of output 27 [2025-04-13 23:20:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:20:10,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:20:12,207 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 188 [2025-04-13 23:20:12,321 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:20:12,322 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 534 treesize of output 590 [2025-04-13 23:25:15,991 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 23:25:15,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 23:25:15,992 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 23:25:15,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 23:25:16,193 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:25:16,194 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 78 more [2025-04-13 23:25:16,199 INFO L158 Benchmark]: Toolchain (without parser) took 524052.37ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 98.7MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2025-04-13 23:25:16,199 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:25:16,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.40ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 83.8MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:25:16,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.86ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:25:16,199 INFO L158 Benchmark]: Boogie Preprocessor took 35.12ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 79.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:25:16,199 INFO L158 Benchmark]: IcfgBuilder took 484.60ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 33.4MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 23:25:16,199 INFO L158 Benchmark]: TraceAbstraction took 523263.09ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 33.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2025-04-13 23:25:16,200 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.40ms. Allocated memory is still 142.6MB. Free memory was 98.7MB in the beginning and 83.8MB in the end (delta: 15.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.86ms. Allocated memory is still 142.6MB. Free memory was 83.8MB in the beginning and 82.0MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.12ms. Allocated memory is still 142.6MB. Free memory was 82.0MB in the beginning and 79.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 484.60ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 33.4MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 523263.09ms. Allocated memory was 142.6MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 33.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...