/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 18:25:46,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 18:25:46,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 18:25:46,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 18:25:46,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 18:25:46,681 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 18:25:46,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 18:25:46,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 18:25:46,682 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 18:25:46,682 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 18:25:46,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 18:25:46,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 18:25:46,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 18:25:46,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 18:25:46,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 18:25:46,684 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:25:46,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:25:46,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 18:25:46,684 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 18:25:46,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 18:25:46,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 18:25:46,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 18:25:46,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 18:25:46,904 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 18:25:46,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c [2025-04-13 18:25:48,128 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e47fa88/9358f88bec1e4b4d81a173add8916558/FLAGb355f064f [2025-04-13 18:25:48,322 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 18:25:48,323 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series3.wvr.c [2025-04-13 18:25:48,340 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e47fa88/9358f88bec1e4b4d81a173add8916558/FLAGb355f064f [2025-04-13 18:25:49,129 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73e47fa88/9358f88bec1e4b4d81a173add8916558 [2025-04-13 18:25:49,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 18:25:49,132 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 18:25:49,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 18:25:49,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 18:25:49,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 18:25:49,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739e84d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49, skipping insertion in model container [2025-04-13 18:25:49,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 18:25:49,307 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-more-buffer-series3.wvr.c[4403,4416] [2025-04-13 18:25:49,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:25:49,323 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 18:25:49,364 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-more-buffer-series3.wvr.c[4403,4416] [2025-04-13 18:25:49,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 18:25:49,390 INFO L204 MainTranslator]: Completed translation [2025-04-13 18:25:49,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49 WrapperNode [2025-04-13 18:25:49,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 18:25:49,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 18:25:49,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 18:25:49,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 18:25:49,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,438 INFO L138 Inliner]: procedures = 26, calls = 67, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 319 [2025-04-13 18:25:49,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 18:25:49,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 18:25:49,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 18:25:49,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 18:25:49,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,479 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-04-13 18:25:49,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,490 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 18:25:49,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 18:25:49,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 18:25:49,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 18:25:49,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (1/1) ... [2025-04-13 18:25:49,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 18:25:49,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 18:25:49,531 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 18:25:49,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 18:25:49,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 18:25:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 18:25:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 18:25:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 18:25:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 18:25:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 18:25:49,549 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 18:25:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 18:25:49,549 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 18:25:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 18:25:49,549 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 18:25:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 18:25:49,549 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 18:25:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 18:25:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 18:25:49,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 18:25:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 18:25:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 18:25:49,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 18:25:49,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 18:25:49,551 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 18:25:49,633 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 18:25:49,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 18:25:49,976 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 18:25:49,977 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 18:25:49,977 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 18:25:50,313 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 18:25:50,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:25:50 BoogieIcfgContainer [2025-04-13 18:25:50,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 18:25:50,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 18:25:50,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 18:25:50,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 18:25:50,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:25:49" (1/3) ... [2025-04-13 18:25:50,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f36109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:25:50, skipping insertion in model container [2025-04-13 18:25:50,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:25:49" (2/3) ... [2025-04-13 18:25:50,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f36109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:25:50, skipping insertion in model container [2025-04-13 18:25:50,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:25:50" (3/3) ... [2025-04-13 18:25:50,321 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series3.wvr.c [2025-04-13 18:25:50,332 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 18:25:50,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-series3.wvr.c that has 5 procedures, 45 locations, 47 edges, 1 initial locations, 7 loop locations, and 1 error locations. [2025-04-13 18:25:50,334 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 18:25:50,405 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 18:25:50,426 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 51 transitions, 130 flow [2025-04-13 18:25:50,629 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4529 states, 4528 states have (on average 4.348056537102473) internal successors, (19688), 4528 states have internal predecessors, (19688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:50,647 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 18:25:50,655 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;@35380e99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 18:25:50,656 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 18:25:50,670 INFO L278 IsEmpty]: Start isEmpty. Operand has 4529 states, 4528 states have (on average 4.348056537102473) internal successors, (19688), 4528 states have internal predecessors, (19688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:50,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 18:25:50,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:50,726 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 18:25:50,726 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:50,730 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:50,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1786897594, now seen corresponding path program 1 times [2025-04-13 18:25:50,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:50,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113373149] [2025-04-13 18:25:50,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:50,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:50,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 18:25:50,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 18:25:50,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:50,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:51,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:51,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113373149] [2025-04-13 18:25:51,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113373149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:51,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:51,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 18:25:51,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432704390] [2025-04-13 18:25:51,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:51,026 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:25:51,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:51,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:25:51,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:25:51,051 INFO L87 Difference]: Start difference. First operand has 4529 states, 4528 states have (on average 4.348056537102473) internal successors, (19688), 4528 states have internal predecessors, (19688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 14.5) internal successors, (29), 2 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 18:25:51,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:51,344 INFO L93 Difference]: Finished difference Result 7056 states and 30788 transitions. [2025-04-13 18:25:51,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:25:51,346 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 2 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 18:25:51,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:51,424 INFO L225 Difference]: With dead ends: 7056 [2025-04-13 18:25:51,425 INFO L226 Difference]: Without dead ends: 6947 [2025-04-13 18:25:51,432 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:25:51,436 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:51,437 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 32 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:25:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6947 states. [2025-04-13 18:25:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6947 to 5894. [2025-04-13 18:25:51,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5894 states, 5893 states have (on average 4.3560156117427455) internal successors, (25670), 5893 states have internal predecessors, (25670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:51,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5894 states to 5894 states and 25670 transitions. [2025-04-13 18:25:51,814 INFO L79 Accepts]: Start accepts. Automaton has 5894 states and 25670 transitions. Word has length 29 [2025-04-13 18:25:51,814 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:51,814 INFO L485 AbstractCegarLoop]: Abstraction has 5894 states and 25670 transitions. [2025-04-13 18:25:51,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 2 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 18:25:51,815 INFO L278 IsEmpty]: Start isEmpty. Operand 5894 states and 25670 transitions. [2025-04-13 18:25:51,835 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:25:51,835 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:51,836 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:51,836 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 18:25:51,836 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:51,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1569675115, now seen corresponding path program 1 times [2025-04-13 18:25:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:51,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876551140] [2025-04-13 18:25:51,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:51,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:51,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 18:25:51,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:25:51,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:51,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:52,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:52,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876551140] [2025-04-13 18:25:52,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876551140] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:52,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:52,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:25:52,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845606773] [2025-04-13 18:25:52,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:52,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:25:52,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:52,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:25:52,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:25:52,023 INFO L87 Difference]: Start difference. First operand 5894 states and 25670 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:52,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:52,372 INFO L93 Difference]: Finished difference Result 11195 states and 48775 transitions. [2025-04-13 18:25:52,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:25:52,372 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 18:25:52,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:52,434 INFO L225 Difference]: With dead ends: 11195 [2025-04-13 18:25:52,435 INFO L226 Difference]: Without dead ends: 8039 [2025-04-13 18:25:52,446 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 18:25:52,446 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:52,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:25:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8039 states. [2025-04-13 18:25:52,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8039 to 7526. [2025-04-13 18:25:52,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7526 states, 7525 states have (on average 4.33063122923588) internal successors, (32588), 7525 states have internal predecessors, (32588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7526 states to 7526 states and 32588 transitions. [2025-04-13 18:25:52,783 INFO L79 Accepts]: Start accepts. Automaton has 7526 states and 32588 transitions. Word has length 32 [2025-04-13 18:25:52,783 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:52,783 INFO L485 AbstractCegarLoop]: Abstraction has 7526 states and 32588 transitions. [2025-04-13 18:25:52,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:52,783 INFO L278 IsEmpty]: Start isEmpty. Operand 7526 states and 32588 transitions. [2025-04-13 18:25:52,805 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 18:25:52,805 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:52,805 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:52,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 18:25:52,806 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:52,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:52,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1602731981, now seen corresponding path program 1 times [2025-04-13 18:25:52,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:52,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160803949] [2025-04-13 18:25:52,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:52,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:52,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 18:25:52,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 18:25:52,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:52,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:52,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:52,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:52,935 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160803949] [2025-04-13 18:25:52,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160803949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:52,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:52,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 18:25:52,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823263045] [2025-04-13 18:25:52,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:52,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 18:25:52,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:52,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 18:25:52,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 18:25:52,936 INFO L87 Difference]: Start difference. First operand 7526 states and 32588 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:53,387 INFO L93 Difference]: Finished difference Result 13705 states and 59377 transitions. [2025-04-13 18:25:53,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 18:25:53,387 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-04-13 18:25:53,387 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:53,444 INFO L225 Difference]: With dead ends: 13705 [2025-04-13 18:25:53,444 INFO L226 Difference]: Without dead ends: 10093 [2025-04-13 18:25:53,456 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 18:25:53,457 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:53,457 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 27 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:25:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2025-04-13 18:25:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 9615. [2025-04-13 18:25:53,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9615 states, 9614 states have (on average 4.280840441023507) internal successors, (41156), 9614 states have internal predecessors, (41156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 41156 transitions. [2025-04-13 18:25:53,882 INFO L79 Accepts]: Start accepts. Automaton has 9615 states and 41156 transitions. Word has length 32 [2025-04-13 18:25:53,882 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:53,882 INFO L485 AbstractCegarLoop]: Abstraction has 9615 states and 41156 transitions. [2025-04-13 18:25:53,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:53,883 INFO L278 IsEmpty]: Start isEmpty. Operand 9615 states and 41156 transitions. [2025-04-13 18:25:53,908 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:25:53,908 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:53,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:53,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 18:25:53,908 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:53,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:53,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1623955650, now seen corresponding path program 1 times [2025-04-13 18:25:53,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:53,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93015724] [2025-04-13 18:25:53,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:53,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:53,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:25:53,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:25:53,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:53,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:54,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 18:25:54,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:54,065 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93015724] [2025-04-13 18:25:54,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93015724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:54,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:54,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 18:25:54,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805250549] [2025-04-13 18:25:54,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:54,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:25:54,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:54,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:25:54,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:25:54,065 INFO L87 Difference]: Start difference. First operand 9615 states and 41156 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:54,511 INFO L93 Difference]: Finished difference Result 19690 states and 83806 transitions. [2025-04-13 18:25:54,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 18:25:54,511 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:25:54,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:54,573 INFO L225 Difference]: With dead ends: 19690 [2025-04-13 18:25:54,573 INFO L226 Difference]: Without dead ends: 12044 [2025-04-13 18:25:54,590 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 18:25:54,593 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:54,594 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 48 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:25:54,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12044 states. [2025-04-13 18:25:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12044 to 11245. [2025-04-13 18:25:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11245 states, 11244 states have (on average 4.246264674493063) internal successors, (47745), 11244 states have internal predecessors, (47745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:55,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11245 states to 11245 states and 47745 transitions. [2025-04-13 18:25:55,095 INFO L79 Accepts]: Start accepts. Automaton has 11245 states and 47745 transitions. Word has length 36 [2025-04-13 18:25:55,096 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:55,096 INFO L485 AbstractCegarLoop]: Abstraction has 11245 states and 47745 transitions. [2025-04-13 18:25:55,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:55,096 INFO L278 IsEmpty]: Start isEmpty. Operand 11245 states and 47745 transitions. [2025-04-13 18:25:55,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 18:25:55,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:55,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:55,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 18:25:55,125 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:55,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:55,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1443149680, now seen corresponding path program 1 times [2025-04-13 18:25:55,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:55,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339959583] [2025-04-13 18:25:55,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:55,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:55,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 18:25:55,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 18:25:55,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:55,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:25:55,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:55,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339959583] [2025-04-13 18:25:55,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339959583] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:55,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:55,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:25:55,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501276462] [2025-04-13 18:25:55,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:55,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 18:25:55,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:55,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 18:25:55,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 18:25:55,273 INFO L87 Difference]: Start difference. First operand 11245 states and 47745 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:55,858 INFO L93 Difference]: Finished difference Result 22850 states and 96694 transitions. [2025-04-13 18:25:55,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 18:25:55,858 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-04-13 18:25:55,858 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:55,949 INFO L225 Difference]: With dead ends: 22850 [2025-04-13 18:25:55,949 INFO L226 Difference]: Without dead ends: 13696 [2025-04-13 18:25:55,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:25:55,972 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:55,972 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:25:55,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2025-04-13 18:25:56,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13063. [2025-04-13 18:25:56,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13063 states, 13062 states have (on average 4.215740315418772) internal successors, (55066), 13062 states have internal predecessors, (55066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13063 states to 13063 states and 55066 transitions. [2025-04-13 18:25:56,566 INFO L79 Accepts]: Start accepts. Automaton has 13063 states and 55066 transitions. Word has length 36 [2025-04-13 18:25:56,566 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:56,567 INFO L485 AbstractCegarLoop]: Abstraction has 13063 states and 55066 transitions. [2025-04-13 18:25:56,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:56,567 INFO L278 IsEmpty]: Start isEmpty. Operand 13063 states and 55066 transitions. [2025-04-13 18:25:56,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:25:56,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:56,598 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:56,599 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 18:25:56,599 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:56,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:56,599 INFO L85 PathProgramCache]: Analyzing trace with hash -2115965733, now seen corresponding path program 1 times [2025-04-13 18:25:56,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:56,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491004873] [2025-04-13 18:25:56,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:56,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:56,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 18:25:56,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:25:56,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:56,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:25:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:56,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491004873] [2025-04-13 18:25:56,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491004873] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:56,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:56,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:25:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945551035] [2025-04-13 18:25:56,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:56,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:25:56,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:56,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:25:56,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:25:56,830 INFO L87 Difference]: Start difference. First operand 13063 states and 55066 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:57,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:57,491 INFO L93 Difference]: Finished difference Result 26911 states and 112675 transitions. [2025-04-13 18:25:57,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:25:57,491 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 18:25:57,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:57,578 INFO L225 Difference]: With dead ends: 26911 [2025-04-13 18:25:57,578 INFO L226 Difference]: Without dead ends: 17580 [2025-04-13 18:25:57,599 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:25:57,600 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 99 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:57,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 56 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:25:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2025-04-13 18:25:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 13065. [2025-04-13 18:25:58,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13065 states, 13064 states have (on average 4.2153245560318435) internal successors, (55069), 13064 states have internal predecessors, (55069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13065 states to 13065 states and 55069 transitions. [2025-04-13 18:25:58,174 INFO L79 Accepts]: Start accepts. Automaton has 13065 states and 55069 transitions. Word has length 37 [2025-04-13 18:25:58,174 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:58,175 INFO L485 AbstractCegarLoop]: Abstraction has 13065 states and 55069 transitions. [2025-04-13 18:25:58,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:58,175 INFO L278 IsEmpty]: Start isEmpty. Operand 13065 states and 55069 transitions. [2025-04-13 18:25:58,202 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-04-13 18:25:58,202 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:58,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:58,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 18:25:58,203 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:58,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:58,203 INFO L85 PathProgramCache]: Analyzing trace with hash -774341300, now seen corresponding path program 1 times [2025-04-13 18:25:58,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:58,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100018626] [2025-04-13 18:25:58,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:58,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:58,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-13 18:25:58,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-13 18:25:58,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:58,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:25:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 18:25:58,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:25:58,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100018626] [2025-04-13 18:25:58,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100018626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:25:58,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:25:58,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:25:58,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916812093] [2025-04-13 18:25:58,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:25:58,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:25:58,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:25:58,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:25:58,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:25:58,385 INFO L87 Difference]: Start difference. First operand 13065 states and 55069 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:25:59,109 INFO L93 Difference]: Finished difference Result 15853 states and 65409 transitions. [2025-04-13 18:25:59,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:25:59,110 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 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 18:25:59,110 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:25:59,189 INFO L225 Difference]: With dead ends: 15853 [2025-04-13 18:25:59,190 INFO L226 Difference]: Without dead ends: 13427 [2025-04-13 18:25:59,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:25:59,200 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 66 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:25:59,201 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 54 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:25:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13427 states. [2025-04-13 18:25:59,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13427 to 13066. [2025-04-13 18:25:59,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13066 states, 13065 states have (on average 4.215001913509377) internal successors, (55069), 13065 states have internal predecessors, (55069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:59,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13066 states to 13066 states and 55069 transitions. [2025-04-13 18:25:59,926 INFO L79 Accepts]: Start accepts. Automaton has 13066 states and 55069 transitions. Word has length 37 [2025-04-13 18:25:59,927 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:25:59,927 INFO L485 AbstractCegarLoop]: Abstraction has 13066 states and 55069 transitions. [2025-04-13 18:25:59,927 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:25:59,927 INFO L278 IsEmpty]: Start isEmpty. Operand 13066 states and 55069 transitions. [2025-04-13 18:25:59,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:25:59,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:25:59,950 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:25:59,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 18:25:59,951 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:25:59,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:25:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash 644083577, now seen corresponding path program 1 times [2025-04-13 18:25:59,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:25:59,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2422206] [2025-04-13 18:25:59,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:25:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:25:59,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:25:59,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:25:59,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:25:59,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 18:26:00,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:00,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2422206] [2025-04-13 18:26:00,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2422206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:26:00,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:26:00,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:26:00,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123981261] [2025-04-13 18:26:00,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:26:00,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:26:00,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:00,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:26:00,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:26:00,217 INFO L87 Difference]: Start difference. First operand 13066 states and 55069 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:00,890 INFO L93 Difference]: Finished difference Result 16257 states and 69009 transitions. [2025-04-13 18:26:00,890 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 18:26:00,890 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 18:26:00,891 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:00,965 INFO L225 Difference]: With dead ends: 16257 [2025-04-13 18:26:00,965 INFO L226 Difference]: Without dead ends: 13106 [2025-04-13 18:26:00,975 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 18:26:00,976 INFO L437 NwaCegarLoop]: 17 mSDtfsCounter, 50 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:00,976 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 61 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 18:26:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13106 states. [2025-04-13 18:26:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13106 to 10997. [2025-04-13 18:26:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10997 states, 10996 states have (on average 4.243997817388141) internal successors, (46667), 10996 states have internal predecessors, (46667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10997 states to 10997 states and 46667 transitions. [2025-04-13 18:26:01,827 INFO L79 Accepts]: Start accepts. Automaton has 10997 states and 46667 transitions. Word has length 38 [2025-04-13 18:26:01,827 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:01,827 INFO L485 AbstractCegarLoop]: Abstraction has 10997 states and 46667 transitions. [2025-04-13 18:26:01,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:01,827 INFO L278 IsEmpty]: Start isEmpty. Operand 10997 states and 46667 transitions. [2025-04-13 18:26:01,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 18:26:01,847 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:01,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:01,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 18:26:01,847 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:26:01,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:01,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1760888652, now seen corresponding path program 1 times [2025-04-13 18:26:01,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:01,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125914417] [2025-04-13 18:26:01,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:26:01,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:01,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 18:26:01,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 18:26:01,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:26:01,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:26:02,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:02,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125914417] [2025-04-13 18:26:02,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125914417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:26:02,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:26:02,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 18:26:02,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313157028] [2025-04-13 18:26:02,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:26:02,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 18:26:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:02,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 18:26:02,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:26:02,014 INFO L87 Difference]: Start difference. First operand 10997 states and 46667 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:02,414 INFO L93 Difference]: Finished difference Result 11458 states and 48162 transitions. [2025-04-13 18:26:02,415 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:26:02,415 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-04-13 18:26:02,415 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:02,464 INFO L225 Difference]: With dead ends: 11458 [2025-04-13 18:26:02,464 INFO L226 Difference]: Without dead ends: 9028 [2025-04-13 18:26:02,470 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:26:02,470 INFO L437 NwaCegarLoop]: 15 mSDtfsCounter, 76 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:02,471 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 36 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:26:02,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9028 states. [2025-04-13 18:26:02,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9028 to 8898. [2025-04-13 18:26:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8898 states, 8897 states have (on average 4.272114195796336) internal successors, (38009), 8897 states have internal predecessors, (38009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:02,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 38009 transitions. [2025-04-13 18:26:02,837 INFO L79 Accepts]: Start accepts. Automaton has 8898 states and 38009 transitions. Word has length 38 [2025-04-13 18:26:02,838 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:02,838 INFO L485 AbstractCegarLoop]: Abstraction has 8898 states and 38009 transitions. [2025-04-13 18:26:02,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:02,838 INFO L278 IsEmpty]: Start isEmpty. Operand 8898 states and 38009 transitions. [2025-04-13 18:26:02,853 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:26:02,853 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:02,853 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:02,853 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 18:26:02,853 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:26:02,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:02,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1946826282, now seen corresponding path program 1 times [2025-04-13 18:26:02,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:02,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501533682] [2025-04-13 18:26:02,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:26:02,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:02,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 18:26:02,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:26:02,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:26:02,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:03,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 18:26:03,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:03,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501533682] [2025-04-13 18:26:03,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501533682] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:26:03,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:26:03,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:26:03,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585056805] [2025-04-13 18:26:03,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:26:03,015 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:26:03,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:03,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:26:03,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:26:03,015 INFO L87 Difference]: Start difference. First operand 8898 states and 38009 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:03,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:03,552 INFO L93 Difference]: Finished difference Result 15965 states and 69123 transitions. [2025-04-13 18:26:03,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:26:03,553 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 18:26:03,553 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:03,620 INFO L225 Difference]: With dead ends: 15965 [2025-04-13 18:26:03,620 INFO L226 Difference]: Without dead ends: 15370 [2025-04-13 18:26:03,626 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 18:26:03,627 INFO L437 NwaCegarLoop]: 25 mSDtfsCounter, 81 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:03,627 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 67 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:26:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15370 states. [2025-04-13 18:26:04,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15370 to 10300. [2025-04-13 18:26:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10300 states, 10299 states have (on average 4.285950092241965) internal successors, (44141), 10299 states have internal predecessors, (44141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10300 states to 10300 states and 44141 transitions. [2025-04-13 18:26:04,308 INFO L79 Accepts]: Start accepts. Automaton has 10300 states and 44141 transitions. Word has length 43 [2025-04-13 18:26:04,309 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:04,309 INFO L485 AbstractCegarLoop]: Abstraction has 10300 states and 44141 transitions. [2025-04-13 18:26:04,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:04,310 INFO L278 IsEmpty]: Start isEmpty. Operand 10300 states and 44141 transitions. [2025-04-13 18:26:04,333 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:26:04,334 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:04,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:04,334 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 18:26:04,334 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:26:04,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:04,334 INFO L85 PathProgramCache]: Analyzing trace with hash -598693786, now seen corresponding path program 1 times [2025-04-13 18:26:04,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:04,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53940075] [2025-04-13 18:26:04,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 18:26:04,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:04,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 18:26:04,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:26:04,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:26:04,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 18:26:04,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 18:26:04,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 18:26:04,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53940075] [2025-04-13 18:26:04,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53940075] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 18:26:04,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 18:26:04,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 18:26:04,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718678071] [2025-04-13 18:26:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 18:26:04,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 18:26:04,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 18:26:04,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 18:26:04,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 18:26:04,504 INFO L87 Difference]: Start difference. First operand 10300 states and 44141 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 18:26:05,362 INFO L93 Difference]: Finished difference Result 18102 states and 77937 transitions. [2025-04-13 18:26:05,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 18:26:05,362 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-04-13 18:26:05,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 18:26:05,446 INFO L225 Difference]: With dead ends: 18102 [2025-04-13 18:26:05,446 INFO L226 Difference]: Without dead ends: 16950 [2025-04-13 18:26:05,454 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 18:26:05,454 INFO L437 NwaCegarLoop]: 24 mSDtfsCounter, 111 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 18:26:05,454 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 55 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 18:26:05,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16950 states. [2025-04-13 18:26:05,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16950 to 11730. [2025-04-13 18:26:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11730 states, 11729 states have (on average 4.2966152272145965) internal successors, (50395), 11729 states have internal predecessors, (50395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:05,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11730 states to 11730 states and 50395 transitions. [2025-04-13 18:26:06,010 INFO L79 Accepts]: Start accepts. Automaton has 11730 states and 50395 transitions. Word has length 43 [2025-04-13 18:26:06,010 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 18:26:06,010 INFO L485 AbstractCegarLoop]: Abstraction has 11730 states and 50395 transitions. [2025-04-13 18:26:06,010 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 18:26:06,010 INFO L278 IsEmpty]: Start isEmpty. Operand 11730 states and 50395 transitions. [2025-04-13 18:26:06,032 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 18:26:06,032 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 18:26:06,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:06,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 18:26:06,032 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 18:26:06,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 18:26:06,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1794917686, now seen corresponding path program 2 times [2025-04-13 18:26:06,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 18:26:06,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831710350] [2025-04-13 18:26:06,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 18:26:06,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 18:26:06,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 18:26:06,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:26:06,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 18:26:06,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 18:26:06,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 18:26:06,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 18:26:06,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 18:26:06,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 18:26:06,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 18:26:06,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 18:26:06,158 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 18:26:06,159 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 18:26:06,160 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 18:26:06,160 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 18:26:06,160 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 18:26:06,160 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 18:26:06,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 18:26:06,162 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 18:26:06,263 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 18:26:06,263 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 18:26:06,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:26:06 BasicIcfg [2025-04-13 18:26:06,270 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 18:26:06,270 INFO L158 Benchmark]: Toolchain (without parser) took 17138.40ms. Allocated memory was 142.6MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 100.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2025-04-13 18:26:06,270 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 18:26:06,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.66ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 83.9MB in the end (delta: 16.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 18:26:06,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.88ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 81.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:26:06,270 INFO L158 Benchmark]: Boogie Preprocessor took 63.73ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 78.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 18:26:06,271 INFO L158 Benchmark]: RCFGBuilder took 810.36ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 33.4MB in the end (delta: 44.2MB). Peak memory consumption was 61.7MB. Max. memory is 8.0GB. [2025-04-13 18:26:06,271 INFO L158 Benchmark]: TraceAbstraction took 15954.22ms. Allocated memory was 142.6MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 32.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2025-04-13 18:26:06,271 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.16ms. Allocated memory is still 167.8MB. Free memory is still 97.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 258.66ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 83.9MB in the end (delta: 16.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.88ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 81.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.73ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 78.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 810.36ms. Allocated memory is still 142.6MB. Free memory was 77.6MB in the beginning and 33.4MB in the end (delta: 44.2MB). Peak memory consumption was 61.7MB. Max. memory is 8.0GB. * TraceAbstraction took 15954.22ms. Allocated memory was 142.6MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 32.7MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 155]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int *q1, *q2, *f; [L42] 0 int q1_front, q1_back, q2_front, q2_back, i, j, n1, n2, N, total; [L129] 0 pthread_t t1, t2, t3, t4; [L131] 0 N = __VERIFIER_nondet_int() [L132] 0 n1 = __VERIFIER_nondet_int() [L133] 0 n2 = __VERIFIER_nondet_int() [L134] 0 q1_front = __VERIFIER_nondet_int() [L135] 0 q1_back = q1_front [L136] 0 q2_front = __VERIFIER_nondet_int() [L137] 0 q2_back = q2_front [L138] CALL, EXPR 0 create_fresh_int_array(n1) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \at(size, Pre)=1, arr={-2:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \at(size, Pre)=1, arr={-2:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n1) [L138] 0 q1 = create_fresh_int_array(n1) [L139] CALL, EXPR 0 create_fresh_int_array(n2) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \at(size, Pre)=1, arr={-3:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \at(size, Pre)=1, arr={-3:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L139] RET, EXPR 0 create_fresh_int_array(n2) [L139] 0 q2 = create_fresh_int_array(n2) [L140] CALL, EXPR 0 create_fresh_int_array(N) [L161] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size >= 0) [L162] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L162] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L164] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L165] 0 int i = 0; VAL [N=1, \at(size, Pre)=1, arr={-5:0}, f={0:0}, i=0, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND TRUE 0 i < size [L166] 0 arr[i] = __VERIFIER_nondet_int() [L165] 0 i++ VAL [N=1, \at(size, Pre)=1, arr={-5:0}, f={0:0}, i=0, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, size=1, total=0] [L165] COND FALSE 0 !(i < size) [L168] 0 return arr; [L140] RET, EXPR 0 create_fresh_int_array(N) [L140] 0 f = create_fresh_int_array(N) [L142] CALL 0 assume_abort_if_not(N >= 0) [L38] COND FALSE 0 !(!cond) [L142] RET 0 assume_abort_if_not(N >= 0) [L145] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, total=0] [L49] 1 _Bool cond = i < N; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [N=1, f={-5:0}, i=0, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L38] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1) [L54] EXPR 1 q1[q1_back] [L54] EXPR 1 f[i] [L54] CALL 1 assume_abort_if_not(q1[q1_back] == f[i]) [L38] COND FALSE 1 !(!cond) [L54] RET 1 assume_abort_if_not(q1[q1_back] == f[i]) [L55] CALL 1 assume_abort_if_not(q1_back < 2147483647) [L38] COND FALSE 1 !(!cond) [L55] RET 1 assume_abort_if_not(q1_back < 2147483647) [L56] 1 i++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L146] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [N=1, f={-5:0}, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=0, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, total=0] [L59] 1 q1_back++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L62] 1 cond = i < N VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L66] 1 return 0; [L71] 2 _Bool cond = j < N; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L73] COND TRUE 2 \read(cond) VAL [N=1, f={-5:0}, i=1, j=0, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L75] CALL 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L38] COND FALSE 2 !(!cond) [L75] RET 2 assume_abort_if_not(q2_back >= 0 && q2_back < n2) [L76] EXPR 2 f[j] [L76] CALL 2 assume_abort_if_not(f[j] > -2147483648) [L38] COND FALSE 2 !(!cond) [L76] RET 2 assume_abort_if_not(f[j] > -2147483648) [L77] EXPR 2 q2[q2_back] [L77] EXPR 2 f[j] [L77] CALL 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L38] COND FALSE 2 !(!cond) [L77] RET 2 assume_abort_if_not(q2[q2_back] == -f[j]) [L78] CALL 2 assume_abort_if_not(q2_back < 2147483647) [L38] COND FALSE 2 !(!cond) [L78] RET 2 assume_abort_if_not(q2_back < 2147483647) [L79] 2 j++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L147] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, t3=1, total=0] [L94] 3 _Bool cond = i < N || q1_front < q1_back; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L96] COND TRUE 3 \read(cond) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=0, q2={-3:0}, q2_back=0, q2_front=0, total=0] [L98] CALL 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L38] COND FALSE 3 !(!cond) [L98] RET 3 assume_abort_if_not(q1_front < q1_back && q1_front >= 0 && q1_front < n1) [L99] EXPR 3 q1[q1_front] [L99] CALL, EXPR 3 plus(total, q1[q1_front]) [L172] CALL 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L38] COND FALSE 3 !(!cond) [L172] RET 3 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L173] CALL 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 3 !(!cond) [L173] RET 3 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L174] 3 return a + b; [L99] RET, EXPR 3 plus(total, q1[q1_front]) [L99] 3 total = plus(total, q1[q1_front]) [L100] 3 q1_front++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=0, q2_front=0, total=6] [L103] 3 cond = i < N || q1_front < q1_back VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=0, q2_front=0, total=6] [L96] COND FALSE 3 !(\read(cond)) [L107] 3 return 0; [L148] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=6] [L149] FCALL, JOIN 1 pthread_join(t1, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=0, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=6] [L112] 4 _Bool cond = j < N || q2_front < q2_back; VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=0, q2_front=0, total=6] [L114] COND FALSE 4 !(\read(cond)) [L125] 4 return 0; [L82] 2 q2_back++ VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, total=6] [L85] 2 cond = j < N VAL [N=1, \at(_argptr, Pre)={0:0}, _argptr={0:0}, cond=0, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, total=6] [L73] COND FALSE 2 !(\read(cond)) [L89] 2 return 0; [L150] FCALL, JOIN 2 pthread_join(t2, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=6] [L151] FCALL, JOIN 3 pthread_join(t3, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=6] [L152] FCALL, JOIN 4 pthread_join(t4, 0) VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=6] [L154] CALL 0 assume_abort_if_not(total != 0) [L38] COND FALSE 0 !(!cond) [L154] RET 0 assume_abort_if_not(total != 0) [L155] 0 reach_error() VAL [N=1, f={-5:0}, i=1, j=1, n1=1, n2=1, q1={-2:0}, q1_back=1, q1_front=1, q2={-3:0}, q2_back=1, q2_front=0, t1=-1, t2=0, t3=1, t4=2, total=6] - UnprovableResult [Line: 145]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 148]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 147]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 146]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 75 locations, 85 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 593 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 593 mSDsluCounter, 511 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 320 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1543 IncrementalHoareTripleChecker+Invalid, 1549 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 191 mSDtfsCounter, 1543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13066occurred in iteration=7, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 20881 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 1228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 21/21 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 18:26:06,284 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 0 Received shutdown request...