/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:53:51,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:53:51,177 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:53:51,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:53:51,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:53:51,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:53:51,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:53:51,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:53:51,207 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:53:51,207 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:53:51,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:53:51,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:53:51,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:53:51,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:53:51,207 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:53:51,207 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:53:51,207 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:53:51,207 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:53:51,208 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:53:51,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:53:51,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:53:51,209 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:53:51,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:53:51,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:53:51,209 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:53:51,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:53:51,209 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:53:51,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:53:51,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:53:51,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:53:51,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:53:51,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:53:51,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:53:51,209 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:53:51,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:53:51,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:53:51,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:53:51,429 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:53:51,430 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:53:51,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2025-04-13 17:53:52,767 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad7aa9b6/34ae98d82bb54a7885418430a2e47361/FLAGd29dd5821 [2025-04-13 17:53:52,946 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:53:52,946 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2025-04-13 17:53:52,953 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad7aa9b6/34ae98d82bb54a7885418430a2e47361/FLAGd29dd5821 [2025-04-13 17:53:53,818 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ad7aa9b6/34ae98d82bb54a7885418430a2e47361 [2025-04-13 17:53:53,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:53:53,821 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:53:53,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:53:53,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:53:53,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:53:53,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:53:53" (1/1) ... [2025-04-13 17:53:53,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fab61e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:53, skipping insertion in model container [2025-04-13 17:53:53,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:53:53" (1/1) ... [2025-04-13 17:53:53,838 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:53:53,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2553,2566] [2025-04-13 17:53:53,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:53:53,983 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:53:54,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2553,2566] [2025-04-13 17:53:54,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:53:54,034 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:53:54,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54 WrapperNode [2025-04-13 17:53:54,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:53:54,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:53:54,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:53:54,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:53:54,041 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:53:54" (1/1) ... [2025-04-13 17:53:54,046 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:53:54" (1/1) ... [2025-04-13 17:53:54,070 INFO L138 Inliner]: procedures = 22, calls = 15, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 153 [2025-04-13 17:53:54,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:53:54,071 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:53:54,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:53:54,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:53:54,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (1/1) ... [2025-04-13 17:53:54,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (1/1) ... [2025-04-13 17:53:54,084 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (1/1) ... [2025-04-13 17:53:54,097 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 17:53:54,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (1/1) ... [2025-04-13 17:53:54,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (1/1) ... [2025-04-13 17:53:54,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (1/1) ... [2025-04-13 17:53:54,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (1/1) ... [2025-04-13 17:53:54,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (1/1) ... [2025-04-13 17:53:54,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (1/1) ... [2025-04-13 17:53:54,103 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (1/1) ... [2025-04-13 17:53:54,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:53:54,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:53:54,110 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:53:54,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:53:54,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (1/1) ... [2025-04-13 17:53:54,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:53:54,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:53:54,135 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:53:54,137 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:53:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:53:54,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 17:53:54,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 17:53:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 17:53:54,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 17:53:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 17:53:54,156 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 17:53:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:53:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:53:54,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:53:54,157 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:53:54,234 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:53:54,235 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:53:54,505 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:53:54,505 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:53:54,506 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:53:54,775 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:53:54,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:53:54 BoogieIcfgContainer [2025-04-13 17:53:54,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:53:54,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:53:54,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:53:54,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:53:54,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:53:53" (1/3) ... [2025-04-13 17:53:54,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ecd3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:53:54, skipping insertion in model container [2025-04-13 17:53:54,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:53:54" (2/3) ... [2025-04-13 17:53:54,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ecd3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:53:54, skipping insertion in model container [2025-04-13 17:53:54,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:53:54" (3/3) ... [2025-04-13 17:53:54,783 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2025-04-13 17:53:54,794 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:53:54,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-simpl-str-trans.wvr.c that has 4 procedures, 19 locations, 15 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-13 17:53:54,796 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:53:54,837 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 17:53:54,856 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 18 transitions, 57 flow [2025-04-13 17:53:54,866 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 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:53:54,884 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:53:54,894 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;@77638a4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:53:54,894 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 17:53:54,896 INFO L278 IsEmpty]: Start isEmpty. Operand has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 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:53:54,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:53:54,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:54,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:53:54,901 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:53:54,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash 546411504, now seen corresponding path program 1 times [2025-04-13 17:53:54,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:54,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854670148] [2025-04-13 17:53:54,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:53:54,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:54,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:53:55,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:53:55,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:53:55,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:55,790 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:53:55,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:55,790 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854670148] [2025-04-13 17:53:55,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854670148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:53:55,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:53:55,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:53:55,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376278876] [2025-04-13 17:53:55,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:53:55,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:53:55,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:55,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:53:55,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:53:55,810 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:55,999 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2025-04-13 17:53:55,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:53:56,000 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:56,001 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:56,007 INFO L225 Difference]: With dead ends: 53 [2025-04-13 17:53:56,007 INFO L226 Difference]: Without dead ends: 44 [2025-04-13 17:53:56,010 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:53:56,011 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:56,012 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:53:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-04-13 17:53:56,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-04-13 17:53:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 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:53:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 67 transitions. [2025-04-13 17:53:56,036 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 67 transitions. Word has length 14 [2025-04-13 17:53:56,036 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:56,037 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 67 transitions. [2025-04-13 17:53:56,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:56,037 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 67 transitions. [2025-04-13 17:53:56,037 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:53:56,037 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:56,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:53:56,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:53:56,038 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:53:56,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:56,038 INFO L85 PathProgramCache]: Analyzing trace with hash -233037282, now seen corresponding path program 2 times [2025-04-13 17:53:56,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:56,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259108443] [2025-04-13 17:53:56,038 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:53:56,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:56,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:53:56,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:53:56,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:53:56,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:56,377 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:53:56,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:56,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259108443] [2025-04-13 17:53:56,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259108443] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:53:56,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:53:56,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:53:56,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252182670] [2025-04-13 17:53:56,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:53:56,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:53:56,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:56,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:53:56,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:53:56,379 INFO L87 Difference]: Start difference. First operand 38 states and 67 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:56,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:56,501 INFO L93 Difference]: Finished difference Result 52 states and 80 transitions. [2025-04-13 17:53:56,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:53:56,501 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:56,501 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:56,502 INFO L225 Difference]: With dead ends: 52 [2025-04-13 17:53:56,502 INFO L226 Difference]: Without dead ends: 42 [2025-04-13 17:53:56,502 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:53:56,503 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:56,503 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:53:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-04-13 17:53:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2025-04-13 17:53:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 35 states have internal predecessors, (62), 0 states have call successors, (0), 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:53:56,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2025-04-13 17:53:56,509 INFO L79 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 14 [2025-04-13 17:53:56,509 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:56,509 INFO L485 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2025-04-13 17:53:56,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:56,509 INFO L278 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2025-04-13 17:53:56,510 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:53:56,510 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:56,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:53:56,510 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 17:53:56,510 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:53:56,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:56,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1971342132, now seen corresponding path program 3 times [2025-04-13 17:53:56,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:56,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601828769] [2025-04-13 17:53:56,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:53:56,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:56,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:53:56,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:53:56,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:53:56,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:56,822 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:53:56,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:56,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601828769] [2025-04-13 17:53:56,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601828769] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:53:56,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:53:56,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:53:56,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825766505] [2025-04-13 17:53:56,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:53:56,823 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:53:56,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:56,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:53:56,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:53:56,823 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:56,935 INFO L93 Difference]: Finished difference Result 48 states and 72 transitions. [2025-04-13 17:53:56,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:53:56,935 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:56,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:56,935 INFO L225 Difference]: With dead ends: 48 [2025-04-13 17:53:56,935 INFO L226 Difference]: Without dead ends: 39 [2025-04-13 17:53:56,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:53:56,936 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:56,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:53:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-04-13 17:53:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2025-04-13 17:53:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 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:53:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 54 transitions. [2025-04-13 17:53:56,942 INFO L79 Accepts]: Start accepts. Automaton has 33 states and 54 transitions. Word has length 14 [2025-04-13 17:53:56,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:56,942 INFO L485 AbstractCegarLoop]: Abstraction has 33 states and 54 transitions. [2025-04-13 17:53:56,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:56,942 INFO L278 IsEmpty]: Start isEmpty. Operand 33 states and 54 transitions. [2025-04-13 17:53:56,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:53:56,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:56,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:53:56,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:53:56,944 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:53:56,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1778296452, now seen corresponding path program 4 times [2025-04-13 17:53:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:56,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670429319] [2025-04-13 17:53:56,944 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:53:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:56,953 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-04-13 17:53:56,962 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:53:56,962 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 17:53:56,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:57,226 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:53:57,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:57,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670429319] [2025-04-13 17:53:57,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670429319] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:53:57,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:53:57,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:53:57,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222792172] [2025-04-13 17:53:57,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:53:57,227 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:53:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:57,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:53:57,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:53:57,228 INFO L87 Difference]: Start difference. First operand 33 states and 54 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:57,334 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2025-04-13 17:53:57,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:53:57,335 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:57,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:57,335 INFO L225 Difference]: With dead ends: 45 [2025-04-13 17:53:57,335 INFO L226 Difference]: Without dead ends: 26 [2025-04-13 17:53:57,335 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:53:57,336 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:57,336 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:53:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-04-13 17:53:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-04-13 17:53:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2025-04-13 17:53:57,338 INFO L79 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2025-04-13 17:53:57,338 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:57,338 INFO L485 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2025-04-13 17:53:57,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:57,338 INFO L278 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2025-04-13 17:53:57,339 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:53:57,339 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:57,339 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:53:57,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:53:57,339 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:53:57,340 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:57,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1091911812, now seen corresponding path program 5 times [2025-04-13 17:53:57,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:57,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477122968] [2025-04-13 17:53:57,340 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:53:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:57,349 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:53:57,355 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:53:57,355 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:53:57,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:57,604 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:53:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:57,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477122968] [2025-04-13 17:53:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477122968] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:53:57,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:53:57,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:53:57,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187902084] [2025-04-13 17:53:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:53:57,605 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:53:57,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:57,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:53:57,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:53:57,606 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:57,696 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-04-13 17:53:57,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:53:57,696 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:57,696 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:57,696 INFO L225 Difference]: With dead ends: 32 [2025-04-13 17:53:57,696 INFO L226 Difference]: Without dead ends: 24 [2025-04-13 17:53:57,697 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:53:57,697 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:57,697 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:53:57,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-13 17:53:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-04-13 17:53:57,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-04-13 17:53:57,699 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 14 [2025-04-13 17:53:57,699 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:57,699 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-04-13 17:53:57,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:57,699 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2025-04-13 17:53:57,701 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:53:57,701 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:57,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:53:57,701 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:53:57,702 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 17:53:57,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:57,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1147323072, now seen corresponding path program 6 times [2025-04-13 17:53:57,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:57,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234689688] [2025-04-13 17:53:57,702 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:53:57,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:57,708 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:53:57,716 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:53:57,716 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:53:57,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:57,908 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:53:57,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:57,908 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234689688] [2025-04-13 17:53:57,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234689688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:53:57,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:53:57,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 17:53:57,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129146266] [2025-04-13 17:53:57,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:53:57,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 17:53:57,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:57,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 17:53:57,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 17:53:57,909 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:58,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:58,005 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2025-04-13 17:53:58,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:53:58,005 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:58,005 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:58,006 INFO L225 Difference]: With dead ends: 24 [2025-04-13 17:53:58,006 INFO L226 Difference]: Without dead ends: 0 [2025-04-13 17:53:58,006 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:53:58,006 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:58,006 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:53:58,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-04-13 17:53:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-04-13 17:53:58,007 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:53:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-04-13 17:53:58,007 INFO L79 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2025-04-13 17:53:58,007 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:58,007 INFO L485 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-13 17:53:58,007 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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:53:58,007 INFO L278 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-04-13 17:53:58,007 INFO L284 IsEmpty]: Finished isEmpty. No accepting run. [2025-04-13 17:53:58,012 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 17:53:58,012 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 17:53:58,012 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 17:53:58,013 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 17:53:58,013 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 17:53:58,014 INFO L422 BasicCegarLoop]: Path program histogram: [6] [2025-04-13 17:53:58,016 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:53:58,016 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:53:58,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:53:58 BasicIcfg [2025-04-13 17:53:58,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:53:58,018 INFO L158 Benchmark]: Toolchain (without parser) took 4197.17ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 107.6MB in the beginning and 146.2MB in the end (delta: -38.6MB). Peak memory consumption was 118.4MB. Max. memory is 8.0GB. [2025-04-13 17:53:58,018 INFO L158 Benchmark]: CDTParser took 0.17ms. 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:53:58,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.28ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 92.7MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 17:53:58,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.95ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 90.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:53:58,019 INFO L158 Benchmark]: Boogie Preprocessor took 34.73ms. Allocated memory is still 155.2MB. Free memory was 90.1MB in the beginning and 88.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:53:58,019 INFO L158 Benchmark]: RCFGBuilder took 665.76ms. Allocated memory is still 155.2MB. Free memory was 88.5MB in the beginning and 96.8MB in the end (delta: -8.3MB). Peak memory consumption was 73.9MB. Max. memory is 8.0GB. [2025-04-13 17:53:58,019 INFO L158 Benchmark]: TraceAbstraction took 3240.43ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 96.0MB in the beginning and 146.2MB in the end (delta: -50.3MB). Peak memory consumption was 107.4MB. Max. memory is 8.0GB. [2025-04-13 17:53:58,021 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.28ms. Allocated memory is still 155.2MB. Free memory was 107.6MB in the beginning and 92.7MB in the end (delta: 14.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.95ms. Allocated memory is still 155.2MB. Free memory was 92.7MB in the beginning and 90.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.73ms. Allocated memory is still 155.2MB. Free memory was 90.1MB in the beginning and 88.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 665.76ms. Allocated memory is still 155.2MB. Free memory was 88.5MB in the beginning and 96.8MB in the end (delta: -8.3MB). Peak memory consumption was 73.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3240.43ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 96.0MB in the beginning and 146.2MB in the end (delta: -50.3MB). Peak memory consumption was 107.4MB. 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: 80]: 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 7 procedures, 28 locations, 27 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 378 IncrementalHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 378 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-13 17:53:58,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...