./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/test23-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/test23-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4c2b7377d2b430a15e16457512411598a883b6588c528bba211e64f887de4d8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:24:39,994 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:24:40,049 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:24:40,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:24:40,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:24:40,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:24:40,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:24:40,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:24:40,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:24:40,070 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:24:40,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:24:40,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:24:40,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:24:40,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:24:40,071 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:24:40,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:24:40,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:24:40,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:24:40,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:24:40,072 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:24:40,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:24:40,072 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:24:40,072 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:24:40,072 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:24:40,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:24:40,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:24:40,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:24:40,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4c2b7377d2b430a15e16457512411598a883b6588c528bba211e64f887de4d8e [2025-03-08 04:24:40,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:24:40,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:24:40,294 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:24:40,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:24:40,295 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:24:40,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/test23-1.c [2025-03-08 04:24:41,412 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2281fa3d7/1a45be82e14b46199ec0e2435c5f7b23/FLAG5ab27daf3 [2025-03-08 04:24:41,609 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:24:41,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-1.c [2025-03-08 04:24:41,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2281fa3d7/1a45be82e14b46199ec0e2435c5f7b23/FLAG5ab27daf3 [2025-03-08 04:24:41,981 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2281fa3d7/1a45be82e14b46199ec0e2435c5f7b23 [2025-03-08 04:24:41,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:24:41,984 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:24:41,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:24:41,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:24:41,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:24:41,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:24:41" (1/1) ... [2025-03-08 04:24:41,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3df4d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:41, skipping insertion in model container [2025-03-08 04:24:41,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:24:41" (1/1) ... [2025-03-08 04:24:41,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:24:42,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-1.c[1075,1088] [2025-03-08 04:24:42,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:24:42,115 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:24:42,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/test23-1.c[1075,1088] [2025-03-08 04:24:42,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:24:42,139 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:24:42,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42 WrapperNode [2025-03-08 04:24:42,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:24:42,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:24:42,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:24:42,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:24:42,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,155 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,172 INFO L138 Inliner]: procedures = 16, calls = 57, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2025-03-08 04:24:42,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:24:42,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:24:42,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:24:42,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:24:42,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,197 INFO L175 MemorySlicer]: Split 46 memory accesses to 2 slices as follows [2, 44]. 96 percent of accesses are in the largest equivalence class. The 38 initializations are split as follows [2, 36]. The 5 writes are split as follows [0, 5]. [2025-03-08 04:24:42,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,204 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:24:42,217 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:24:42,217 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:24:42,217 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:24:42,218 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (1/1) ... [2025-03-08 04:24:42,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:24:42,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:42,242 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-03-08 04:24:42,244 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-03-08 04:24:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:24:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:24:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:24:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:24:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:24:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2025-03-08 04:24:42,258 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2025-03-08 04:24:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:24:42,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:24:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:24:42,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:24:42,314 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:24:42,315 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:24:42,354 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L25: havoc #t~nondet8; [2025-03-08 04:24:42,475 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: havoc check_#t~mem9#1; [2025-03-08 04:24:42,483 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-08 04:24:42,483 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:24:42,490 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:24:42,491 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:24:42,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:24:42 BoogieIcfgContainer [2025-03-08 04:24:42,492 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:24:42,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:24:42,495 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:24:42,499 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:24:42,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:24:41" (1/3) ... [2025-03-08 04:24:42,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23fa5237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:24:42, skipping insertion in model container [2025-03-08 04:24:42,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:24:42" (2/3) ... [2025-03-08 04:24:42,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23fa5237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:24:42, skipping insertion in model container [2025-03-08 04:24:42,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:24:42" (3/3) ... [2025-03-08 04:24:42,500 INFO L128 eAbstractionObserver]: Analyzing ICFG test23-1.c [2025-03-08 04:24:42,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:24:42,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test23-1.c that has 2 procedures, 22 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 04:24:42,547 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:24:42,556 INFO L333 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=PETRI_NET, 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;@5106927a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:24:42,556 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:24:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:24:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 04:24:42,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:42,564 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:42,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:42,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:42,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1516880941, now seen corresponding path program 1 times [2025-03-08 04:24:42,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:42,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527503568] [2025-03-08 04:24:42,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:42,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:42,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 04:24:42,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 04:24:42,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:42,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:24:42,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:42,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527503568] [2025-03-08 04:24:42,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527503568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:24:42,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:24:42,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 04:24:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400320431] [2025-03-08 04:24:42,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:24:42,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 04:24:42,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:42,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 04:24:42,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:24:42,773 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:24:42,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:42,787 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-08 04:24:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 04:24:42,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-03-08 04:24:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:42,795 INFO L225 Difference]: With dead ends: 31 [2025-03-08 04:24:42,796 INFO L226 Difference]: Without dead ends: 18 [2025-03-08 04:24:42,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 04:24:42,803 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:42,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:24:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-08 04:24:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-08 04:24:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:24:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-03-08 04:24:42,827 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 19 [2025-03-08 04:24:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:42,828 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-03-08 04:24:42,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:24:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-03-08 04:24:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 04:24:42,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:42,829 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:42,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:24:42,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:42,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash 195564914, now seen corresponding path program 1 times [2025-03-08 04:24:42,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:42,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660032585] [2025-03-08 04:24:42,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:42,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:24:42,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:24:42,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:42,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:24:44,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:44,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660032585] [2025-03-08 04:24:44,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660032585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:44,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490082581] [2025-03-08 04:24:44,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:44,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:44,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:44,432 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-03-08 04:24:44,434 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-03-08 04:24:44,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 04:24:44,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 04:24:44,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:44,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:44,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 04:24:44,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:44,602 INFO L378 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 39 treesize of output 1 [2025-03-08 04:24:44,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:24:44,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2025-03-08 04:24:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:24:44,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 04:24:44,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490082581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:24:44,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 04:24:44,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-08 04:24:44,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019503471] [2025-03-08 04:24:44,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:24:44,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 04:24:44,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:44,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 04:24:44,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 04:24:44,684 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:24:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:44,729 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-03-08 04:24:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 04:24:44,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-08 04:24:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:44,731 INFO L225 Difference]: With dead ends: 25 [2025-03-08 04:24:44,731 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 04:24:44,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:24:44,731 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:44,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 40 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:24:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 04:24:44,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 04:24:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:24:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-03-08 04:24:44,737 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 20 [2025-03-08 04:24:44,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:44,738 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-03-08 04:24:44,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 04:24:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-03-08 04:24:44,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 04:24:44,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:44,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:44,747 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-03-08 04:24:44,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:44,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:44,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:44,946 INFO L85 PathProgramCache]: Analyzing trace with hash -4301327, now seen corresponding path program 1 times [2025-03-08 04:24:44,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:44,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113274922] [2025-03-08 04:24:44,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:44,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:44,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:24:45,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:24:45,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:45,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:46,428 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:24:46,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:46,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113274922] [2025-03-08 04:24:46,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113274922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:46,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763473481] [2025-03-08 04:24:46,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:24:46,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:46,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:46,430 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-03-08 04:24:46,432 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-03-08 04:24:46,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:24:46,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:24:46,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:46,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:46,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 04:24:46,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:46,523 INFO L378 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 39 treesize of output 1 [2025-03-08 04:24:46,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:24:46,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2025-03-08 04:24:46,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:24:46,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:46,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:24:46,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763473481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:46,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 21 [2025-03-08 04:24:46,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26526003] [2025-03-08 04:24:46,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:46,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 04:24:46,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:46,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 04:24:46,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2025-03-08 04:24:46,728 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 21 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:24:47,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:47,120 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-03-08 04:24:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 04:24:47,120 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 22 [2025-03-08 04:24:47,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:47,121 INFO L225 Difference]: With dead ends: 31 [2025-03-08 04:24:47,121 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 04:24:47,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2025-03-08 04:24:47,122 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:47,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 04:24:47,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 04:24:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 04:24:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:24:47,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2025-03-08 04:24:47,126 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2025-03-08 04:24:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:47,126 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2025-03-08 04:24:47,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:24:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2025-03-08 04:24:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 04:24:47,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:47,127 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:47,133 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-03-08 04:24:47,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 04:24:47,327 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:47,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1217143022, now seen corresponding path program 2 times [2025-03-08 04:24:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:47,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657739477] [2025-03-08 04:24:47,328 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:24:47,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:47,338 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 04:24:47,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:24:47,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:24:47,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:24:49,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:49,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657739477] [2025-03-08 04:24:49,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657739477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:49,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812116502] [2025-03-08 04:24:49,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:24:49,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:49,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:49,112 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-03-08 04:24:49,115 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-03-08 04:24:49,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-08 04:24:49,184 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 04:24:49,184 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:24:49,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:49,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 04:24:49,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:49,201 INFO L378 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 39 treesize of output 1 [2025-03-08 04:24:49,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:24:49,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 12 [2025-03-08 04:24:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:24:49,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:24:49,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812116502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:49,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:49,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8, 8] total 29 [2025-03-08 04:24:49,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737692796] [2025-03-08 04:24:49,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:49,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 04:24:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:49,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 04:24:49,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=705, Unknown=0, NotChecked=0, Total=812 [2025-03-08 04:24:49,578 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:24:50,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:50,588 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-03-08 04:24:50,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 04:24:50,589 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-03-08 04:24:50,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:50,589 INFO L225 Difference]: With dead ends: 43 [2025-03-08 04:24:50,589 INFO L226 Difference]: Without dead ends: 38 [2025-03-08 04:24:50,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=500, Invalid=2152, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 04:24:50,591 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:50,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 128 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:24:50,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-08 04:24:50,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-08 04:24:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:24:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2025-03-08 04:24:50,595 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 28 [2025-03-08 04:24:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:50,596 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2025-03-08 04:24:50,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 28 states have internal predecessors, (54), 3 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:24:50,596 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2025-03-08 04:24:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-08 04:24:50,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:50,597 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:50,604 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-03-08 04:24:50,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:50,797 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:50,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1136730536, now seen corresponding path program 3 times [2025-03-08 04:24:50,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:50,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434933150] [2025-03-08 04:24:50,798 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:24:50,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:50,806 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 11 equivalence classes. [2025-03-08 04:24:50,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:24:50,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-08 04:24:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:24:53,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:24:53,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434933150] [2025-03-08 04:24:53,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434933150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:24:53,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906840164] [2025-03-08 04:24:53,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 04:24:53,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:53,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:24:53,235 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-03-08 04:24:53,237 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-03-08 04:24:53,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 11 equivalence classes. [2025-03-08 04:24:53,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 40 of 40 statements. [2025-03-08 04:24:53,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-08 04:24:53,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:24:53,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 04:24:53,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:24:53,367 INFO L378 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 39 treesize of output 1 [2025-03-08 04:24:53,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:24:53,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 10 [2025-03-08 04:24:53,800 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:24:53,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:24:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 04:24:54,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906840164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:24:54,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:24:54,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 14] total 32 [2025-03-08 04:24:54,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698590296] [2025-03-08 04:24:54,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:24:54,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 04:24:54,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:24:54,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 04:24:54,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2025-03-08 04:24:54,191 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:24:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:24:55,857 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2025-03-08 04:24:55,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 04:24:55,858 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2025-03-08 04:24:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:24:55,858 INFO L225 Difference]: With dead ends: 45 [2025-03-08 04:24:55,858 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 04:24:55,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 60 SyntacticMatches, 12 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=617, Invalid=2575, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 04:24:55,860 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:24:55,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 109 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 04:24:55,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 04:24:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 04:24:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:24:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2025-03-08 04:24:55,866 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 40 [2025-03-08 04:24:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:24:55,866 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2025-03-08 04:24:55,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 30 states have internal predecessors, (65), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 04:24:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2025-03-08 04:24:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 04:24:55,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:24:55,867 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:24:55,874 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-03-08 04:24:56,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:24:56,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:24:56,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:24:56,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1782238041, now seen corresponding path program 4 times [2025-03-08 04:24:56,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:24:56,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70699376] [2025-03-08 04:24:56,069 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 04:24:56,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:24:56,079 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-08 04:24:56,088 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 04:24:56,088 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 04:24:56,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 04:24:56,088 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 04:24:56,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 04:24:56,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 04:24:56,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:24:56,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 04:24:56,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 04:24:56,118 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 04:24:56,119 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:24:56,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 04:24:56,122 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2025-03-08 04:24:56,157 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:24:56,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:24:56 BoogieIcfgContainer [2025-03-08 04:24:56,161 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:24:56,162 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:24:56,162 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:24:56,162 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:24:56,163 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:24:42" (3/4) ... [2025-03-08 04:24:56,163 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 04:24:56,203 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 35. [2025-03-08 04:24:56,262 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:24:56,266 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:24:56,266 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:24:56,266 INFO L158 Benchmark]: Toolchain (without parser) took 14282.74ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 124.5MB in the beginning and 457.0MB in the end (delta: -332.5MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2025-03-08 04:24:56,267 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:24:56,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.38ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 112.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:24:56,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.52ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:24:56,267 INFO L158 Benchmark]: Boogie Preprocessor took 38.11ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:24:56,267 INFO L158 Benchmark]: IcfgBuilder took 275.88ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 94.6MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:24:56,267 INFO L158 Benchmark]: TraceAbstraction took 13666.93ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 93.9MB in the beginning and 465.4MB in the end (delta: -371.5MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2025-03-08 04:24:56,267 INFO L158 Benchmark]: Witness Printer took 104.17ms. Allocated memory is still 570.4MB. Free memory was 465.4MB in the beginning and 457.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:24:56,268 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.24ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.38ms. Allocated memory is still 167.8MB. Free memory was 124.5MB in the beginning and 112.8MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.52ms. Allocated memory is still 167.8MB. Free memory was 112.8MB in the beginning and 111.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.11ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 109.1MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 275.88ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 94.6MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13666.93ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 93.9MB in the beginning and 465.4MB in the end (delta: -371.5MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Witness Printer took 104.17ms. Allocated memory is still 570.4MB. Free memory was 465.4MB in the beginning and 457.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 52]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; [L12] struct dummy d1, d2; VAL [d1={4:0}, d2={5:0}] [L35] CALL init() [L16] d1.a = __VERIFIER_nondet_int() [L17] d1.b = __VERIFIER_nondet_int() [L19] d2.a = __VERIFIER_nondet_int() [L20] d2.b = __VERIFIER_nondet_int() [L35] RET init() [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L36] CALL, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}] [L25] return (__VERIFIER_nondet_bool() ? &d1 : &d2); [L36] RET, EXPR get_dummy() VAL [d1={4:0}, d2={5:0}, pd1={4:0}] [L36] struct dummy *pd1 = get_dummy(), *pd2 = get_dummy(); [L37] int i = __VERIFIER_nondet_int(); [L38] COND TRUE pd1 != 0 && pd1 == pd2 && i >= 0 && i < 10 [L39] pd2->array[i] = i [L40] int *pa = &pd1->array[i]; [L41] EXPR pd2->array[i] [L41] i = pd2->array[i] - 10 [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-9, pa={4:8}, pd2={4:0}] [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-8, pa={4:8}, pd2={4:0}] [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-7, pa={4:8}, pd2={4:0}] [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-6, pa={4:8}, pd2={4:0}] [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-5, pa={4:8}, pd2={4:0}] [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-4, pa={4:8}, pd2={4:0}] [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-3, pa={4:8}, pd2={4:0}] [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-2, pa={4:8}, pd2={4:0}] [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=-1, pa={4:8}, pd2={4:0}] [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=0, pa={4:8}, pd2={4:0}] [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND TRUE i <= *pa [L43] ++i VAL [d1={4:0}, d2={5:0}, i=1, pa={4:8}, pd2={4:0}] [L42] COND TRUE i <= *pa [L42] EXPR \read(*pa) VAL [d1={4:0}, d2={5:0}] [L42] COND FALSE !(i <= *pa) [L45] CALL, EXPR check(pd2, i) [L30] EXPR s1->array[i] [L30] return s1->array[i] == i; [L45] RET, EXPR check(pd2, i) [L45] COND TRUE !check(pd2, i) [L52] reach_error() VAL [d1={4:0}, d2={5:0}, pa={4:8}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 28 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 65 mSDsluCounter, 407 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 332 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 633 IncrementalHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 75 mSDtfsCounter, 633 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 170 SyntacticMatches, 12 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 973 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=5, InterpolantAutomatonStates: 77, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 317 ConstructedInterpolants, 0 QuantifiedInterpolants, 4852 SizeOfPredicates, 35 NumberOfNonLiveVariables, 899 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 30/432 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-08 04:24:56,284 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE