./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/hardware-verification-bv/btor2c-lazyMod.h_b04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:54:23,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:54:23,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:54:23,365 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:54:23,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:54:23,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:54:23,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:54:23,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:54:23,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:54:23,380 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:54:23,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:54:23,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:54:23,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:54:23,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:54:23,381 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:54:23,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:54:23,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:54:23,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:54:23,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:54:23,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:54:23,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:54:23,381 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:54:23,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:54:23,382 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:54:23,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:54:23,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:54:23,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:54:23,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:54:23,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:54:23,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:54:23,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:54:23,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:54:23,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:54:23,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:54:23,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:54:23,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:54:23,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:54:23,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:54:23,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:54:23,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:54:23,383 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e [2025-03-16 21:54:23,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:54:23,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:54:23,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:54:23,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:54:23,617 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:54:23,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2025-03-16 21:54:24,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cd16370/4f1940cd38224140b3947991eb3a60ce/FLAG7dd7352da [2025-03-16 21:54:25,022 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:54:25,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2025-03-16 21:54:25,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cd16370/4f1940cd38224140b3947991eb3a60ce/FLAG7dd7352da [2025-03-16 21:54:25,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1cd16370/4f1940cd38224140b3947991eb3a60ce [2025-03-16 21:54:25,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:54:25,053 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:54:25,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:54:25,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:54:25,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:54:25,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79da9237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25, skipping insertion in model container [2025-03-16 21:54:25,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:54:25,173 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/hardware-verification-bv/btor2c-lazyMod.h_b04.c[1245,1258] [2025-03-16 21:54:25,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:54:25,212 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:54:25,219 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/hardware-verification-bv/btor2c-lazyMod.h_b04.c[1245,1258] [2025-03-16 21:54:25,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:54:25,242 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:54:25,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25 WrapperNode [2025-03-16 21:54:25,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:54:25,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:54:25,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:54:25,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:54:25,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,278 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 215 [2025-03-16 21:54:25,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:54:25,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:54:25,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:54:25,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:54:25,288 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,312 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-16 21:54:25,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,323 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:54:25,335 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:54:25,335 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:54:25,336 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:54:25,336 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (1/1) ... [2025-03-16 21:54:25,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:54:25,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:25,364 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-16 21:54:25,366 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-16 21:54:25,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:54:25,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:54:25,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 21:54:25,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:54:25,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:54:25,450 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:54:25,452 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:54:25,834 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-03-16 21:54:25,834 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:54:25,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:54:25,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:54:25,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:25 BoogieIcfgContainer [2025-03-16 21:54:25,864 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:54:25,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:54:25,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:54:25,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:54:25,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:54:25" (1/3) ... [2025-03-16 21:54:25,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1584d9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:54:25, skipping insertion in model container [2025-03-16 21:54:25,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:25" (2/3) ... [2025-03-16 21:54:25,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1584d9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:54:25, skipping insertion in model container [2025-03-16 21:54:25,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:25" (3/3) ... [2025-03-16 21:54:25,873 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b04.c [2025-03-16 21:54:25,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:54:25,889 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b04.c that has 1 procedures, 44 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:54:25,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:54:25,943 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;@1e8135ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:54:25,944 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:54:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.5) internal successors, (63), 43 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-16 21:54:25,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:25,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:25,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:25,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:25,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1153006408, now seen corresponding path program 1 times [2025-03-16 21:54:25,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:25,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78881628] [2025-03-16 21:54:25,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:25,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:26,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-16 21:54:26,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-16 21:54:26,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:26,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:26,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:26,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78881628] [2025-03-16 21:54:26,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78881628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:26,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:26,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81659462] [2025-03-16 21:54:26,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:26,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:26,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:26,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:26,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:26,514 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.5) internal successors, (63), 43 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-03-16 21:54:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:26,576 INFO L93 Difference]: Finished difference Result 75 states and 109 transitions. [2025-03-16 21:54:26,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:26,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2025-03-16 21:54:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:26,582 INFO L225 Difference]: With dead ends: 75 [2025-03-16 21:54:26,583 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 21:54:26,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:26,586 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:26,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:54:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 21:54:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-16 21:54:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 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-03-16 21:54:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 62 transitions. [2025-03-16 21:54:26,608 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 62 transitions. Word has length 20 [2025-03-16 21:54:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:26,608 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 62 transitions. [2025-03-16 21:54:26,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-03-16 21:54:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 62 transitions. [2025-03-16 21:54:26,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-16 21:54:26,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:26,612 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:26,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:54:26,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:26,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1388139430, now seen corresponding path program 1 times [2025-03-16 21:54:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580509314] [2025-03-16 21:54:26,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:26,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-16 21:54:26,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-16 21:54:26,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:26,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:26,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:26,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580509314] [2025-03-16 21:54:26,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580509314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:26,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:26,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:26,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164491024] [2025-03-16 21:54:26,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:26,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:26,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:26,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:26,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:26,755 INFO L87 Difference]: Start difference. First operand 44 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:26,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:26,806 INFO L93 Difference]: Finished difference Result 77 states and 108 transitions. [2025-03-16 21:54:26,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:26,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-16 21:54:26,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:26,807 INFO L225 Difference]: With dead ends: 77 [2025-03-16 21:54:26,807 INFO L226 Difference]: Without dead ends: 46 [2025-03-16 21:54:26,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:26,808 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:26,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:54:26,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-16 21:54:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-16 21:54:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 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-03-16 21:54:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2025-03-16 21:54:26,814 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 21 [2025-03-16 21:54:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:26,814 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2025-03-16 21:54:26,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2025-03-16 21:54:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 21:54:26,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:26,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:26,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:54:26,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:26,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2014158595, now seen corresponding path program 1 times [2025-03-16 21:54:26,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:26,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762076163] [2025-03-16 21:54:26,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:26,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:26,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-16 21:54:26,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 21:54:26,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:26,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:27,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:27,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:27,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762076163] [2025-03-16 21:54:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762076163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:27,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:27,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773901329] [2025-03-16 21:54:27,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:27,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:27,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:27,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:27,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:27,109 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-03-16 21:54:27,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:27,158 INFO L93 Difference]: Finished difference Result 79 states and 109 transitions. [2025-03-16 21:54:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:27,159 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2025-03-16 21:54:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:27,159 INFO L225 Difference]: With dead ends: 79 [2025-03-16 21:54:27,159 INFO L226 Difference]: Without dead ends: 46 [2025-03-16 21:54:27,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:27,160 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:27,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 129 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:54:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-16 21:54:27,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-16 21:54:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2025-03-16 21:54:27,163 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 22 [2025-03-16 21:54:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:27,163 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2025-03-16 21:54:27,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-03-16 21:54:27,164 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2025-03-16 21:54:27,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 21:54:27,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:27,165 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:27,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:54:27,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:27,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash -97230485, now seen corresponding path program 1 times [2025-03-16 21:54:27,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:27,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149345467] [2025-03-16 21:54:27,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:27,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:27,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 21:54:27,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 21:54:27,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:27,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:27,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:27,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149345467] [2025-03-16 21:54:27,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149345467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:27,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:27,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:54:27,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156381793] [2025-03-16 21:54:27,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:27,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:54:27,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:27,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:54:27,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:54:27,471 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-03-16 21:54:27,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:27,600 INFO L93 Difference]: Finished difference Result 89 states and 121 transitions. [2025-03-16 21:54:27,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:54:27,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 23 [2025-03-16 21:54:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:27,601 INFO L225 Difference]: With dead ends: 89 [2025-03-16 21:54:27,601 INFO L226 Difference]: Without dead ends: 56 [2025-03-16 21:54:27,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:54:27,603 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 68 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:27,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 251 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:27,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-16 21:54:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2025-03-16 21:54:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 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-03-16 21:54:27,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2025-03-16 21:54:27,608 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 23 [2025-03-16 21:54:27,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:27,608 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2025-03-16 21:54:27,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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-03-16 21:54:27,609 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2025-03-16 21:54:27,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 21:54:27,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:27,609 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:27,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:54:27,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:27,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:27,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1686993226, now seen corresponding path program 1 times [2025-03-16 21:54:27,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:27,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314631517] [2025-03-16 21:54:27,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:27,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:27,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 21:54:27,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 21:54:27,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:27,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:28,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:28,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:28,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314631517] [2025-03-16 21:54:28,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314631517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:28,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:28,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-16 21:54:28,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858555157] [2025-03-16 21:54:28,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:28,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:54:28,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:28,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:54:28,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:28,116 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:28,270 INFO L93 Difference]: Finished difference Result 102 states and 138 transitions. [2025-03-16 21:54:28,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:54:28,271 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-16 21:54:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:28,271 INFO L225 Difference]: With dead ends: 102 [2025-03-16 21:54:28,271 INFO L226 Difference]: Without dead ends: 60 [2025-03-16 21:54:28,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:54:28,272 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 73 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:28,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 267 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:28,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-16 21:54:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2025-03-16 21:54:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 58 states have internal predecessors, (80), 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-03-16 21:54:28,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2025-03-16 21:54:28,275 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 24 [2025-03-16 21:54:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:28,276 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2025-03-16 21:54:28,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2025-03-16 21:54:28,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 21:54:28,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:28,277 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:28,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:54:28,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:28,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:28,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2064070471, now seen corresponding path program 1 times [2025-03-16 21:54:28,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:28,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137533605] [2025-03-16 21:54:28,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:28,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:28,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 21:54:28,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 21:54:28,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:28,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:28,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:28,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137533605] [2025-03-16 21:54:28,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137533605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:28,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:28,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778549411] [2025-03-16 21:54:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:28,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:28,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:28,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:28,416 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:28,506 INFO L93 Difference]: Finished difference Result 134 states and 177 transitions. [2025-03-16 21:54:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:28,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-16 21:54:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:28,507 INFO L225 Difference]: With dead ends: 134 [2025-03-16 21:54:28,507 INFO L226 Difference]: Without dead ends: 88 [2025-03-16 21:54:28,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:28,508 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 40 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:28,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 100 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:28,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-16 21:54:28,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 61. [2025-03-16 21:54:28,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 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-03-16 21:54:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2025-03-16 21:54:28,511 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 24 [2025-03-16 21:54:28,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:28,511 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2025-03-16 21:54:28,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2025-03-16 21:54:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 21:54:28,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:28,512 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:28,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:54:28,512 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:28,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:28,512 INFO L85 PathProgramCache]: Analyzing trace with hash 889224553, now seen corresponding path program 1 times [2025-03-16 21:54:28,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:28,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703482803] [2025-03-16 21:54:28,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:28,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:28,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 21:54:28,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 21:54:28,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:28,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:28,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:28,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:28,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703482803] [2025-03-16 21:54:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703482803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:28,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:28,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:54:28,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806962712] [2025-03-16 21:54:28,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:28,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:54:28,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:28,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:54:28,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:28,806 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-03-16 21:54:28,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:28,854 INFO L93 Difference]: Finished difference Result 113 states and 151 transitions. [2025-03-16 21:54:28,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:28,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 25 [2025-03-16 21:54:28,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:28,855 INFO L225 Difference]: With dead ends: 113 [2025-03-16 21:54:28,856 INFO L226 Difference]: Without dead ends: 67 [2025-03-16 21:54:28,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:54:28,857 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 55 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:28,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 131 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:54:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-16 21:54:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-16 21:54:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 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-03-16 21:54:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 88 transitions. [2025-03-16 21:54:28,860 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 88 transitions. Word has length 25 [2025-03-16 21:54:28,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:28,861 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 88 transitions. [2025-03-16 21:54:28,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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-03-16 21:54:28,861 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2025-03-16 21:54:28,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 21:54:28,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:28,861 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:28,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:54:28,861 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:28,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:28,862 INFO L85 PathProgramCache]: Analyzing trace with hash 543469308, now seen corresponding path program 1 times [2025-03-16 21:54:28,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:28,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112093780] [2025-03-16 21:54:28,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:28,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:28,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 21:54:28,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 21:54:28,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:28,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:28,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112093780] [2025-03-16 21:54:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112093780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:28,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:28,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:54:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356294496] [2025-03-16 21:54:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:28,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:28,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:28,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:28,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:28,997 INFO L87 Difference]: Start difference. First operand 67 states and 88 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-03-16 21:54:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:29,081 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2025-03-16 21:54:29,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:29,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2025-03-16 21:54:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:29,082 INFO L225 Difference]: With dead ends: 131 [2025-03-16 21:54:29,082 INFO L226 Difference]: Without dead ends: 79 [2025-03-16 21:54:29,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:54:29,083 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 23 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:29,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 106 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:29,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-16 21:54:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2025-03-16 21:54:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 68 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 90 transitions. [2025-03-16 21:54:29,089 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 90 transitions. Word has length 26 [2025-03-16 21:54:29,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:29,089 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 90 transitions. [2025-03-16 21:54:29,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 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-03-16 21:54:29,089 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2025-03-16 21:54:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 21:54:29,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:29,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:29,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:54:29,092 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:29,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:29,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1895598097, now seen corresponding path program 1 times [2025-03-16 21:54:29,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:29,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194326744] [2025-03-16 21:54:29,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:29,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:29,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 21:54:29,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 21:54:29,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:29,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:29,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:29,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194326744] [2025-03-16 21:54:29,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194326744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:29,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412330264] [2025-03-16 21:54:29,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:29,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:29,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:29,300 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-16 21:54:29,301 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-16 21:54:29,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 21:54:29,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 21:54:29,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:29,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:29,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-16 21:54:29,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:29,561 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:29,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:54:29,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412330264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:29,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 21:54:29,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-16 21:54:29,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196924727] [2025-03-16 21:54:29,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:29,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:54:29,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:29,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:54:29,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:54:29,562 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-03-16 21:54:29,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:29,649 INFO L93 Difference]: Finished difference Result 133 states and 171 transitions. [2025-03-16 21:54:29,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:54:29,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-16 21:54:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:29,650 INFO L225 Difference]: With dead ends: 133 [2025-03-16 21:54:29,650 INFO L226 Difference]: Without dead ends: 81 [2025-03-16 21:54:29,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-16 21:54:29,651 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 70 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:29,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 77 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 21:54:29,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-16 21:54:29,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-16 21:54:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.275) internal successors, (102), 80 states have internal predecessors, (102), 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-03-16 21:54:29,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 102 transitions. [2025-03-16 21:54:29,658 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 102 transitions. Word has length 40 [2025-03-16 21:54:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:29,658 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 102 transitions. [2025-03-16 21:54:29,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 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-03-16 21:54:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 102 transitions. [2025-03-16 21:54:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-16 21:54:29,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:29,659 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:29,667 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-16 21:54:29,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:29,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:29,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash 64615043, now seen corresponding path program 1 times [2025-03-16 21:54:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:29,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147957095] [2025-03-16 21:54:29,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:29,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 21:54:29,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 21:54:29,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:29,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:30,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:30,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147957095] [2025-03-16 21:54:30,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147957095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:30,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148789839] [2025-03-16 21:54:30,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:30,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:30,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:30,192 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-16 21:54:30,193 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-16 21:54:30,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-16 21:54:30,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-16 21:54:30,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:30,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:30,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 21:54:30,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:30,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:30,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148789839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:30,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:54:30,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-03-16 21:54:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257085334] [2025-03-16 21:54:30,768 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:30,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 21:54:30,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:30,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 21:54:30,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-16 21:54:30,770 INFO L87 Difference]: Start difference. First operand 81 states and 102 transitions. Second operand has 19 states, 19 states have (on average 5.0) internal successors, (95), 18 states have internal predecessors, (95), 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-03-16 21:54:31,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:31,023 INFO L93 Difference]: Finished difference Result 166 states and 209 transitions. [2025-03-16 21:54:31,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:54:31,024 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 18 states have internal predecessors, (95), 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 41 [2025-03-16 21:54:31,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:31,025 INFO L225 Difference]: With dead ends: 166 [2025-03-16 21:54:31,025 INFO L226 Difference]: Without dead ends: 114 [2025-03-16 21:54:31,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-03-16 21:54:31,026 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 68 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:31,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 330 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-16 21:54:31,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2025-03-16 21:54:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 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-03-16 21:54:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2025-03-16 21:54:31,029 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 41 [2025-03-16 21:54:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:31,029 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2025-03-16 21:54:31,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.0) internal successors, (95), 18 states have internal predecessors, (95), 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-03-16 21:54:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2025-03-16 21:54:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-16 21:54:31,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:31,030 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:31,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 21:54:31,231 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,SelfDestructingSolverStorable9 [2025-03-16 21:54:31,231 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:31,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1805815366, now seen corresponding path program 1 times [2025-03-16 21:54:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:31,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330591230] [2025-03-16 21:54:31,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:31,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:31,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 21:54:31,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 21:54:31,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:31,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:31,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:31,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330591230] [2025-03-16 21:54:31,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330591230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:31,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491873137] [2025-03-16 21:54:31,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:31,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:31,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:31,548 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-16 21:54:31,551 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-16 21:54:31,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-16 21:54:31,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-16 21:54:31,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:31,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:31,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 21:54:31,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:31,802 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:32,030 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:32,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491873137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:32,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:54:32,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 18 [2025-03-16 21:54:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152378730] [2025-03-16 21:54:32,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:32,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-16 21:54:32,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:32,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-16 21:54:32,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-16 21:54:32,033 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 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-03-16 21:54:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:32,237 INFO L93 Difference]: Finished difference Result 148 states and 185 transitions. [2025-03-16 21:54:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:54:32,237 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-16 21:54:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:32,238 INFO L225 Difference]: With dead ends: 148 [2025-03-16 21:54:32,238 INFO L226 Difference]: Without dead ends: 96 [2025-03-16 21:54:32,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-03-16 21:54:32,239 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 45 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:32,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 341 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 21:54:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-16 21:54:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2025-03-16 21:54:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 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-03-16 21:54:32,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2025-03-16 21:54:32,242 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 43 [2025-03-16 21:54:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:32,242 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2025-03-16 21:54:32,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 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-03-16 21:54:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2025-03-16 21:54:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 21:54:32,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:32,243 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:32,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 21:54:32,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:32,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:32,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:32,444 INFO L85 PathProgramCache]: Analyzing trace with hash 108776889, now seen corresponding path program 1 times [2025-03-16 21:54:32,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:32,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911697425] [2025-03-16 21:54:32,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:32,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:32,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 21:54:32,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 21:54:32,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:32,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:33,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:33,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911697425] [2025-03-16 21:54:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911697425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697700232] [2025-03-16 21:54:33,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:33,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:33,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:33,510 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-16 21:54:33,512 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-16 21:54:33,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 21:54:33,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 21:54:33,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:33,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:33,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-03-16 21:54:33,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:34,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:35,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697700232] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:35,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:54:35,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 20] total 43 [2025-03-16 21:54:35,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922109630] [2025-03-16 21:54:35,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:35,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-16 21:54:35,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:35,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-16 21:54:35,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1633, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 21:54:35,307 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 43 states, 43 states have (on average 3.627906976744186) internal successors, (156), 43 states have internal predecessors, (156), 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-03-16 21:54:37,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:37,914 INFO L93 Difference]: Finished difference Result 222 states and 279 transitions. [2025-03-16 21:54:37,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-16 21:54:37,914 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.627906976744186) internal successors, (156), 43 states have internal predecessors, (156), 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 57 [2025-03-16 21:54:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:37,915 INFO L225 Difference]: With dead ends: 222 [2025-03-16 21:54:37,915 INFO L226 Difference]: Without dead ends: 170 [2025-03-16 21:54:37,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2148 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1049, Invalid=8263, Unknown=0, NotChecked=0, Total=9312 [2025-03-16 21:54:37,919 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 309 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:37,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 669 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 21:54:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-16 21:54:37,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 98. [2025-03-16 21:54:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 97 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 121 transitions. [2025-03-16 21:54:37,925 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 121 transitions. Word has length 57 [2025-03-16 21:54:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:37,925 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 121 transitions. [2025-03-16 21:54:37,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.627906976744186) internal successors, (156), 43 states have internal predecessors, (156), 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-03-16 21:54:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2025-03-16 21:54:37,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-16 21:54:37,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:37,929 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:37,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 21:54:38,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:38,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:38,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash -223086288, now seen corresponding path program 1 times [2025-03-16 21:54:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:38,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276645903] [2025-03-16 21:54:38,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:38,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:38,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 21:54:38,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 21:54:38,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:38,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 21:54:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276645903] [2025-03-16 21:54:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276645903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254369768] [2025-03-16 21:54:38,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:38,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:38,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:38,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:54:38,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 21:54:38,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-16 21:54:38,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-16 21:54:38,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:38,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:38,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-16 21:54:38,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 21:54:38,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 21:54:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254369768] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:39,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:54:39,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 11] total 21 [2025-03-16 21:54:39,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330282730] [2025-03-16 21:54:39,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:39,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 21:54:39,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:39,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 21:54:39,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2025-03-16 21:54:39,264 INFO L87 Difference]: Start difference. First operand 98 states and 121 transitions. Second operand has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 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-03-16 21:54:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:39,826 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2025-03-16 21:54:39,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 21:54:39,826 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 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 58 [2025-03-16 21:54:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:39,827 INFO L225 Difference]: With dead ends: 197 [2025-03-16 21:54:39,827 INFO L226 Difference]: Without dead ends: 133 [2025-03-16 21:54:39,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1145, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 21:54:39,827 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 84 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:39,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 396 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:54:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-16 21:54:39,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 84. [2025-03-16 21:54:39,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.216867469879518) internal successors, (101), 83 states have internal predecessors, (101), 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-03-16 21:54:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions. [2025-03-16 21:54:39,831 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 58 [2025-03-16 21:54:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:39,831 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 101 transitions. [2025-03-16 21:54:39,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.761904761904762) internal successors, (142), 21 states have internal predecessors, (142), 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-03-16 21:54:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions. [2025-03-16 21:54:39,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 21:54:39,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:39,832 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:39,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 21:54:40,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-16 21:54:40,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:40,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:40,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1295676412, now seen corresponding path program 1 times [2025-03-16 21:54:40,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:40,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155255752] [2025-03-16 21:54:40,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:40,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:40,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 21:54:40,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 21:54:40,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:40,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:40,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:54:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155255752] [2025-03-16 21:54:40,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155255752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 21:54:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443046383] [2025-03-16 21:54:40,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:40,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:40,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:40,755 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 21:54:40,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 21:54:40,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 21:54:40,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 21:54:40,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:40,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:40,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-16 21:54:40,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:41,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:41,592 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:41,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443046383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:41,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 21:54:41,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2025-03-16 21:54:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369536180] [2025-03-16 21:54:41,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:41,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-16 21:54:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:54:41,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-16 21:54:41,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=807, Unknown=0, NotChecked=0, Total=930 [2025-03-16 21:54:41,594 INFO L87 Difference]: Start difference. First operand 84 states and 101 transitions. Second operand has 31 states, 31 states have (on average 4.870967741935484) internal successors, (151), 31 states have internal predecessors, (151), 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-03-16 21:54:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:42,126 INFO L93 Difference]: Finished difference Result 177 states and 208 transitions. [2025-03-16 21:54:42,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-16 21:54:42,126 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.870967741935484) internal successors, (151), 31 states have internal predecessors, (151), 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 59 [2025-03-16 21:54:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:42,127 INFO L225 Difference]: With dead ends: 177 [2025-03-16 21:54:42,127 INFO L226 Difference]: Without dead ends: 127 [2025-03-16 21:54:42,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=399, Invalid=2051, Unknown=0, NotChecked=0, Total=2450 [2025-03-16 21:54:42,128 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 315 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:42,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 473 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:54:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-16 21:54:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 70. [2025-03-16 21:54:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 69 states have internal predecessors, (83), 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-03-16 21:54:42,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2025-03-16 21:54:42,131 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 59 [2025-03-16 21:54:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:42,131 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2025-03-16 21:54:42,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.870967741935484) internal successors, (151), 31 states have internal predecessors, (151), 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-03-16 21:54:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2025-03-16 21:54:42,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 21:54:42,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:42,131 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:42,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 21:54:42,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:42,332 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:42,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1293555823, now seen corresponding path program 1 times [2025-03-16 21:54:42,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:54:42,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150920056] [2025-03-16 21:54:42,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:42,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:54:42,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 21:54:42,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 21:54:42,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:42,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:54:42,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 21:54:42,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 21:54:42,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 21:54:42,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:42,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 21:54:42,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 21:54:42,499 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 21:54:42,500 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 21:54:42,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:54:42,507 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 21:54:42,536 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:54:42,538 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:54:42,538 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-16 21:54:42,551 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 21:54:42,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 09:54:42 BoogieIcfgContainer [2025-03-16 21:54:42,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 21:54:42,554 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 21:54:42,554 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 21:54:42,554 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 21:54:42,554 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:25" (3/4) ... [2025-03-16 21:54:42,556 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 21:54:42,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 21:54:42,557 INFO L158 Benchmark]: Toolchain (without parser) took 17505.61ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 122.2MB in the beginning and 326.4MB in the end (delta: -204.1MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2025-03-16 21:54:42,557 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:54:42,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.06ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:54:42,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.45ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 104.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:54:42,558 INFO L158 Benchmark]: Boogie Preprocessor took 55.44ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 102.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:54:42,558 INFO L158 Benchmark]: IcfgBuilder took 529.11ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 74.9MB in the end (delta: 27.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-16 21:54:42,558 INFO L158 Benchmark]: TraceAbstraction took 16687.21ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 74.0MB in the beginning and 326.5MB in the end (delta: -252.5MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2025-03-16 21:54:42,558 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 427.8MB. Free memory was 326.5MB in the beginning and 326.4MB in the end (delta: 133.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:54:42,559 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.21ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 189.06ms. Allocated memory is still 167.8MB. Free memory was 121.8MB in the beginning and 109.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.45ms. Allocated memory is still 167.8MB. Free memory was 109.2MB in the beginning and 104.9MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.44ms. Allocated memory is still 167.8MB. Free memory was 104.9MB in the beginning and 102.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 529.11ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 74.9MB in the end (delta: 27.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 16687.21ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 74.0MB in the beginning and 326.5MB in the end (delta: -252.5MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 427.8MB. Free memory was 326.5MB in the beginning and 326.4MB in the end (delta: 133.8kB). There was no memory consumed. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 97. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 8); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (8 - 1); [L32] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 32); [L33] const SORT_12 msb_SORT_12 = (SORT_12)1 << (32 - 1); [L35] const SORT_4 var_8 = 0; [L36] const SORT_12 var_14 = 1; [L37] const SORT_1 var_25 = 1; [L38] const SORT_1 var_42 = 0; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L42] SORT_4 input_5; [L43] SORT_1 input_6; [L44] SORT_1 input_7; [L45] SORT_4 input_29; [L46] SORT_4 input_31; [L47] SORT_4 input_33; [L48] SORT_4 input_35; [L49] SORT_4 input_37; [L50] SORT_4 input_39; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=255, var_14=1, var_25=1, var_42=0, var_8=0] [L52] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, var_14=1, var_25=1, var_42=0, var_8=0] [L53] SORT_4 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_14=1, var_25=1, var_42=0, var_8=0] [L54] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] SORT_4 init_10_arg_1 = var_8; [L57] state_9 = init_10_arg_1 [L58] SORT_4 init_18_arg_1 = var_8; [L59] state_17 = init_18_arg_1 [L60] SORT_1 init_44_arg_1 = var_42; [L61] state_43 = init_44_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_13_arg_0=0, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_16=-1, var_20_arg_0=0, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_16=-1, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_22_arg_0=-1, var_22_arg_1=0, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-256, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=0, state_9=0, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_28_arg_0)) [L107] SORT_1 var_45_arg_0 = state_43; [L108] SORT_4 var_45_arg_1 = input_5; [L109] SORT_4 var_45_arg_2 = state_9; [L110] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L111] SORT_4 next_46_arg_1 = var_45; [L112] SORT_1 var_47_arg_0 = state_43; [L113] SORT_4 var_47_arg_1 = input_5; [L114] SORT_4 var_47_arg_2 = state_17; [L115] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L116] SORT_4 next_48_arg_1 = var_47; [L117] SORT_1 var_49_arg_0 = state_43; [L118] SORT_1 var_49_arg_1 = var_42; [L119] SORT_1 var_49_arg_2 = var_25; [L120] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; VAL [mask_SORT_1=1, next_46_arg_1=0, next_48_arg_1=0, var_14=1, var_25=1, var_42=0, var_49=1] [L121] EXPR var_49 & mask_SORT_1 VAL [mask_SORT_1=1, next_46_arg_1=0, next_48_arg_1=0, var_14=1, var_25=1, var_42=0] [L121] var_49 = var_49 & mask_SORT_1 [L122] SORT_1 next_50_arg_1 = var_49; [L124] state_9 = next_46_arg_1 [L125] state_17 = next_48_arg_1 [L126] state_43 = next_50_arg_1 [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_13_arg_0=0, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_16=-1, var_20_arg_0=0, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_16=-1, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_22_arg_0=-1, var_22_arg_1=0, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-256, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=0, state_43=1, state_9=0, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_28_arg_0)) [L107] SORT_1 var_45_arg_0 = state_43; [L108] SORT_4 var_45_arg_1 = input_5; [L109] SORT_4 var_45_arg_2 = state_9; [L110] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L111] SORT_4 next_46_arg_1 = var_45; [L112] SORT_1 var_47_arg_0 = state_43; [L113] SORT_4 var_47_arg_1 = input_5; [L114] SORT_4 var_47_arg_2 = state_17; [L115] SORT_4 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L116] SORT_4 next_48_arg_1 = var_47; [L117] SORT_1 var_49_arg_0 = state_43; [L118] SORT_1 var_49_arg_1 = var_42; [L119] SORT_1 var_49_arg_2 = var_25; [L120] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; VAL [mask_SORT_1=1, next_46_arg_1=255, next_48_arg_1=255, var_14=1, var_25=1, var_42=0, var_49=0] [L121] EXPR var_49 & mask_SORT_1 VAL [mask_SORT_1=1, next_46_arg_1=255, next_48_arg_1=255, var_14=1, var_25=1, var_42=0] [L121] var_49 = var_49 & mask_SORT_1 [L122] SORT_1 next_50_arg_1 = var_49; [L124] state_9 = next_46_arg_1 [L125] state_17 = next_48_arg_1 [L126] state_43 = next_50_arg_1 [L64] input_2 = __VERIFIER_nondet_uchar() [L65] input_3 = __VERIFIER_nondet_uchar() [L66] input_5 = __VERIFIER_nondet_uchar() [L67] input_6 = __VERIFIER_nondet_uchar() [L68] input_7 = __VERIFIER_nondet_uchar() [L69] input_29 = __VERIFIER_nondet_uchar() [L70] input_31 = __VERIFIER_nondet_uchar() [L71] input_33 = __VERIFIER_nondet_uchar() [L72] input_35 = __VERIFIER_nondet_uchar() [L73] input_37 = __VERIFIER_nondet_uchar() [L74] input_39 = __VERIFIER_nondet_uchar() [L77] SORT_4 var_11_arg_0 = state_9; [L78] SORT_1 var_11 = var_11_arg_0 >> 7; [L79] SORT_1 var_13_arg_0 = var_11; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_13_arg_0=1, var_14=1, var_25=1, var_42=0] [L80] EXPR var_13_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L80] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L81] SORT_12 var_13 = var_13_arg_0; [L82] SORT_12 var_15_arg_0 = var_13; [L83] SORT_12 var_15_arg_1 = var_14; [L84] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L85] SORT_1 var_16_arg_0 = var_15; [L86] SORT_1 var_16 = ~var_16_arg_0; [L87] SORT_4 var_19_arg_0 = state_17; [L88] SORT_1 var_19 = var_19_arg_0 >> 7; [L89] SORT_1 var_20_arg_0 = var_19; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_16=-2, var_20_arg_0=1, var_25=1, var_42=0] [L90] EXPR var_20_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_16=-2, var_25=1, var_42=0] [L90] var_20_arg_0 = var_20_arg_0 & mask_SORT_1 [L91] SORT_12 var_20 = var_20_arg_0; [L92] SORT_12 var_21_arg_0 = var_20; [L93] SORT_12 var_21_arg_1 = var_14; [L94] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L95] SORT_1 var_22_arg_0 = var_16; [L96] SORT_1 var_22_arg_1 = var_21; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_22_arg_0=-2, var_22_arg_1=1, var_25=1, var_42=0] [L97] EXPR var_22_arg_0 | var_22_arg_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L97] SORT_1 var_22 = var_22_arg_0 | var_22_arg_1; [L98] SORT_1 var_26_arg_0 = var_22; [L99] SORT_1 var_26 = ~var_26_arg_0; [L100] SORT_1 var_27_arg_0 = var_25; [L101] SORT_1 var_27_arg_1 = var_26; VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_27_arg_0=1, var_27_arg_1=-255, var_42=0] [L102] EXPR var_27_arg_0 & var_27_arg_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L102] SORT_1 var_27 = var_27_arg_0 & var_27_arg_1; [L103] EXPR var_27 & mask_SORT_1 VAL [mask_SORT_1=1, state_17=255, state_43=0, state_9=255, var_14=1, var_25=1, var_42=0] [L103] var_27 = var_27 & mask_SORT_1 [L104] SORT_1 bad_28_arg_0 = var_27; [L105] CALL __VERIFIER_assert(!(bad_28_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 63 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 15, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1156 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1156 mSDsluCounter, 3551 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2998 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4665 IncrementalHoareTripleChecker+Invalid, 4711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 553 mSDtfsCounter, 4665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 789 GetRequests, 515 SyntacticMatches, 2 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3001 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=12, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 257 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 840 NumberOfCodeBlocks, 840 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1014 ConstructedInterpolants, 0 QuantifiedInterpolants, 8001 SizeOfPredicates, 20 NumberOfNonLiveVariables, 2098 ConjunctsInSsa, 351 ConjunctsInUnsatCore, 25 InterpolantComputations, 9 PerfectInterpolantSequences, 345/482 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 could not prove your program: unable to determine feasibility of some traces [2025-03-16 21:54:42,574 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.h_b04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:54:44,343 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:54:44,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-16 21:54:44,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:54:44,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:54:44,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:54:44,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:54:44,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:54:44,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:54:44,457 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:54:44,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:54:44,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:54:44,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:54:44,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:54:44,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:54:44,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:54:44,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:54:44,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:54:44,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:54:44,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:54:44,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:54:44,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:54:44,459 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 21:54:44,459 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 21:54:44,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:54:44,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:54:44,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:54:44,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:54:44,459 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 278b4de367ce9a5d90b72b56db7b4bfd32cdd3486043ecd2959c1028ac507b6e [2025-03-16 21:54:44,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:54:44,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:54:44,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:54:44,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:54:44,700 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:54:44,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2025-03-16 21:54:45,825 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9886651fd/27b5725bacfb4ce880990434c385a4c6/FLAG5a7207a1a [2025-03-16 21:54:46,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:54:46,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b04.c [2025-03-16 21:54:46,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9886651fd/27b5725bacfb4ce880990434c385a4c6/FLAG5a7207a1a [2025-03-16 21:54:46,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9886651fd/27b5725bacfb4ce880990434c385a4c6 [2025-03-16 21:54:46,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:54:46,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:54:46,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:54:46,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:54:46,069 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:54:46,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da4404c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46, skipping insertion in model container [2025-03-16 21:54:46,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:54:46,186 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/hardware-verification-bv/btor2c-lazyMod.h_b04.c[1245,1258] [2025-03-16 21:54:46,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:54:46,231 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:54:46,239 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/hardware-verification-bv/btor2c-lazyMod.h_b04.c[1245,1258] [2025-03-16 21:54:46,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:54:46,263 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:54:46,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46 WrapperNode [2025-03-16 21:54:46,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:54:46,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:54:46,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:54:46,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:54:46,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,290 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2025-03-16 21:54:46,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:54:46,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:54:46,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:54:46,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:54:46,298 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,307 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-16 21:54:46,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,311 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:54:46,317 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:54:46,317 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:54:46,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:54:46,319 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (1/1) ... [2025-03-16 21:54:46,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:54:46,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:46,339 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-16 21:54:46,341 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-16 21:54:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:54:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 21:54:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-16 21:54:46,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:54:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:54:46,422 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:54:46,423 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:54:46,572 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-16 21:54:46,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:54:46,582 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:54:46,582 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:54:46,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:46 BoogieIcfgContainer [2025-03-16 21:54:46,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:54:46,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:54:46,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:54:46,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:54:46,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:54:46" (1/3) ... [2025-03-16 21:54:46,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a5c504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:54:46, skipping insertion in model container [2025-03-16 21:54:46,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:54:46" (2/3) ... [2025-03-16 21:54:46,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a5c504 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:54:46, skipping insertion in model container [2025-03-16 21:54:46,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:46" (3/3) ... [2025-03-16 21:54:46,590 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b04.c [2025-03-16 21:54:46,601 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:54:46,603 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b04.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:54:46,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:54:46,646 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;@6278bfc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:54:46,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:54:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-16 21:54:46,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:46,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-16 21:54:46,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:46,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-03-16 21:54:46,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:54:46,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135027605] [2025-03-16 21:54:46,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:46,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:46,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:46,665 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-16 21:54:46,666 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-16 21:54:46,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-16 21:54:46,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-16 21:54:46,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:46,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:46,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 21:54:46,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:46,956 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 21:54:46,956 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:54:46,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135027605] [2025-03-16 21:54:46,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135027605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:54:46,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:54:46,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:54:46,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022023042] [2025-03-16 21:54:46,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:54:46,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:54:46,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:54:46,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:54:46,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:54:46,976 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-03-16 21:54:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:47,008 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-03-16 21:54:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:54:47,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-16 21:54:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:47,014 INFO L225 Difference]: With dead ends: 16 [2025-03-16 21:54:47,014 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 21:54:47,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:54:47,021 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:47,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:54:47,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 21:54:47,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-03-16 21:54:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-03-16 21:54:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-03-16 21:54:47,039 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-03-16 21:54:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:47,040 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-03-16 21:54:47,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-03-16 21:54:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-03-16 21:54:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 21:54:47,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:47,041 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-16 21:54:47,050 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-16 21:54:47,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:47,245 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:47,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:47,246 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-03-16 21:54:47,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:54:47,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148672648] [2025-03-16 21:54:47,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:54:47,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:47,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:47,249 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-16 21:54:47,251 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-16 21:54:47,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 21:54:47,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 21:54:47,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:54:47,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:47,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 21:54:47,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:47,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:47,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:47,770 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:54:47,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148672648] [2025-03-16 21:54:47,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148672648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:47,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:54:47,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-16 21:54:47,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382979483] [2025-03-16 21:54:47,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:47,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:54:47,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:54:47,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:54:47,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:54:47,772 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:47,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:47,837 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-16 21:54:47,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:54:47,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 21:54:47,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:47,838 INFO L225 Difference]: With dead ends: 14 [2025-03-16 21:54:47,838 INFO L226 Difference]: Without dead ends: 12 [2025-03-16 21:54:47,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:54:47,839 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:47,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:54:47,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-16 21:54:47,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2025-03-16 21:54:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-03-16 21:54:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-03-16 21:54:47,841 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-03-16 21:54:47,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:47,841 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-03-16 21:54:47,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:54:47,842 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-03-16 21:54:47,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 21:54:47,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:54:47,842 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-03-16 21:54:47,848 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-16 21:54:48,047 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 [2025-03-16 21:54:48,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:54:48,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:54:48,050 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-03-16 21:54:48,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 21:54:48,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1227247783] [2025-03-16 21:54:48,050 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 21:54:48,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:48,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:54:48,053 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-16 21:54:48,053 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-16 21:54:48,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-16 21:54:48,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 21:54:48,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 21:54:48,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:54:48,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-16 21:54:48,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 21:54:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:48,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 21:54:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 21:54:48,675 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 21:54:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227247783] [2025-03-16 21:54:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227247783] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 21:54:48,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 21:54:48,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-16 21:54:48,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316448562] [2025-03-16 21:54:48,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 21:54:48,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-16 21:54:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 21:54:48,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-16 21:54:48,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:54:48,677 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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-03-16 21:54:48,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:54:48,805 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-03-16 21:54:48,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:54:48,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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 10 [2025-03-16 21:54:48,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:54:48,806 INFO L225 Difference]: With dead ends: 12 [2025-03-16 21:54:48,806 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 21:54:48,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-16 21:54:48,807 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 12 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 21:54:48,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 21:54:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 21:54:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 21:54:48,807 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-03-16 21:54:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 21:54:48,807 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2025-03-16 21:54:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:54:48,807 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 21:54:48,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 11 states have internal predecessors, (19), 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-03-16 21:54:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 21:54:48,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 21:54:48,810 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 21:54:48,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 21:54:49,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 21:54:49,013 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1] [2025-03-16 21:54:49,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 21:54:49,041 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 21:54:49,051 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-16 21:54:49,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 09:54:49 BoogieIcfgContainer [2025-03-16 21:54:49,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 21:54:49,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 21:54:49,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 21:54:49,053 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 21:54:49,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:54:46" (3/4) ... [2025-03-16 21:54:49,055 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 21:54:49,060 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-16 21:54:49,060 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-16 21:54:49,061 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 21:54:49,061 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 21:54:49,061 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 21:54:49,118 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 21:54:49,118 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 21:54:49,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 21:54:49,119 INFO L158 Benchmark]: Toolchain (without parser) took 3054.40ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 91.6MB in the beginning and 140.2MB in the end (delta: -48.5MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-03-16 21:54:49,119 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:54:49,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.37ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 77.3MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:54:49,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.69ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:54:49,119 INFO L158 Benchmark]: Boogie Preprocessor took 24.05ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 74.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 21:54:49,119 INFO L158 Benchmark]: IcfgBuilder took 265.19ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 58.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 21:54:49,119 INFO L158 Benchmark]: TraceAbstraction took 2467.43ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 57.9MB in the beginning and 148.2MB in the end (delta: -90.3MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2025-03-16 21:54:49,120 INFO L158 Benchmark]: Witness Printer took 65.27ms. Allocated memory is still 234.9MB. Free memory was 148.2MB in the beginning and 140.2MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 21:54:49,120 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.13ms. Allocated memory is still 117.4MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.37ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 77.3MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.69ms. Allocated memory is still 117.4MB. Free memory was 77.3MB in the beginning and 75.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.05ms. Allocated memory is still 117.4MB. Free memory was 75.7MB in the beginning and 74.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 265.19ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 58.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2467.43ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 57.9MB in the beginning and 148.2MB in the end (delta: -90.3MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * Witness Printer took 65.27ms. Allocated memory is still 234.9MB. Free memory was 148.2MB in the beginning and 140.2MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 21]: 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 CFG has 1 procedures, 8 locations, 9 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 7 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 18, 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 12 QuantifiedInterpolants, 860 SizeOfPredicates, 17 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 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 - InvariantResult [Line: 62]: Location Invariant Derived location invariant: ((1 == var_14) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2025-03-16 21:54:49,133 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE