/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/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:26:50,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:26:50,335 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 17:26:50,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:26:50,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:26:50,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:26:50,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:26:50,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:26:50,361 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:26:50,361 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:26:50,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:26:50,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:26:50,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:26:50,362 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:26:50,362 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:26:50,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:26:50,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:26:50,363 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:26:50,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:26:50,363 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 17:26:50,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:26:50,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:26:50,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:26:50,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:26:50,601 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:26:50,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-13 17:26:51,914 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df5952780/e8dfe51d85b24e8fa41e1820624233b8/FLAG5556f491f [2025-04-13 17:26:52,171 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:26:52,172 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-13 17:26:52,185 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df5952780/e8dfe51d85b24e8fa41e1820624233b8/FLAG5556f491f [2025-04-13 17:26:52,964 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df5952780/e8dfe51d85b24e8fa41e1820624233b8 [2025-04-13 17:26:52,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:26:52,967 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:26:52,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:26:52,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:26:52,972 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:26:52,973 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:26:52" (1/1) ... [2025-04-13 17:26:52,973 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428d5b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:52, skipping insertion in model container [2025-04-13 17:26:52,973 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:26:52" (1/1) ... [2025-04-13 17:26:52,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:26:53,126 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-04-13 17:26:53,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:26:53,226 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:26:53,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_68-pfscan_protected_loop_minimal_interval_true.i[1115,1128] [2025-04-13 17:26:53,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:26:53,316 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:26:53,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53 WrapperNode [2025-04-13 17:26:53,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:26:53,318 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:26:53,319 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:26:53,319 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:26:53,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,340 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,359 INFO L138 Inliner]: procedures = 165, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 112 [2025-04-13 17:26:53,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:26:53,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:26:53,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:26:53,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:26:53,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,373 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,390 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6]. The 3 writes are split as follows [0, 3]. [2025-04-13 17:26:53,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,400 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,400 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:26:53,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:26:53,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:26:53,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:26:53,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (1/1) ... [2025-04-13 17:26:53,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:26:53,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:26:53,440 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 17:26:53,442 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 17:26:53,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:26:53,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:26:53,464 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-13 17:26:53,464 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-13 17:26:53,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:26:53,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:26:53,464 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 17:26:53,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:26:53,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:26:53,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:26:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 17:26:53,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:26:53,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:26:53,466 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 17:26:53,575 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:26:53,577 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:26:53,759 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:26:53,760 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:26:53,760 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:26:53,936 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:26:53,939 WARN L179 LargeBlockEncoding]: Complex 3:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 17:26:53,946 INFO L313 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-13 17:26:53,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:26:53 BoogieIcfgContainer [2025-04-13 17:26:53,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:26:53,948 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:26:53,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:26:53,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:26:53,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:26:52" (1/3) ... [2025-04-13 17:26:53,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b1647f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:26:53, skipping insertion in model container [2025-04-13 17:26:53,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:26:53" (2/3) ... [2025-04-13 17:26:53,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34b1647f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:26:53, skipping insertion in model container [2025-04-13 17:26:53,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:26:53" (3/3) ... [2025-04-13 17:26:53,953 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i [2025-04-13 17:26:53,963 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:26:53,964 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_68-pfscan_protected_loop_minimal_interval_true.i that has 2 procedures, 19 locations, 24 edges, 1 initial locations, 3 loop locations, and 2 error locations. [2025-04-13 17:26:53,964 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:26:54,023 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 17:26:54,047 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 22 places, 25 transitions, 54 flow [2025-04-13 17:26:54,063 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 62 states, 60 states have (on average 2.4) internal successors, (144), 61 states have internal predecessors, (144), 0 states have call successors, (0), 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 17:26:54,083 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:26:54,092 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;@4c4c832c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:26:54,092 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 17:26:54,096 INFO L278 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 2.4) internal successors, (144), 61 states have internal predecessors, (144), 0 states have call successors, (0), 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 17:26:54,099 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-13 17:26:54,099 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:54,100 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 17:26:54,100 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:26:54,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:54,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1858367974, now seen corresponding path program 1 times [2025-04-13 17:26:54,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:54,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165005013] [2025-04-13 17:26:54,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:54,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:54,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 17:26:54,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 17:26:54,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:54,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:54,441 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 17:26:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:54,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165005013] [2025-04-13 17:26:54,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165005013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:54,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:54,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:26:54,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747058137] [2025-04-13 17:26:54,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:54,448 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 17:26:54,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:54,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 17:26:54,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 17:26:54,464 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 2.4) internal successors, (144), 61 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 17:26:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:54,542 INFO L93 Difference]: Finished difference Result 112 states and 294 transitions. [2025-04-13 17:26:54,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:26:54,545 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-04-13 17:26:54,545 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:54,551 INFO L225 Difference]: With dead ends: 112 [2025-04-13 17:26:54,551 INFO L226 Difference]: Without dead ends: 53 [2025-04-13 17:26:54,554 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 17:26:54,556 INFO L437 NwaCegarLoop]: 1 mSDtfsCounter, 15 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:54,556 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:26:54,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-04-13 17:26:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2025-04-13 17:26:54,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 2.08) internal successors, (104), 50 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:54,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 104 transitions. [2025-04-13 17:26:54,584 INFO L79 Accepts]: Start accepts. Automaton has 51 states and 104 transitions. Word has length 6 [2025-04-13 17:26:54,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:54,584 INFO L485 AbstractCegarLoop]: Abstraction has 51 states and 104 transitions. [2025-04-13 17:26:54,584 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 17:26:54,584 INFO L278 IsEmpty]: Start isEmpty. Operand 51 states and 104 transitions. [2025-04-13 17:26:54,585 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 17:26:54,585 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:54,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:54,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:26:54,585 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:26:54,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:54,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1457869523, now seen corresponding path program 1 times [2025-04-13 17:26:54,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:54,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789800633] [2025-04-13 17:26:54,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:54,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:26:54,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:26:54,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:54,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:54,872 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789800633] [2025-04-13 17:26:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789800633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:54,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:26:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188497000] [2025-04-13 17:26:54,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:54,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:26:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:54,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:26:54,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:26:54,873 INFO L87 Difference]: Start difference. First operand 51 states and 104 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 17:26:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:54,987 INFO L93 Difference]: Finished difference Result 126 states and 271 transitions. [2025-04-13 17:26:54,989 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:26:54,989 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-04-13 17:26:54,989 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:54,990 INFO L225 Difference]: With dead ends: 126 [2025-04-13 17:26:54,990 INFO L226 Difference]: Without dead ends: 92 [2025-04-13 17:26:54,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:26:54,991 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 23 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:54,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:54,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-13 17:26:54,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 66. [2025-04-13 17:26:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 2.0615384615384613) internal successors, (134), 65 states have internal predecessors, (134), 0 states have call successors, (0), 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 17:26:55,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 134 transitions. [2025-04-13 17:26:55,002 INFO L79 Accepts]: Start accepts. Automaton has 66 states and 134 transitions. Word has length 9 [2025-04-13 17:26:55,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:55,002 INFO L485 AbstractCegarLoop]: Abstraction has 66 states and 134 transitions. [2025-04-13 17:26:55,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 17:26:55,003 INFO L278 IsEmpty]: Start isEmpty. Operand 66 states and 134 transitions. [2025-04-13 17:26:55,003 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 17:26:55,003 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:55,003 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:55,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:26:55,003 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:26:55,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:55,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1464125633, now seen corresponding path program 2 times [2025-04-13 17:26:55,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:55,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952106591] [2025-04-13 17:26:55,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:26:55,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:55,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:26:55,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:26:55,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:26:55,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:55,204 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 17:26:55,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:55,205 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952106591] [2025-04-13 17:26:55,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952106591] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:55,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:55,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:26:55,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939616576] [2025-04-13 17:26:55,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:55,205 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:26:55,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:55,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:26:55,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:26:55,206 INFO L87 Difference]: Start difference. First operand 66 states and 134 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 17:26:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:55,310 INFO L93 Difference]: Finished difference Result 123 states and 261 transitions. [2025-04-13 17:26:55,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:26:55,311 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-04-13 17:26:55,311 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:55,311 INFO L225 Difference]: With dead ends: 123 [2025-04-13 17:26:55,311 INFO L226 Difference]: Without dead ends: 89 [2025-04-13 17:26:55,312 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:26:55,312 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 19 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:55,312 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 12 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-13 17:26:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 72. [2025-04-13 17:26:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.056338028169014) internal successors, (146), 71 states have internal predecessors, (146), 0 states have call successors, (0), 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 17:26:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 146 transitions. [2025-04-13 17:26:55,318 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 146 transitions. Word has length 9 [2025-04-13 17:26:55,318 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:55,318 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 146 transitions. [2025-04-13 17:26:55,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 17:26:55,318 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 146 transitions. [2025-04-13 17:26:55,318 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-13 17:26:55,319 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:55,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:55,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:26:55,319 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:26:55,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1031759651, now seen corresponding path program 3 times [2025-04-13 17:26:55,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:55,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882968042] [2025-04-13 17:26:55,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:26:55,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:55,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-13 17:26:55,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 17:26:55,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:26:55,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:55,507 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 17:26:55,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:55,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882968042] [2025-04-13 17:26:55,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882968042] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:55,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:55,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:26:55,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158893556] [2025-04-13 17:26:55,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:55,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:26:55,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:55,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:26:55,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:26:55,508 INFO L87 Difference]: Start difference. First operand 72 states and 146 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 17:26:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:55,611 INFO L93 Difference]: Finished difference Result 123 states and 261 transitions. [2025-04-13 17:26:55,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:26:55,613 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-04-13 17:26:55,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:55,614 INFO L225 Difference]: With dead ends: 123 [2025-04-13 17:26:55,614 INFO L226 Difference]: Without dead ends: 89 [2025-04-13 17:26:55,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:26:55,615 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:55,615 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 11 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:55,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-13 17:26:55,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2025-04-13 17:26:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 2.0597014925373136) internal successors, (138), 67 states have internal predecessors, (138), 0 states have call successors, (0), 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 17:26:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 138 transitions. [2025-04-13 17:26:55,625 INFO L79 Accepts]: Start accepts. Automaton has 68 states and 138 transitions. Word has length 9 [2025-04-13 17:26:55,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:55,625 INFO L485 AbstractCegarLoop]: Abstraction has 68 states and 138 transitions. [2025-04-13 17:26:55,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 17:26:55,625 INFO L278 IsEmpty]: Start isEmpty. Operand 68 states and 138 transitions. [2025-04-13 17:26:55,626 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:26:55,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:55,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:55,626 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:26:55,626 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:26:55,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:55,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1595071035, now seen corresponding path program 1 times [2025-04-13 17:26:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:55,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245470181] [2025-04-13 17:26:55,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:55,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:55,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:26:55,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:26:55,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:55,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:55,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:55,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245470181] [2025-04-13 17:26:55,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245470181] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:55,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:55,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:26:55,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275854461] [2025-04-13 17:26:55,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:55,980 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:26:55,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:55,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:26:55,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:26:55,981 INFO L87 Difference]: Start difference. First operand 68 states and 138 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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 17:26:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:56,166 INFO L93 Difference]: Finished difference Result 117 states and 240 transitions. [2025-04-13 17:26:56,167 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:26:56,167 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-04-13 17:26:56,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:56,168 INFO L225 Difference]: With dead ends: 117 [2025-04-13 17:26:56,168 INFO L226 Difference]: Without dead ends: 81 [2025-04-13 17:26:56,168 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:26:56,169 INFO L437 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:56,169 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 18 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-04-13 17:26:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-04-13 17:26:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 2.0) internal successors, (154), 77 states have internal predecessors, (154), 0 states have call successors, (0), 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 17:26:56,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 154 transitions. [2025-04-13 17:26:56,176 INFO L79 Accepts]: Start accepts. Automaton has 78 states and 154 transitions. Word has length 14 [2025-04-13 17:26:56,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:56,176 INFO L485 AbstractCegarLoop]: Abstraction has 78 states and 154 transitions. [2025-04-13 17:26:56,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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 17:26:56,179 INFO L278 IsEmpty]: Start isEmpty. Operand 78 states and 154 transitions. [2025-04-13 17:26:56,180 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:26:56,180 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:56,180 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:56,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:26:56,180 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:26:56,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:56,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1091581079, now seen corresponding path program 2 times [2025-04-13 17:26:56,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:56,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628738728] [2025-04-13 17:26:56,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:26:56,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:56,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 17:26:56,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:26:56,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:26:56,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:56,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:56,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628738728] [2025-04-13 17:26:56,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628738728] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:26:56,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812823757] [2025-04-13 17:26:56,475 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:26:56,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:26:56,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:26:56,477 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:26:56,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 17:26:56,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-13 17:26:56,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:26:56,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:26:56,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:56,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 17:26:56,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:26:56,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-13 17:26:56,680 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 17:26:56,680 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 17:26:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812823757] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:56,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 17:26:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2025-04-13 17:26:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712185325] [2025-04-13 17:26:56,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:56,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:26:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:56,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:26:56,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:26:56,681 INFO L87 Difference]: Start difference. First operand 78 states and 154 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 17:26:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:56,775 INFO L93 Difference]: Finished difference Result 143 states and 290 transitions. [2025-04-13 17:26:56,777 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:26:56,777 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 14 [2025-04-13 17:26:56,777 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:56,778 INFO L225 Difference]: With dead ends: 143 [2025-04-13 17:26:56,778 INFO L226 Difference]: Without dead ends: 89 [2025-04-13 17:26:56,778 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-04-13 17:26:56,779 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:56,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 9 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-13 17:26:56,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 73. [2025-04-13 17:26:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 2.0) internal successors, (144), 72 states have internal predecessors, (144), 0 states have call successors, (0), 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 17:26:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 144 transitions. [2025-04-13 17:26:56,791 INFO L79 Accepts]: Start accepts. Automaton has 73 states and 144 transitions. Word has length 14 [2025-04-13 17:26:56,791 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:56,791 INFO L485 AbstractCegarLoop]: Abstraction has 73 states and 144 transitions. [2025-04-13 17:26:56,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 17:26:56,791 INFO L278 IsEmpty]: Start isEmpty. Operand 73 states and 144 transitions. [2025-04-13 17:26:56,791 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:26:56,791 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:56,791 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:56,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 17:26:56,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 17:26:56,992 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:26:56,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash 585234813, now seen corresponding path program 3 times [2025-04-13 17:26:56,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:56,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133579318] [2025-04-13 17:26:56,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:26:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:57,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 17:26:57,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:26:57,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:26:57,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:57,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:57,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133579318] [2025-04-13 17:26:57,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133579318] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:26:57,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787157430] [2025-04-13 17:26:57,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:26:57,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:26:57,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:26:57,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:26:57,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 17:26:57,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-04-13 17:26:57,360 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:26:57,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:26:57,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:57,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 17:26:57,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:26:57,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-13 17:26:57,445 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 17:26:57,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 17:26:57,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787157430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:57,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 17:26:57,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2025-04-13 17:26:57,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338099620] [2025-04-13 17:26:57,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:57,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:26:57,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:57,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:26:57,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:26:57,447 INFO L87 Difference]: Start difference. First operand 73 states and 144 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 17:26:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:57,560 INFO L93 Difference]: Finished difference Result 165 states and 333 transitions. [2025-04-13 17:26:57,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:26:57,561 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 14 [2025-04-13 17:26:57,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:57,562 INFO L225 Difference]: With dead ends: 165 [2025-04-13 17:26:57,562 INFO L226 Difference]: Without dead ends: 111 [2025-04-13 17:26:57,562 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:26:57,563 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 56 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:57,563 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 10 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:57,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-13 17:26:57,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2025-04-13 17:26:57,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 2.0232558139534884) internal successors, (174), 87 states have internal predecessors, (174), 0 states have call successors, (0), 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 17:26:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 174 transitions. [2025-04-13 17:26:57,571 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 174 transitions. Word has length 14 [2025-04-13 17:26:57,571 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:57,571 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 174 transitions. [2025-04-13 17:26:57,571 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 17:26:57,573 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 174 transitions. [2025-04-13 17:26:57,574 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:26:57,574 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:57,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:57,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 17:26:57,774 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-13 17:26:57,775 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:26:57,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:57,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1031924229, now seen corresponding path program 4 times [2025-04-13 17:26:57,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:57,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329448291] [2025-04-13 17:26:57,776 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:26:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:57,782 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 17:26:57,784 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 11 of 14 statements. [2025-04-13 17:26:57,784 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:26:57,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:57,845 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 17:26:57,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:57,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329448291] [2025-04-13 17:26:57,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329448291] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:26:57,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:26:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:26:57,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345047765] [2025-04-13 17:26:57,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:26:57,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:26:57,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:57,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:26:57,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:26:57,846 INFO L87 Difference]: Start difference. First operand 88 states and 174 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 17:26:57,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:57,927 INFO L93 Difference]: Finished difference Result 142 states and 276 transitions. [2025-04-13 17:26:57,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:26:57,927 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 14 [2025-04-13 17:26:57,927 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:57,928 INFO L225 Difference]: With dead ends: 142 [2025-04-13 17:26:57,928 INFO L226 Difference]: Without dead ends: 80 [2025-04-13 17:26:57,928 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:26:57,928 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 28 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:57,929 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-13 17:26:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 44. [2025-04-13 17:26:57,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 43 states have internal predecessors, (74), 0 states have call successors, (0), 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 17:26:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 74 transitions. [2025-04-13 17:26:57,932 INFO L79 Accepts]: Start accepts. Automaton has 44 states and 74 transitions. Word has length 14 [2025-04-13 17:26:57,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:57,932 INFO L485 AbstractCegarLoop]: Abstraction has 44 states and 74 transitions. [2025-04-13 17:26:57,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 17:26:57,932 INFO L278 IsEmpty]: Start isEmpty. Operand 44 states and 74 transitions. [2025-04-13 17:26:57,932 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 17:26:57,932 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:57,932 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:57,932 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:26:57,932 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:26:57,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:57,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1948037333, now seen corresponding path program 1 times [2025-04-13 17:26:57,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:57,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971741387] [2025-04-13 17:26:57,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:57,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:57,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:26:57,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:26:57,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:57,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:58,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:58,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:58,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971741387] [2025-04-13 17:26:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971741387] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:26:58,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806038704] [2025-04-13 17:26:58,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:58,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:26:58,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:26:58,139 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:26:58,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 17:26:58,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 17:26:58,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 17:26:58,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:58,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:58,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 17:26:58,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:26:58,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-13 17:26:58,273 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 17:26:58,330 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 17:26:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:58,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:26:58,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:58,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806038704] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:26:58,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:26:58,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2025-04-13 17:26:58,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529191199] [2025-04-13 17:26:58,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:26:58,470 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:26:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:58,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:26:58,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:26:58,471 INFO L87 Difference]: Start difference. First operand 44 states and 74 transitions. Second operand has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:26:58,649 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2025-04-13 17:26:58,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:26:58,649 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 17:26:58,649 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:26:58,650 INFO L225 Difference]: With dead ends: 117 [2025-04-13 17:26:58,650 INFO L226 Difference]: Without dead ends: 78 [2025-04-13 17:26:58,650 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:26:58,651 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 55 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:26:58,651 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 16 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:26:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-13 17:26:58,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2025-04-13 17:26:58,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 69 states have internal predecessors, (117), 0 states have call successors, (0), 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 17:26:58,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 117 transitions. [2025-04-13 17:26:58,658 INFO L79 Accepts]: Start accepts. Automaton has 70 states and 117 transitions. Word has length 15 [2025-04-13 17:26:58,658 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:26:58,658 INFO L485 AbstractCegarLoop]: Abstraction has 70 states and 117 transitions. [2025-04-13 17:26:58,658 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:26:58,658 INFO L278 IsEmpty]: Start isEmpty. Operand 70 states and 117 transitions. [2025-04-13 17:26:58,658 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 17:26:58,658 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:26:58,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:26:58,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 17:26:58,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:26:58,864 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting workerErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, workerErr0ASSERT_VIOLATIONERROR_FUNCTION, workerErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2025-04-13 17:26:58,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:26:58,864 INFO L85 PathProgramCache]: Analyzing trace with hash 139307506, now seen corresponding path program 1 times [2025-04-13 17:26:58,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:26:58,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719831628] [2025-04-13 17:26:58,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:58,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:26:58,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:58,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:58,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:58,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:59,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:59,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:26:59,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719831628] [2025-04-13 17:26:59,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719831628] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:26:59,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769171768] [2025-04-13 17:26:59,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:26:59,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:26:59,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:26:59,153 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 17:26:59,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 17:26:59,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 17:26:59,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 17:26:59,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:26:59,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:26:59,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-04-13 17:26:59,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:26:59,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-13 17:26:59,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 17:26:59,332 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 17:26:59,382 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-04-13 17:26:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:59,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:26:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:26:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769171768] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:26:59,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:26:59,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2025-04-13 17:26:59,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569461023] [2025-04-13 17:26:59,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:26:59,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:26:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:26:59,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:26:59,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=463, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:26:59,698 INFO L87 Difference]: Start difference. First operand 70 states and 117 transitions. Second operand has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 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 17:27:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:27:00,113 INFO L93 Difference]: Finished difference Result 281 states and 503 transitions. [2025-04-13 17:27:00,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:27:00,113 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 17:27:00,113 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:27:00,114 INFO L225 Difference]: With dead ends: 281 [2025-04-13 17:27:00,114 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 17:27:00,118 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=432, Invalid=1208, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 17:27:00,119 INFO L437 NwaCegarLoop]: 3 mSDtfsCounter, 199 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:27:00,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 25 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:27:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 17:27:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 17:27:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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 17:27:00,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 17:27:00,120 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2025-04-13 17:27:00,120 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:27:00,120 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 17:27:00,120 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.28) internal successors, (57), 25 states have internal predecessors, (57), 0 states have call successors, (0), 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 17:27:00,120 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 17:27:00,120 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 17:27:00,122 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-13 17:27:00,122 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 17:27:00,122 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2025-04-13 17:27:00,122 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2025-04-13 17:27:00,122 INFO L790 garLoopResultBuilder]: Registering result SAFE for location workerErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 17:27:00,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 17:27:00,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:27:00,325 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1] [2025-04-13 17:27:00,328 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:27:00,328 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:27:00,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:27:00 BasicIcfg [2025-04-13 17:27:00,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:27:00,330 INFO L158 Benchmark]: Toolchain (without parser) took 7362.93ms. Allocated memory was 155.2MB in the beginning and 356.5MB in the end (delta: 201.3MB). Free memory was 108.4MB in the beginning and 189.5MB in the end (delta: -81.1MB). Peak memory consumption was 121.6MB. Max. memory is 8.0GB. [2025-04-13 17:27:00,330 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:27:00,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.81ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 84.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 17:27:00,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.25ms. Allocated memory is still 155.2MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:27:00,331 INFO L158 Benchmark]: Boogie Preprocessor took 50.49ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 80.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:27:00,331 INFO L158 Benchmark]: RCFGBuilder took 535.40ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 32.7MB in the end (delta: 48.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 17:27:00,331 INFO L158 Benchmark]: TraceAbstraction took 6381.92ms. Allocated memory was 155.2MB in the beginning and 356.5MB in the end (delta: 201.3MB). Free memory was 32.0MB in the beginning and 189.5MB in the end (delta: -157.5MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 17:27:00,332 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.14ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 349.81ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 84.9MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.25ms. Allocated memory is still 155.2MB. Free memory was 84.9MB in the beginning and 82.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 50.49ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 80.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 535.40ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 32.7MB in the end (delta: 48.1MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6381.92ms. Allocated memory was 155.2MB in the beginning and 356.5MB in the end (delta: 201.3MB). Free memory was 32.0MB in the beginning and 189.5MB in the end (delta: -157.5MB). Peak memory consumption was 46.1MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 31 locations, 41 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 469 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1369 IncrementalHoareTripleChecker+Invalid, 1484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 26 mSDtfsCounter, 1369 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=7, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 152 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 185 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 203 ConstructedInterpolants, 0 QuantifiedInterpolants, 2345 SizeOfPredicates, 56 NumberOfNonLiveVariables, 701 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 16/48 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 17:27:00,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...