./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_b06.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 ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:36:41,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:36:41,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:36:42,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:36:42,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:36:42,015 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:36:42,015 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:36:42,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:36:42,016 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:36:42,016 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:36:42,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:36:42,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:36:42,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:36:42,017 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:36:42,017 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:36:42,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:36:42,018 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:36:42,018 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:36:42,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:36:42,018 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:36:42,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:36:42,018 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:36:42,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:36:42,018 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:36:42,018 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:36:42,018 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:36:42,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:36:42,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:36:42,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:36:42,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:36:42,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:36:42,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:36:42,019 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:36:42,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:36:42,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:36:42,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:36:42,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:36:42,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:36:42,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:36:42,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:36:42,020 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 -> ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 [2025-03-03 17:36:42,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:36:42,256 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:36:42,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:36:42,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:36:42,259 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:36:42,260 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_b06.c [2025-03-03 17:36:43,408 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf44c69b/a3f8de01a5bd43e585e306641906d7c8/FLAG7bbecc6d0 [2025-03-03 17:36:43,686 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:36:43,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2025-03-03 17:36:43,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf44c69b/a3f8de01a5bd43e585e306641906d7c8/FLAG7bbecc6d0 [2025-03-03 17:36:43,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bf44c69b/a3f8de01a5bd43e585e306641906d7c8 [2025-03-03 17:36:43,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:36:43,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:36:43,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:36:43,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:36:43,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:36:43,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:36:43" (1/1) ... [2025-03-03 17:36:43,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f66db0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:43, skipping insertion in model container [2025-03-03 17:36:43,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:36:43" (1/1) ... [2025-03-03 17:36:44,002 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:36:44,105 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c[1245,1258] [2025-03-03 17:36:44,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:36:44,173 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:36:44,181 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_b06.c[1245,1258] [2025-03-03 17:36:44,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:36:44,231 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:36:44,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44 WrapperNode [2025-03-03 17:36:44,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:36:44,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:36:44,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:36:44,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:36:44,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,285 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 258 [2025-03-03 17:36:44,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:36:44,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:36:44,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:36:44,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:36:44,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,321 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-03 17:36:44,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,331 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:36:44,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:36:44,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:36:44,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:36:44,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (1/1) ... [2025-03-03 17:36:44,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:36:44,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:44,368 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-03 17:36:44,373 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-03 17:36:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:36:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:36:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 17:36:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:36:44,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:36:44,459 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:36:44,461 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:36:44,786 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-03 17:36:44,787 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:36:44,811 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:36:44,812 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:36:44,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:36:44 BoogieIcfgContainer [2025-03-03 17:36:44,812 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:36:44,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:36:44,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:36:44,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:36:44,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:36:43" (1/3) ... [2025-03-03 17:36:44,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dad48f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:36:44, skipping insertion in model container [2025-03-03 17:36:44,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:44" (2/3) ... [2025-03-03 17:36:44,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dad48f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:36:44, skipping insertion in model container [2025-03-03 17:36:44,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:36:44" (3/3) ... [2025-03-03 17:36:44,819 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b06.c [2025-03-03 17:36:44,828 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:36:44,830 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b06.c that has 1 procedures, 62 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:36:44,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:36:44,873 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;@8dca6e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:36:44,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:36:44,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 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-03 17:36:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 17:36:44,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:44,880 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-03 17:36:44,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:44,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1744490204, now seen corresponding path program 1 times [2025-03-03 17:36:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:44,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840508006] [2025-03-03 17:36:44,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:44,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:44,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 17:36:45,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 17:36:45,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:45,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:45,391 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-03 17:36:45,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:45,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840508006] [2025-03-03 17:36:45,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840508006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:45,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:45,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:36:45,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079982037] [2025-03-03 17:36:45,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:45,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:36:45,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:45,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:36:45,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:45,412 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 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 6.25) internal successors, (25), 4 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-03 17:36:45,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:45,473 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions. [2025-03-03 17:36:45,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:45,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-03 17:36:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:45,480 INFO L225 Difference]: With dead ends: 105 [2025-03-03 17:36:45,480 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 17:36:45,482 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-03 17:36:45,483 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:45,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:36:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 17:36:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-03 17:36:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.45) internal successors, (87), 60 states have internal predecessors, (87), 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-03 17:36:45,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2025-03-03 17:36:45,507 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 25 [2025-03-03 17:36:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:45,508 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2025-03-03 17:36:45,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-03 17:36:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2025-03-03 17:36:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 17:36:45,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:45,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, 1] [2025-03-03 17:36:45,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:36:45,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:45,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:45,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1760057690, now seen corresponding path program 1 times [2025-03-03 17:36:45,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:45,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367329275] [2025-03-03 17:36:45,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:45,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:45,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-03 17:36:45,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 17:36:45,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:45,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:45,678 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-03 17:36:45,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:45,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367329275] [2025-03-03 17:36:45,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367329275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:45,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:45,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:36:45,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103998687] [2025-03-03 17:36:45,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:45,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:36:45,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:45,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:36:45,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:45,681 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 4 states, 4 states have (on average 6.5) 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-03 17:36:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:45,733 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2025-03-03 17:36:45,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:45,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) 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-03 17:36:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:45,734 INFO L225 Difference]: With dead ends: 106 [2025-03-03 17:36:45,734 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 17:36:45,734 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-03 17:36:45,734 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:45,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:36:45,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 17:36:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-03 17:36:45,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.435483870967742) internal successors, (89), 62 states have internal predecessors, (89), 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-03 17:36:45,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2025-03-03 17:36:45,742 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 26 [2025-03-03 17:36:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:45,742 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2025-03-03 17:36:45,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) 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-03 17:36:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2025-03-03 17:36:45,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 17:36:45,742 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:45,743 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:45,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:36:45,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:45,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:45,743 INFO L85 PathProgramCache]: Analyzing trace with hash 658722783, now seen corresponding path program 1 times [2025-03-03 17:36:45,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:45,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224662796] [2025-03-03 17:36:45,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:45,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:45,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 17:36:45,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 17:36:45,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:45,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:45,932 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-03 17:36:45,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:45,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224662796] [2025-03-03 17:36:45,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224662796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:45,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:45,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:45,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654750815] [2025-03-03 17:36:45,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:45,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:45,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:45,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:45,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:45,936 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-03 17:36:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:46,012 INFO L93 Difference]: Finished difference Result 112 states and 158 transitions. [2025-03-03 17:36:46,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:46,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2025-03-03 17:36:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:46,014 INFO L225 Difference]: With dead ends: 112 [2025-03-03 17:36:46,014 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 17:36:46,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:46,016 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 72 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:46,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 191 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:46,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 17:36:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-03-03 17:36:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 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-03 17:36:46,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2025-03-03 17:36:46,023 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 27 [2025-03-03 17:36:46,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:46,023 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2025-03-03 17:36:46,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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-03 17:36:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2025-03-03 17:36:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 17:36:46,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:46,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:46,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:36:46,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:46,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:46,025 INFO L85 PathProgramCache]: Analyzing trace with hash 833932319, now seen corresponding path program 1 times [2025-03-03 17:36:46,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:46,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134795503] [2025-03-03 17:36:46,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:46,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:46,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 17:36:46,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 17:36:46,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:46,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:46,299 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-03 17:36:46,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134795503] [2025-03-03 17:36:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134795503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:46,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:46,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:46,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599246420] [2025-03-03 17:36:46,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:46,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:46,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:46,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:46,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:46,301 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-03 17:36:46,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:46,378 INFO L93 Difference]: Finished difference Result 112 states and 156 transitions. [2025-03-03 17:36:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:46,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2025-03-03 17:36:46,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:46,379 INFO L225 Difference]: With dead ends: 112 [2025-03-03 17:36:46,380 INFO L226 Difference]: Without dead ends: 64 [2025-03-03 17:36:46,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:46,381 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 64 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:46,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 234 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:46,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-03 17:36:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2025-03-03 17:36:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 60 states have internal predecessors, (85), 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-03 17:36:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2025-03-03 17:36:46,384 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 28 [2025-03-03 17:36:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:46,384 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2025-03-03 17:36:46,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 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-03 17:36:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2025-03-03 17:36:46,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 17:36:46,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:46,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:46,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:36:46,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:46,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:46,387 INFO L85 PathProgramCache]: Analyzing trace with hash 132126462, now seen corresponding path program 1 times [2025-03-03 17:36:46,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:46,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653274460] [2025-03-03 17:36:46,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:46,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:46,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 17:36:46,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 17:36:46,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:46,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:46,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:46,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653274460] [2025-03-03 17:36:46,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653274460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:46,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:46,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:46,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366584033] [2025-03-03 17:36:46,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:46,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:46,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:46,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:46,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:46,824 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-03 17:36:46,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:46,928 INFO L93 Difference]: Finished difference Result 121 states and 169 transitions. [2025-03-03 17:36:46,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:46,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2025-03-03 17:36:46,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:46,930 INFO L225 Difference]: With dead ends: 121 [2025-03-03 17:36:46,930 INFO L226 Difference]: Without dead ends: 78 [2025-03-03 17:36:46,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-03 17:36:46,932 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 112 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:46,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 240 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 17:36:46,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-03 17:36:46,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2025-03-03 17:36:46,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 72 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-03 17:36:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2025-03-03 17:36:46,941 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 28 [2025-03-03 17:36:46,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:46,941 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2025-03-03 17:36:46,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-03 17:36:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2025-03-03 17:36:46,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 17:36:46,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:46,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:46,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:36:46,942 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:46,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:46,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1268654782, now seen corresponding path program 1 times [2025-03-03 17:36:46,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:46,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855097882] [2025-03-03 17:36:46,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:46,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:46,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 17:36:46,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 17:36:46,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:46,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:36:46,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:36:46,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 17:36:46,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 17:36:46,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:46,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:36:47,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:36:47,003 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:36:47,004 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:36:47,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:36:47,008 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 17:36:47,030 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:36:47,037 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:36:47,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:36:47 BoogieIcfgContainer [2025-03-03 17:36:47,042 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:36:47,043 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:36:47,043 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:36:47,043 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:36:47,044 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:36:44" (3/4) ... [2025-03-03 17:36:47,045 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:36:47,046 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:36:47,047 INFO L158 Benchmark]: Toolchain (without parser) took 3062.09ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.8MB in the beginning and 139.2MB in the end (delta: -33.4MB). Peak memory consumption was 128.8MB. Max. memory is 16.1GB. [2025-03-03 17:36:47,047 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:36:47,049 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.62ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 92.1MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:36:47,049 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.19ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 86.1MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:36:47,050 INFO L158 Benchmark]: Boogie Preprocessor took 54.95ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 83.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:36:47,050 INFO L158 Benchmark]: IcfgBuilder took 470.19ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 47.2MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 17:36:47,050 INFO L158 Benchmark]: TraceAbstraction took 2228.00ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 47.2MB in the beginning and 139.2MB in the end (delta: -92.0MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2025-03-03 17:36:47,050 INFO L158 Benchmark]: Witness Printer took 3.30ms. Allocated memory is still 302.0MB. Free memory was 139.2MB in the beginning and 139.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:36:47,051 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.18ms. Allocated memory is still 201.3MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.62ms. Allocated memory is still 142.6MB. Free memory was 105.8MB in the beginning and 92.1MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.19ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 86.1MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.95ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 83.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 470.19ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 47.2MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2228.00ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 47.2MB in the beginning and 139.2MB in the end (delta: -92.0MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. * Witness Printer took 3.30ms. Allocated memory is still 302.0MB. Free memory was 139.2MB in the beginning and 139.2MB in the end (delta: 41.6kB). 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 bitwiseAnd at line 89. 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_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 2); [L30] const SORT_11 msb_SORT_11 = (SORT_11)1 << (2 - 1); [L32] const SORT_15 mask_SORT_15 = (SORT_15)-1 >> (sizeof(SORT_15) * 8 - 32); [L33] const SORT_15 msb_SORT_15 = (SORT_15)1 << (32 - 1); [L35] const SORT_1 var_5 = 0; [L36] const SORT_11 var_12 = 0; [L37] const SORT_15 var_17 = 2; [L38] const SORT_1 var_22 = 1; [L39] const SORT_11 var_39 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L43] SORT_1 input_4; [L44] SORT_11 input_26; [L45] SORT_11 input_40; [L46] SORT_1 input_45; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L48] SORT_1 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L49] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_11 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L50] SORT_11 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_11; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L51] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] SORT_1 init_7_arg_1 = var_5; [L54] state_6 = init_7_arg_1 [L55] SORT_1 init_9_arg_1 = var_5; [L56] state_8 = init_9_arg_1 [L57] SORT_11 init_14_arg_1 = var_12; [L58] state_13 = init_14_arg_1 [L59] SORT_1 init_32_arg_1 = var_5; [L60] state_31 = init_32_arg_1 VAL [mask_SORT_11=3, mask_SORT_1=1, state_13=0, state_31=0, state_6=0, state_8=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L63] input_2 = __VERIFIER_nondet_uchar() [L64] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, state_13=0, state_31=0, state_6=0, state_8=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L64] input_2 = input_2 & mask_SORT_1 [L65] input_3 = __VERIFIER_nondet_uchar() [L66] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_11=3, mask_SORT_1=1, state_13=0, state_31=0, state_6=0, state_8=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L66] input_3 = input_3 & mask_SORT_1 [L67] input_4 = __VERIFIER_nondet_uchar() [L68] input_26 = __VERIFIER_nondet_uchar() [L69] input_40 = __VERIFIER_nondet_uchar() [L70] input_45 = __VERIFIER_nondet_uchar() [L73] SORT_1 var_10_arg_0 = state_6; [L74] SORT_1 var_10_arg_1 = state_8; [L75] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L76] SORT_11 var_16_arg_0 = state_13; VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_10=1, var_12=0, var_16_arg_0=0, var_17=2, var_22=1, var_39=1, var_5=0] [L77] EXPR var_16_arg_0 & mask_SORT_11 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_10=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L77] var_16_arg_0 = var_16_arg_0 & mask_SORT_11 [L78] SORT_15 var_16 = var_16_arg_0; [L79] SORT_15 var_18_arg_0 = var_16; [L80] SORT_15 var_18_arg_1 = var_17; [L81] SORT_1 var_18 = var_18_arg_0 != var_18_arg_1; [L82] SORT_1 var_19_arg_0 = var_10; [L83] SORT_1 var_19_arg_1 = var_18; VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_19_arg_0=1, var_19_arg_1=1, var_22=1, var_39=1, var_5=0] [L84] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L84] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L85] SORT_1 var_23_arg_0 = var_19; [L86] SORT_1 var_23 = ~var_23_arg_0; [L87] SORT_1 var_24_arg_0 = var_22; [L88] SORT_1 var_24_arg_1 = var_23; VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_24_arg_0=1, var_24_arg_1=-2, var_39=1, var_5=0] [L89] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L89] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L90] EXPR var_24 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L90] var_24 = var_24 & mask_SORT_1 [L91] SORT_1 bad_25_arg_0 = var_24; [L92] CALL __VERIFIER_assert(!(bad_25_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 248 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 1072 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 745 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 350 IncrementalHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 327 mSDtfsCounter, 350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:36:47,068 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_b06.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 ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:36:48,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:36:48,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:36:48,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:36:48,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:36:48,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:36:48,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:36:48,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:36:48,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:36:48,971 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:36:48,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:36:48,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:36:48,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:36:48,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:36:48,972 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:36:48,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:36:48,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:36:48,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:36:48,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:36:48,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:36:48,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:36:48,973 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:36:48,973 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:36:48,973 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:36:48,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:36:48,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:36:48,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:36:48,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:36:48,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:36:48,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:36:48,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:36:48,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:36:48,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:36:48,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:36:48,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:36:48,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:36:48,975 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:36:48,975 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:36:48,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:36:48,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:36:48,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:36:48,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:36:48,975 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 -> ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 [2025-03-03 17:36:49,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:36:49,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:36:49,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:36:49,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:36:49,212 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:36:49,212 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_b06.c [2025-03-03 17:36:50,384 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9325e28/89256a77be66443a9177e021803b4fb0/FLAG4a3afbb40 [2025-03-03 17:36:50,563 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:36:50,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2025-03-03 17:36:50,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9325e28/89256a77be66443a9177e021803b4fb0/FLAG4a3afbb40 [2025-03-03 17:36:50,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b9325e28/89256a77be66443a9177e021803b4fb0 [2025-03-03 17:36:50,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:36:50,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:36:50,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:36:50,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:36:50,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:36:50,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711535bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50, skipping insertion in model container [2025-03-03 17:36:50,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:36:50,723 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_b06.c[1245,1258] [2025-03-03 17:36:50,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:36:50,786 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:36:50,796 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_b06.c[1245,1258] [2025-03-03 17:36:50,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:36:50,834 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:36:50,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50 WrapperNode [2025-03-03 17:36:50,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:36:50,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:36:50,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:36:50,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:36:50,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,847 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,866 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 154 [2025-03-03 17:36:50,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:36:50,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:36:50,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:36:50,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:36:50,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,888 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-03 17:36:50,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,892 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:36:50,897 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:36:50,897 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:36:50,897 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:36:50,898 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (1/1) ... [2025-03-03 17:36:50,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:36:50,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:50,924 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-03 17:36:50,930 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-03 17:36:50,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:36:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:36:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-03 17:36:50,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:36:50,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:36:51,008 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:36:51,010 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:36:51,155 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-03-03 17:36:51,155 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:36:51,162 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:36:51,162 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:36:51,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:36:51 BoogieIcfgContainer [2025-03-03 17:36:51,162 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:36:51,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:36:51,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:36:51,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:36:51,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:36:50" (1/3) ... [2025-03-03 17:36:51,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f107b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:36:51, skipping insertion in model container [2025-03-03 17:36:51,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:36:50" (2/3) ... [2025-03-03 17:36:51,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f107b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:36:51, skipping insertion in model container [2025-03-03 17:36:51,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:36:51" (3/3) ... [2025-03-03 17:36:51,170 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b06.c [2025-03-03 17:36:51,180 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:36:51,181 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_b06.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:36:51,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:36:51,221 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;@5394ee36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:36:51,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:36:51,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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-03 17:36:51,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:36:51,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:51,228 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:36:51,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:51,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:51,232 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:36:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:36:51,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1239085072] [2025-03-03 17:36:51,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:51,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:36:51,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:51,244 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-03 17:36:51,246 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-03 17:36:51,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:36:51,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:36:51,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:51,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:51,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 17:36:51,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:36:51,542 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-03 17:36:51,543 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:36:51,543 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:36:51,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239085072] [2025-03-03 17:36:51,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239085072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:51,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:51,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:36:51,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121625003] [2025-03-03 17:36:51,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:51,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:36:51,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:36:51,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:36:51,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:51,561 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 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) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-03 17:36:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:51,583 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-03 17:36:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:51,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2025-03-03 17:36:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:51,589 INFO L225 Difference]: With dead ends: 17 [2025-03-03 17:36:51,589 INFO L226 Difference]: Without dead ends: 9 [2025-03-03 17:36:51,591 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-03 17:36:51,594 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 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-03 17:36:51,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:36:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-03 17:36:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-03 17:36:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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-03 17:36:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:36:51,612 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:36:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:51,613 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:36:51,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-03 17:36:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:36:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:36:51,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:51,614 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:51,620 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-03 17:36:51,818 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-03 17:36:51,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:51,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:36:51,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:36:51,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [60048839] [2025-03-03 17:36:51,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:51,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:36:51,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:51,821 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-03 17:36:51,822 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-03 17:36:51,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:36:51,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:36:51,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:51,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:51,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 17:36:51,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:36:52,230 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-03 17:36:52,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:36:52,884 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-03 17:36:52,885 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:36:52,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60048839] [2025-03-03 17:36:52,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60048839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:36:52,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:36:52,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 17:36:52,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713629605] [2025-03-03 17:36:52,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:36:52,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:36:52,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:36:52,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:36:52,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:36:52,888 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:53,003 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-03 17:36:53,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:53,004 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 17:36:53,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:53,004 INFO L225 Difference]: With dead ends: 14 [2025-03-03 17:36:53,004 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 17:36:53,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:36:53,005 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:53,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:36:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 17:36:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 17:36:53,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-03 17:36:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-03 17:36:53,009 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-03 17:36:53,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:53,009 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-03 17:36:53,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-03 17:36:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-03 17:36:53,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:53,010 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-03 17:36:53,017 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-03 17:36:53,210 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-03 17:36:53,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:53,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:53,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-03 17:36:53,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:36:53,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773578712] [2025-03-03 17:36:53,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:36:53,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:36:53,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:36:53,215 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-03 17:36:53,216 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-03 17:36:53,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-03 17:36:53,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-03 17:36:53,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:36:53,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:53,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 17:36:53,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:36:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 17:36:53,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:36:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 17:36:53,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:36:53,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773578712] [2025-03-03 17:36:53,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773578712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:36:53,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:36:53,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-03 17:36:53,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103880158] [2025-03-03 17:36:53,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:36:53,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:36:53,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:36:53,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:36:53,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:36:53,990 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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-03 17:36:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:54,055 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2025-03-03 17:36:54,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:54,056 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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 11 [2025-03-03 17:36:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:54,057 INFO L225 Difference]: With dead ends: 12 [2025-03-03 17:36:54,057 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 17:36:54,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:36:54,058 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:54,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 17:36:54,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 17:36:54,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 17:36:54,060 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-03 17:36:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 17:36:54,061 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2025-03-03 17:36:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:54,061 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 17:36:54,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 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-03 17:36:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 17:36:54,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 17:36:54,064 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:36:54,071 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-03 17:36:54,265 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-03 17:36:54,268 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1] [2025-03-03 17:36:54,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 17:36:54,332 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:36:54,338 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-03 17:36:54,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:36:54 BoogieIcfgContainer [2025-03-03 17:36:54,341 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:36:54,341 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:36:54,341 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:36:54,341 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:36:54,342 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:36:51" (3/4) ... [2025-03-03 17:36:54,343 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 17:36:54,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-03 17:36:54,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-03 17:36:54,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 17:36:54,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 17:36:54,351 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 17:36:54,419 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 17:36:54,420 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 17:36:54,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:36:54,421 INFO L158 Benchmark]: Toolchain (without parser) took 3829.33ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 92.0MB in the beginning and 128.6MB in the end (delta: -36.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2025-03-03 17:36:54,423 INFO L158 Benchmark]: CDTParser took 2.04ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:36:54,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.17ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 78.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:36:54,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.60ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:36:54,423 INFO L158 Benchmark]: Boogie Preprocessor took 29.38ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:36:54,424 INFO L158 Benchmark]: IcfgBuilder took 265.69ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 57.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 17:36:54,424 INFO L158 Benchmark]: TraceAbstraction took 3176.80ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 56.8MB in the beginning and 135.4MB in the end (delta: -78.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:36:54,424 INFO L158 Benchmark]: Witness Printer took 78.53ms. Allocated memory is still 176.2MB. Free memory was 135.4MB in the beginning and 128.6MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:36:54,425 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.04ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.17ms. Allocated memory is still 117.4MB. Free memory was 91.8MB in the beginning and 78.0MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.60ms. Allocated memory is still 117.4MB. Free memory was 78.0MB in the beginning and 76.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.38ms. Allocated memory is still 117.4MB. Free memory was 76.4MB in the beginning and 74.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 265.69ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 57.5MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3176.80ms. Allocated memory was 117.4MB in the beginning and 176.2MB in the end (delta: 58.7MB). Free memory was 56.8MB in the beginning and 135.4MB in the end (delta: -78.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 78.53ms. Allocated memory is still 176.2MB. Free memory was 135.4MB in the beginning and 128.6MB in the end (delta: 6.8MB). 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, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 11 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 16, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 13 QuantifiedInterpolants, 1761 SizeOfPredicates, 26 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 5/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: 61]: Location Invariant Derived location invariant: (((((((0 == state_13) || (1 == state_13)) && (2 == var_17)) && (1 == var_39)) && (3 == mask_SORT_11)) && (1 == mask_SORT_1)) && (0 == var_12)) RESULT: Ultimate proved your program to be correct! [2025-03-03 17:36:54,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE