./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.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 ca829ec71663ed4e5ba64ab200a5036617b96aeef2928740446e7c2667cc81d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:37:47,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:37:47,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 09:37:47,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:37:47,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:37:47,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:37:47,923 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:37:47,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:37:47,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:37:47,924 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:37:47,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:37:47,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:37:47,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:37:47,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:37:47,925 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:37:47,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:37:47,926 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:47,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:37:47,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:37:47,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:37:47,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:37:47,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:37:47,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:37:47,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:37:47,927 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 -> ca829ec71663ed4e5ba64ab200a5036617b96aeef2928740446e7c2667cc81d8 [2025-03-08 09:37:48,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:37:48,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:37:48,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:37:48,185 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:37:48,186 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:37:48,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c [2025-03-08 09:37:49,376 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739ad419a/daa5f074e10b4b3bb6d8628f0eeafaaa/FLAG2001bbd4b [2025-03-08 09:37:49,578 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:37:49,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c [2025-03-08 09:37:49,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739ad419a/daa5f074e10b4b3bb6d8628f0eeafaaa/FLAG2001bbd4b [2025-03-08 09:37:49,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/739ad419a/daa5f074e10b4b3bb6d8628f0eeafaaa [2025-03-08 09:37:49,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:37:49,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:37:49,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:49,598 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:37:49,601 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:37:49,602 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,602 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dd5d5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49, skipping insertion in model container [2025-03-08 09:37:49,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:37:49,724 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.vcegar_QF_BV_itc99_b13_p05.c[1266,1279] [2025-03-08 09:37:49,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:49,766 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:37:49,775 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.vcegar_QF_BV_itc99_b13_p05.c[1266,1279] [2025-03-08 09:37:49,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:49,809 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:37:49,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49 WrapperNode [2025-03-08 09:37:49,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:49,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:49,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:37:49,810 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:37:49,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,851 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 240 [2025-03-08 09:37:49,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:49,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:37:49,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:37:49,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:37:49,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,881 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:37:49,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:37:49,896 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:37:49,896 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:37:49,896 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:37:49,901 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (1/1) ... [2025-03-08 09:37:49,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:49,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:49,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:37:49,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:37:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:37:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:37:49,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:37:49,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:37:50,023 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:37:50,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:37:50,283 INFO L? ?]: Removed 68 outVars from TransFormulas that were not future-live. [2025-03-08 09:37:50,284 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:37:50,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:37:50,303 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:37:50,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:50 BoogieIcfgContainer [2025-03-08 09:37:50,303 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:37:50,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:37:50,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:37:50,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:37:50,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:37:49" (1/3) ... [2025-03-08 09:37:50,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461d47b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:50, skipping insertion in model container [2025-03-08 09:37:50,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:49" (2/3) ... [2025-03-08 09:37:50,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461d47b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:50, skipping insertion in model container [2025-03-08 09:37:50,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:50" (3/3) ... [2025-03-08 09:37:50,312 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c [2025-03-08 09:37:50,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:37:50,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c that has 1 procedures, 42 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:37:50,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:37:50,365 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;@5a1a07f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:37:50,366 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:37:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 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-08 09:37:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 09:37:50,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:50,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:50,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:50,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash 328147339, now seen corresponding path program 1 times [2025-03-08 09:37:50,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:50,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271326196] [2025-03-08 09:37:50,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:50,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:50,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 09:37:50,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 09:37:50,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:50,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:50,783 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-08 09:37:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271326196] [2025-03-08 09:37:50,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271326196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:50,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:50,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075056584] [2025-03-08 09:37:50,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:50,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:50,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:50,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:50,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:50,803 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.475) internal successors, (59), 41 states have internal predecessors, (59), 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 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-08 09:37:50,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:50,856 INFO L93 Difference]: Finished difference Result 69 states and 99 transitions. [2025-03-08 09:37:50,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:50,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 09:37:50,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:50,862 INFO L225 Difference]: With dead ends: 69 [2025-03-08 09:37:50,862 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 09:37:50,864 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-08 09:37:50,867 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:50,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:37:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 09:37:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-08 09:37:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.425) internal successors, (57), 40 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 09:37:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 57 transitions. [2025-03-08 09:37:50,892 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 57 transitions. Word has length 15 [2025-03-08 09:37:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:50,893 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 57 transitions. [2025-03-08 09:37:50,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-08 09:37:50,893 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 57 transitions. [2025-03-08 09:37:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 09:37:50,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:50,893 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:50,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 09:37:50,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:50,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1587312083, now seen corresponding path program 1 times [2025-03-08 09:37:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:50,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158871124] [2025-03-08 09:37:50,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:50,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 09:37:50,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 09:37:50,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:50,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:51,014 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-08 09:37:51,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:51,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158871124] [2025-03-08 09:37:51,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158871124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:51,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:51,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:51,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404477721] [2025-03-08 09:37:51,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:51,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:51,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:51,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:51,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:51,017 INFO L87 Difference]: Start difference. First operand 41 states and 57 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:37:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:51,059 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2025-03-08 09:37:51,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:51,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2025-03-08 09:37:51,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:51,060 INFO L225 Difference]: With dead ends: 70 [2025-03-08 09:37:51,060 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 09:37:51,060 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-08 09:37:51,061 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:51,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:37:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 09:37:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 09:37:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 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-08 09:37:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2025-03-08 09:37:51,066 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 16 [2025-03-08 09:37:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:51,066 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2025-03-08 09:37:51,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-08 09:37:51,066 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2025-03-08 09:37:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 09:37:51,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:51,067 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:51,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:37:51,067 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:51,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash -401423738, now seen corresponding path program 1 times [2025-03-08 09:37:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:51,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370711073] [2025-03-08 09:37:51,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:51,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:51,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 09:37:51,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 09:37:51,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:51,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:51,236 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-08 09:37:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:37:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370711073] [2025-03-08 09:37:51,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370711073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:51,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:51,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:51,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165093688] [2025-03-08 09:37:51,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:51,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:37:51,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:51,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:51,239 INFO L87 Difference]: Start difference. First operand 43 states and 59 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-08 09:37:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:51,288 INFO L93 Difference]: Finished difference Result 70 states and 96 transitions. [2025-03-08 09:37:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:51,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2025-03-08 09:37:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:51,290 INFO L225 Difference]: With dead ends: 70 [2025-03-08 09:37:51,290 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 09:37:51,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:37:51,291 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:51,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 81 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:37:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 09:37:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-08 09:37:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 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-08 09:37:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2025-03-08 09:37:51,297 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 17 [2025-03-08 09:37:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:51,298 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2025-03-08 09:37:51,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-08 09:37:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2025-03-08 09:37:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 09:37:51,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:51,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 09:37:51,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:37:51,300 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:51,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash -258038765, now seen corresponding path program 1 times [2025-03-08 09:37:51,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:37:51,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520497671] [2025-03-08 09:37:51,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:37:51,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 09:37:51,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 09:37:51,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:51,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:37:51,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:37:51,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 09:37:51,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 09:37:51,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:51,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:37:51,373 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:37:51,374 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:37:51,375 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:37:51,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 09:37:51,378 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 09:37:51,392 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 09:37:51,397 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:37:51,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:37:51 BoogieIcfgContainer [2025-03-08 09:37:51,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:37:51,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:37:51,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:37:51,401 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:37:51,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:50" (3/4) ... [2025-03-08 09:37:51,403 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:37:51,403 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:37:51,404 INFO L158 Benchmark]: Toolchain (without parser) took 1806.67ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 112.1MB in the beginning and 357.1MB in the end (delta: -245.1MB). Peak memory consumption was 2.3MB. Max. memory is 16.1GB. [2025-03-08 09:37:51,404 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:51,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.88ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 99.1MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:37:51,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.05ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 95.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:51,404 INFO L158 Benchmark]: Boogie Preprocessor took 43.77ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:51,404 INFO L158 Benchmark]: IcfgBuilder took 407.28ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 67.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:37:51,404 INFO L158 Benchmark]: TraceAbstraction took 1095.29ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 66.3MB in the beginning and 357.2MB in the end (delta: -290.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:51,405 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 394.3MB. Free memory was 357.2MB in the beginning and 357.1MB in the end (delta: 24.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:51,405 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.27ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.88ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 99.1MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.05ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 95.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.77ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 92.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 407.28ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 67.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1095.29ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 66.3MB in the beginning and 357.2MB in the end (delta: -290.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 394.3MB. Free memory was 357.2MB in the beginning and 357.1MB in the end (delta: 24.1kB). 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 114. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_7 mask_SORT_7 = (SORT_7)-1 >> (sizeof(SORT_7) * 8 - 4); [L33] const SORT_7 msb_SORT_7 = (SORT_7)1 << (4 - 1); [L35] const SORT_62 mask_SORT_62 = (SORT_62)-1 >> (sizeof(SORT_62) * 8 - 10); [L36] const SORT_62 msb_SORT_62 = (SORT_62)1 << (10 - 1); [L38] const SORT_7 var_8 = 0; [L39] const SORT_1 var_16 = 1; [L40] const SORT_1 var_20 = 0; [L42] SORT_1 input_2; [L43] SORT_3 input_4; [L44] SORT_1 input_5; [L45] SORT_1 input_6; [L46] SORT_1 input_23; [L47] SORT_1 input_25; [L48] SORT_1 input_27; [L49] SORT_1 input_29; [L50] SORT_1 input_31; [L51] SORT_1 input_33; [L52] SORT_1 input_35; [L53] SORT_1 input_37; [L54] SORT_1 input_39; [L55] SORT_1 input_41; [L56] SORT_1 input_43; [L57] SORT_3 input_45; [L58] SORT_1 input_48; [L59] SORT_1 input_50; [L60] SORT_1 input_52; [L61] SORT_1 input_54; [L62] SORT_1 input_56; [L63] SORT_1 input_58; [L64] SORT_1 input_60; [L65] SORT_62 input_63; [L66] SORT_1 input_65; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_7=15, var_16=1, var_20=0, var_8=0] [L68] SORT_7 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_7 VAL [mask_SORT_1=1, mask_SORT_7=15, var_16=1, var_20=0, var_8=0] [L69] SORT_7 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_7; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_7=15, var_16=1, var_20=0, var_8=0] [L70] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] SORT_7 init_10_arg_1 = var_8; [L73] state_9 = init_10_arg_1 [L74] SORT_7 init_12_arg_1 = var_8; [L75] state_11 = init_12_arg_1 [L76] SORT_1 init_22_arg_1 = var_20; [L77] state_21 = init_22_arg_1 VAL [mask_SORT_1=1, mask_SORT_7=15, state_11=0, state_21=0, state_9=0, var_16=1, var_20=0] [L80] input_2 = __VERIFIER_nondet_uchar() [L81] input_4 = __VERIFIER_nondet_uchar() [L82] input_5 = __VERIFIER_nondet_uchar() [L83] input_6 = __VERIFIER_nondet_uchar() [L84] input_23 = __VERIFIER_nondet_uchar() [L85] input_25 = __VERIFIER_nondet_uchar() [L86] input_27 = __VERIFIER_nondet_uchar() [L87] input_29 = __VERIFIER_nondet_uchar() [L88] input_31 = __VERIFIER_nondet_uchar() [L89] input_33 = __VERIFIER_nondet_uchar() [L90] input_35 = __VERIFIER_nondet_uchar() [L91] input_37 = __VERIFIER_nondet_uchar() [L92] input_39 = __VERIFIER_nondet_uchar() [L93] input_41 = __VERIFIER_nondet_uchar() [L94] input_43 = __VERIFIER_nondet_uchar() [L95] input_45 = __VERIFIER_nondet_uchar() [L96] input_48 = __VERIFIER_nondet_uchar() [L97] input_50 = __VERIFIER_nondet_uchar() [L98] input_52 = __VERIFIER_nondet_uchar() [L99] input_54 = __VERIFIER_nondet_uchar() [L100] input_56 = __VERIFIER_nondet_uchar() [L101] input_58 = __VERIFIER_nondet_uchar() [L102] input_60 = __VERIFIER_nondet_uchar() [L103] input_63 = __VERIFIER_nondet_ushort() [L104] input_65 = __VERIFIER_nondet_uchar() [L107] SORT_7 var_13_arg_0 = state_9; [L108] SORT_7 var_13_arg_1 = state_11; [L109] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L110] SORT_1 var_17_arg_0 = var_13; [L111] SORT_1 var_17 = ~var_17_arg_0; [L112] SORT_1 var_18_arg_0 = var_16; [L113] SORT_1 var_18_arg_1 = var_17; VAL [mask_SORT_1=1, mask_SORT_7=15, state_11=0, state_21=0, state_9=0, var_16=1, var_18_arg_0=1, var_18_arg_1=-2, var_20=0] [L114] EXPR var_18_arg_0 & var_18_arg_1 VAL [mask_SORT_1=1, mask_SORT_7=15, state_11=0, state_21=0, state_9=0, var_16=1, var_20=0] [L114] SORT_1 var_18 = var_18_arg_0 & var_18_arg_1; [L115] EXPR var_18 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_7=15, state_11=0, state_21=0, state_9=0, var_16=1, var_20=0] [L115] var_18 = var_18 & mask_SORT_1 [L116] SORT_1 bad_19_arg_0 = var_18; [L117] CALL __VERIFIER_assert(!(bad_19_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 59 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 338 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 131 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=2, InterpolantAutomatonStates: 12, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 45 ConstructedInterpolants, 0 QuantifiedInterpolants, 98 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-08 09:37:51,418 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.vcegar_QF_BV_itc99_b13_p05.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 ca829ec71663ed4e5ba64ab200a5036617b96aeef2928740446e7c2667cc81d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:37:53,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:37:53,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 09:37:53,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:37:53,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:37:53,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:37:53,367 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:37:53,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:37:53,367 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:37:53,367 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:37:53,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:37:53,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:37:53,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:37:53,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:37:53,368 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:37:53,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:37:53,368 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:37:53,369 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:53,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:37:53,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:37:53,370 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:37:53,370 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:37:53,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:37:53,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:37:53,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:37:53,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:37:53,370 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 -> ca829ec71663ed4e5ba64ab200a5036617b96aeef2928740446e7c2667cc81d8 [2025-03-08 09:37:53,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:37:53,617 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:37:53,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:37:53,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:37:53,620 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:37:53,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c [2025-03-08 09:37:54,817 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845077354/bbd90f0e25f5416c87ce5bb28de86801/FLAG6b5acaca8 [2025-03-08 09:37:55,065 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:37:55,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c [2025-03-08 09:37:55,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845077354/bbd90f0e25f5416c87ce5bb28de86801/FLAG6b5acaca8 [2025-03-08 09:37:55,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845077354/bbd90f0e25f5416c87ce5bb28de86801 [2025-03-08 09:37:55,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:37:55,398 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:37:55,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:55,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:37:55,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:37:55,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e592efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55, skipping insertion in model container [2025-03-08 09:37:55,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:37:55,525 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.vcegar_QF_BV_itc99_b13_p05.c[1266,1279] [2025-03-08 09:37:55,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:55,581 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:37:55,589 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.vcegar_QF_BV_itc99_b13_p05.c[1266,1279] [2025-03-08 09:37:55,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:37:55,632 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:37:55,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55 WrapperNode [2025-03-08 09:37:55,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:37:55,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:55,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:37:55,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:37:55,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,666 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 176 [2025-03-08 09:37:55,670 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:37:55,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:37:55,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:37:55,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:37:55,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,694 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 09:37:55,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,698 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:37:55,704 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:37:55,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:37:55,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:37:55,707 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (1/1) ... [2025-03-08 09:37:55,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:37:55,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:55,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 09:37:55,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 09:37:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:37:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:37:55,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:37:55,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:37:55,823 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:37:55,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:37:55,964 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 09:37:55,965 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:37:55,972 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:37:55,972 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:37:55,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:55 BoogieIcfgContainer [2025-03-08 09:37:55,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:37:55,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:37:55,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:37:55,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:37:55,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:37:55" (1/3) ... [2025-03-08 09:37:55,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a50f1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:55, skipping insertion in model container [2025-03-08 09:37:55,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:37:55" (2/3) ... [2025-03-08 09:37:55,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a50f1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:37:55, skipping insertion in model container [2025-03-08 09:37:55,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:55" (3/3) ... [2025-03-08 09:37:55,980 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c [2025-03-08 09:37:55,990 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:37:55,992 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p05.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:37:56,027 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:37:56,038 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;@12a0ec60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:37:56,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:37:56,041 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-08 09:37:56,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 09:37:56,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:37:56,045 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 09:37:56,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:37:56,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:37:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 09:37:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:37:56,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [171392007] [2025-03-08 09:37:56,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:37:56,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:37:56,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:37:56,060 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 09:37:56,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 09:37:56,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 09:37:56,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 09:37:56,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:37:56,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:37:56,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 09:37:56,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:37:56,328 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-08 09:37:56,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:37:56,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:37:56,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171392007] [2025-03-08 09:37:56,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171392007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:37:56,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:37:56,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 09:37:56,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431386375] [2025-03-08 09:37:56,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:37:56,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 09:37:56,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:37:56,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 09:37:56,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 09:37:56,347 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-08 09:37:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:37:56,372 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2025-03-08 09:37:56,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 09:37:56,375 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-08 09:37:56,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:37:56,378 INFO L225 Difference]: With dead ends: 13 [2025-03-08 09:37:56,378 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 09:37:56,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 09:37:56,382 INFO L435 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:37:56,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:37:56,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 09:37:56,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 09:37:56,397 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-08 09:37:56,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 09:37:56,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2025-03-08 09:37:56,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:37:56,401 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 09:37:56,401 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-08 09:37:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 09:37:56,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 09:37:56,403 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:37:56,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 09:37:56,604 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-08 09:37:56,606 INFO L422 BasicCegarLoop]: Path program histogram: [1] [2025-03-08 09:37:56,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 09:37:56,622 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:37:56,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:37:56 BoogieIcfgContainer [2025-03-08 09:37:56,632 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:37:56,633 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:37:56,633 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:37:56,634 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:37:56,634 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:37:55" (3/4) ... [2025-03-08 09:37:56,636 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 09:37:56,645 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-08 09:37:56,645 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 09:37:56,645 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 09:37:56,646 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 09:37:56,719 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 09:37:56,719 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 09:37:56,720 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:37:56,720 INFO L158 Benchmark]: Toolchain (without parser) took 1322.15ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 41.5MB in the end (delta: 35.3MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2025-03-08 09:37:56,720 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:56,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.99ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 63.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:37:56,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.45ms. Allocated memory is still 100.7MB. Free memory was 63.4MB in the beginning and 61.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:37:56,723 INFO L158 Benchmark]: Boogie Preprocessor took 32.93ms. Allocated memory is still 100.7MB. Free memory was 61.8MB in the beginning and 60.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:56,723 INFO L158 Benchmark]: IcfgBuilder took 269.28ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 46.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:37:56,723 INFO L158 Benchmark]: TraceAbstraction took 657.42ms. Allocated memory is still 100.7MB. Free memory was 45.5MB in the beginning and 48.2MB in the end (delta: -2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:37:56,723 INFO L158 Benchmark]: Witness Printer took 86.63ms. Allocated memory is still 100.7MB. Free memory was 48.2MB in the beginning and 41.5MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 09:37:56,724 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.30ms. Allocated memory is still 83.9MB. Free memory is still 46.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.99ms. Allocated memory is still 100.7MB. Free memory was 76.6MB in the beginning and 63.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.45ms. Allocated memory is still 100.7MB. Free memory was 63.4MB in the beginning and 61.8MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.93ms. Allocated memory is still 100.7MB. Free memory was 61.8MB in the beginning and 60.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 269.28ms. Allocated memory is still 100.7MB. Free memory was 60.0MB in the beginning and 46.2MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 657.42ms. Allocated memory is still 100.7MB. Free memory was 45.5MB in the beginning and 48.2MB in the end (delta: -2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 86.63ms. Allocated memory is still 100.7MB. Free memory was 48.2MB in the beginning and 41.5MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 11 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=0, InterpolantAutomatonStates: 4, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 SizeOfPredicates, 3 NumberOfNonLiveVariables, 42 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 78]: Location Invariant Derived location invariant: ((state_9 == state_11) && (1 == mask_SORT_1)) RESULT: Ultimate proved your program to be correct! [2025-03-08 09:37:56,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE