./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.noninitstate.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.noninitstate.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 cb35da9c160c8cc3a4e8eb0847ad52031566203029d285a75392d741632a8daa --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:44:07,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:44:07,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 07:44:07,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:44:07,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:44:07,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:44:07,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:44:07,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:44:07,612 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:44:07,612 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:44:07,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:44:07,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:44:07,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:44:07,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:44:07,613 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:44:07,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:44:07,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:44:07,614 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 07:44:07,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:44:07,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:44:07,614 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:44:07,614 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:44:07,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:44:07,614 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:44:07,615 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:44:07,615 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:44:07,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 07:44:07,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:44:07,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:44:07,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:44:07,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:44:07,616 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-jdk21/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 -> cb35da9c160c8cc3a4e8eb0847ad52031566203029d285a75392d741632a8daa [2025-01-09 07:44:07,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:44:07,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:44:07,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:44:07,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:44:07,853 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:44:07,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.noninitstate.c [2025-01-09 07:44:09,049 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68c0e9dc4/df8891f8bb1a434987a2b31978a7efdd/FLAG102a5e09b [2025-01-09 07:44:09,303 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:44:09,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.noninitstate.c [2025-01-09 07:44:09,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68c0e9dc4/df8891f8bb1a434987a2b31978a7efdd/FLAG102a5e09b [2025-01-09 07:44:09,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/68c0e9dc4/df8891f8bb1a434987a2b31978a7efdd [2025-01-09 07:44:09,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:44:09,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:44:09,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:44:09,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:44:09,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:44:09,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22beacaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09, skipping insertion in model container [2025-01-09 07:44:09,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,639 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:44:09,736 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.noninitstate.c[1262,1275] [2025-01-09 07:44:09,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:44:09,774 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:44:09,782 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.noninitstate.c[1262,1275] [2025-01-09 07:44:09,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:44:09,808 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:44:09,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09 WrapperNode [2025-01-09 07:44:09,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:44:09,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:44:09,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:44:09,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:44:09,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,863 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2025-01-09 07:44:09,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:44:09,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:44:09,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:44:09,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:44:09,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,899 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-01-09 07:44:09,899 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,899 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,911 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,913 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:44:09,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:44:09,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:44:09,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:44:09,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (1/1) ... [2025-01-09 07:44:09,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:44:09,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:44:09,963 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:44:09,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:44:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:44:09,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 07:44:09,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:44:09,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:44:10,033 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:44:10,038 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:44:10,311 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-01-09 07:44:10,313 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:44:10,322 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:44:10,324 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:44:10,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:44:10 BoogieIcfgContainer [2025-01-09 07:44:10,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:44:10,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:44:10,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:44:10,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:44:10,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:44:09" (1/3) ... [2025-01-09 07:44:10,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffb783c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:44:10, skipping insertion in model container [2025-01-09 07:44:10,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:09" (2/3) ... [2025-01-09 07:44:10,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffb783c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:44:10, skipping insertion in model container [2025-01-09 07:44:10,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:44:10" (3/3) ... [2025-01-09 07:44:10,333 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.noninitstate.c [2025-01-09 07:44:10,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:44:10,345 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.noninitstate.c that has 1 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:44:10,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:44:10,391 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;@41f63622, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:44:10,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:44:10,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 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-01-09 07:44:10,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 07:44:10,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:44:10,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:44:10,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:44:10,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:44:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1000546054, now seen corresponding path program 1 times [2025-01-09 07:44:10,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:44:10,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918201617] [2025-01-09 07:44:10,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:44:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:44:10,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 07:44:10,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 07:44:10,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:44:10,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:44:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:44:10,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:44:10,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918201617] [2025-01-09 07:44:10,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918201617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:44:10,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:44:10,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 07:44:10,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995854461] [2025-01-09 07:44:10,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:44:10,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 07:44:10,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:44:10,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 07:44:10,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 07:44:10,587 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-01-09 07:44:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:44:10,601 INFO L93 Difference]: Finished difference Result 87 states and 126 transitions. [2025-01-09 07:44:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 07:44:10,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-01-09 07:44:10,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:44:10,608 INFO L225 Difference]: With dead ends: 87 [2025-01-09 07:44:10,608 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 07:44:10,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 07:44:10,613 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:44:10,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:44:10,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 07:44:10,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 07:44:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.4375) internal successors, (69), 48 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:44:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2025-01-09 07:44:10,640 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 17 [2025-01-09 07:44:10,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:44:10,642 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2025-01-09 07:44:10,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-01-09 07:44:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2025-01-09 07:44:10,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 07:44:10,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:44:10,643 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:44:10,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 07:44:10,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:44:10,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:44:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1000605636, now seen corresponding path program 1 times [2025-01-09 07:44:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:44:10,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91018357] [2025-01-09 07:44:10,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:44:10,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:44:10,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 07:44:10,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 07:44:10,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:44:10,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:44:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:44:10,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:44:10,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91018357] [2025-01-09 07:44:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91018357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:44:10,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:44:10,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:44:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489633004] [2025-01-09 07:44:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:44:10,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:44:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:44:10,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:44:10,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:44:10,916 INFO L87 Difference]: Start difference. First operand 49 states and 69 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-01-09 07:44:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:44:11,023 INFO L93 Difference]: Finished difference Result 84 states and 118 transitions. [2025-01-09 07:44:11,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:44:11,023 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-01-09 07:44:11,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:44:11,024 INFO L225 Difference]: With dead ends: 84 [2025-01-09 07:44:11,024 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 07:44:11,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:44:11,025 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 56 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:44:11,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 07:44:11,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 07:44:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 07:44:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:44:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 67 transitions. [2025-01-09 07:44:11,028 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 67 transitions. Word has length 17 [2025-01-09 07:44:11,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:44:11,028 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 67 transitions. [2025-01-09 07:44:11,028 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-01-09 07:44:11,028 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 67 transitions. [2025-01-09 07:44:11,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 07:44:11,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:44:11,029 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:44:11,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 07:44:11,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:44:11,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:44:11,030 INFO L85 PathProgramCache]: Analyzing trace with hash 125431649, now seen corresponding path program 1 times [2025-01-09 07:44:11,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:44:11,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306903827] [2025-01-09 07:44:11,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:44:11,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:44:11,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 07:44:11,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 07:44:11,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:44:11,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:44:11,048 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 07:44:11,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 07:44:11,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 07:44:11,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:44:11,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:44:11,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 07:44:11,072 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 07:44:11,073 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 07:44:11,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 07:44:11,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 07:44:11,092 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 07:44:11,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 07:44:11 BoogieIcfgContainer [2025-01-09 07:44:11,094 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 07:44:11,095 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 07:44:11,095 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 07:44:11,095 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 07:44:11,095 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:44:10" (3/4) ... [2025-01-09 07:44:11,097 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 07:44:11,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 07:44:11,098 INFO L158 Benchmark]: Toolchain (without parser) took 1475.68ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 65.5MB in the end (delta: 40.6MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2025-01-09 07:44:11,098 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:44:11,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.92ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 93.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:44:11,098 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.06ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 89.2MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:44:11,099 INFO L158 Benchmark]: Boogie Preprocessor took 60.91ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:44:11,099 INFO L158 Benchmark]: RCFGBuilder took 394.42ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 62.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 07:44:11,099 INFO L158 Benchmark]: TraceAbstraction took 768.67ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 65.5MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:44:11,099 INFO L158 Benchmark]: Witness Printer took 2.78ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 65.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:44:11,100 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 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.92ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 93.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.06ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 89.2MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.91ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 87.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 394.42ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 62.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 768.67ms. Allocated memory is still 142.6MB. Free memory was 61.1MB in the beginning and 65.5MB in the end (delta: -4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.78ms. Allocated memory is still 142.6MB. Free memory was 65.5MB in the beginning and 65.5MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 22]: 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 51. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_1 var_10 = 1; [L31] const SORT_1 var_13 = 0; [L33] SORT_1 input_2; [L35] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, var_10=1, var_13=0] [L35] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L36] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, state_3=0, var_10=1, var_13=0] [L36] SORT_1 state_4 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L37] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, state_3=0, state_4=0, var_10=1, var_13=0] [L37] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L39] SORT_1 init_12_arg_1 = var_10; [L40] state_11 = init_12_arg_1 VAL [mask_SORT_1=1, state_11=1, state_3=0, state_4=0, var_13=0] [L43] input_2 = __VERIFIER_nondet_uchar() [L44] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, state_11=1, state_3=0, state_4=0, var_13=0] [L44] input_2 = input_2 & mask_SORT_1 [L46] SORT_1 var_9_arg_0 = state_3; [L47] SORT_1 var_9_arg_1 = state_4; [L48] SORT_1 var_9 = var_9_arg_0 == var_9_arg_1; [L49] SORT_1 var_15_arg_0 = state_11; [L50] SORT_1 var_15_arg_1 = ~var_9; VAL [input_2=0, mask_SORT_1=1, state_3=0, state_4=0, var_13=0, var_15_arg_0=1, var_15_arg_1=-2, var_9=1] [L51] EXPR var_15_arg_1 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, state_3=0, state_4=0, var_13=0, var_15_arg_0=1, var_9=1] [L51] var_15_arg_1 = var_15_arg_1 & mask_SORT_1 [L52] SORT_1 var_15 = !var_15_arg_0 || var_15_arg_1; [L53] SORT_1 constr_16_arg_0 = var_15; [L54] CALL assume_abort_if_not(constr_16_arg_0) [L23] COND FALSE !(!cond) [L54] RET assume_abort_if_not(constr_16_arg_0) [L56] SORT_1 bad_17_arg_0 = var_9; [L57] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 88 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 71 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-01-09 07:44:11,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.noninitstate.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 cb35da9c160c8cc3a4e8eb0847ad52031566203029d285a75392d741632a8daa --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:44:13,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:44:13,358 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 07:44:13,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:44:13,365 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:44:13,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:44:13,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:44:13,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:44:13,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:44:13,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:44:13,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:44:13,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:44:13,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:44:13,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:44:13,393 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:44:13,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:44:13,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:44:13,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:44:13,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:44:13,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:44:13,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:44:13,394 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 07:44:13,394 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 07:44:13,395 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 07:44:13,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:44:13,395 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:44:13,395 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:44:13,395 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:44:13,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:44:13,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:44:13,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:44:13,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:44:13,396 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:44:13,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:44:13,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:44:13,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:44:13,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:44:13,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:44:13,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:44:13,397 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:44:13,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:44:13,397 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 07:44:13,397 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 07:44:13,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:44:13,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:44:13,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:44:13,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:44:13,397 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-jdk21/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 -> cb35da9c160c8cc3a4e8eb0847ad52031566203029d285a75392d741632a8daa [2025-01-09 07:44:13,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:44:13,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:44:13,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:44:13,699 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:44:13,700 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:44:13,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.noninitstate.c [2025-01-09 07:44:14,901 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2588ee600/fc8a689cf1be4ccba9aa342872c0f2e4/FLAG1db37cdf3 [2025-01-09 07:44:15,104 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:44:15,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.noninitstate.c [2025-01-09 07:44:15,110 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2588ee600/fc8a689cf1be4ccba9aa342872c0f2e4/FLAG1db37cdf3 [2025-01-09 07:44:15,475 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2588ee600/fc8a689cf1be4ccba9aa342872c0f2e4 [2025-01-09 07:44:15,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:44:15,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:44:15,482 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:44:15,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:44:15,486 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:44:15,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,487 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63582138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15, skipping insertion in model container [2025-01-09 07:44:15,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:44:15,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.noninitstate.c[1262,1275] [2025-01-09 07:44:15,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:44:15,632 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:44:15,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.noninitstate.c[1262,1275] [2025-01-09 07:44:15,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:44:15,667 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:44:15,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15 WrapperNode [2025-01-09 07:44:15,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:44:15,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:44:15,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:44:15,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:44:15,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,680 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,693 INFO L138 Inliner]: procedures = 17, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2025-01-09 07:44:15,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:44:15,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:44:15,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:44:15,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:44:15,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,706 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,713 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-01-09 07:44:15,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:44:15,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:44:15,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:44:15,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:44:15,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (1/1) ... [2025-01-09 07:44:15,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:44:15,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:44:15,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:44:15,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:44:15,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:44:15,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 07:44:15,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:44:15,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:44:15,856 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:44:15,858 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:44:15,992 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 07:44:15,992 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:44:15,999 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:44:16,000 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:44:16,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:44:16 BoogieIcfgContainer [2025-01-09 07:44:16,000 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:44:16,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:44:16,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:44:16,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:44:16,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:44:15" (1/3) ... [2025-01-09 07:44:16,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9e2435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:44:16, skipping insertion in model container [2025-01-09 07:44:16,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:44:15" (2/3) ... [2025-01-09 07:44:16,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9e2435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:44:16, skipping insertion in model container [2025-01-09 07:44:16,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:44:16" (3/3) ... [2025-01-09 07:44:16,009 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.noninitstate.c [2025-01-09 07:44:16,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:44:16,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.noninitstate.c that has 1 procedures, 12 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:44:16,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:44:16,055 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;@80d4690, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:44:16,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:44:16,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:44:16,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 07:44:16,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:44:16,061 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:44:16,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:44:16,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:44:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1805890889, now seen corresponding path program 1 times [2025-01-09 07:44:16,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:44:16,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [367402629] [2025-01-09 07:44:16,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:44:16,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:44:16,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:44:16,074 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:44:16,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 07:44:16,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 07:44:16,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 07:44:16,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:44:16,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:44:16,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 07:44:16,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:44:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:44:16,177 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:44:16,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:44:16,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367402629] [2025-01-09 07:44:16,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367402629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:44:16,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:44:16,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 07:44:16,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947053302] [2025-01-09 07:44:16,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:44:16,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 07:44:16,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 07:44:16,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 07:44:16,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 07:44:16,203 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-01-09 07:44:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:44:16,210 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2025-01-09 07:44:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 07:44:16,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 07:44:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:44:16,217 INFO L225 Difference]: With dead ends: 19 [2025-01-09 07:44:16,218 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 07:44:16,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 07:44:16,223 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:44:16,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:44:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 07:44:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-01-09 07:44:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:44:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 07:44:16,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2025-01-09 07:44:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:44:16,245 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 07:44:16,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-01-09 07:44:16,245 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 07:44:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 07:44:16,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:44:16,246 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:44:16,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 07:44:16,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:44:16,450 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:44:16,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:44:16,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1805950471, now seen corresponding path program 1 times [2025-01-09 07:44:16,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:44:16,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1870452636] [2025-01-09 07:44:16,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:44:16,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:44:16,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:44:16,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:44:16,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 07:44:16,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 07:44:16,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 07:44:16,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:44:16,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:44:16,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 07:44:16,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:44:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:44:16,751 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:44:16,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:44:16,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870452636] [2025-01-09 07:44:16,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870452636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:44:16,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:44:16,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:44:16,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882420021] [2025-01-09 07:44:16,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:44:16,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:44:16,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 07:44:16,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:44:16,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:44:16,752 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-01-09 07:44:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:44:16,781 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-01-09 07:44:16,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:44:16,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 07:44:16,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:44:16,782 INFO L225 Difference]: With dead ends: 15 [2025-01-09 07:44:16,782 INFO L226 Difference]: Without dead ends: 13 [2025-01-09 07:44:16,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:44:16,782 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:44:16,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:44:16,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-01-09 07:44:16,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-01-09 07:44:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 07:44:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-01-09 07:44:16,789 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2025-01-09 07:44:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:44:16,789 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-01-09 07:44:16,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-01-09 07:44:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-01-09 07:44:16,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-01-09 07:44:16,790 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:44:16,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 07:44:16,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 07:44:16,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:44:16,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:44:16,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:44:16,993 INFO L85 PathProgramCache]: Analyzing trace with hash -169791069, now seen corresponding path program 1 times [2025-01-09 07:44:16,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:44:16,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936465014] [2025-01-09 07:44:16,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:44:16,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:44:16,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:44:16,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:44:16,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 07:44:17,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 07:44:17,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 07:44:17,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:44:17,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:44:17,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 07:44:17,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-09 07:44:17,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-09 07:44:17,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:44:17,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:44:17,147 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-01-09 07:44:17,150 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 07:44:17,151 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 07:44:17,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 07:44:17,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:44:17,363 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 07:44:17,379 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 07:44:17,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 07:44:17 BoogieIcfgContainer [2025-01-09 07:44:17,381 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 07:44:17,382 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 07:44:17,382 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 07:44:17,382 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 07:44:17,383 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:44:16" (3/4) ... [2025-01-09 07:44:17,383 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 07:44:17,413 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-01-09 07:44:17,443 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 07:44:17,443 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 07:44:17,444 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 07:44:17,444 INFO L158 Benchmark]: Toolchain (without parser) took 1963.14ms. Allocated memory is still 117.4MB. Free memory was 91.1MB in the beginning and 56.9MB in the end (delta: 34.1MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2025-01-09 07:44:17,444 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:44:17,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.94ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 79.0MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:44:17,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.93ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:44:17,445 INFO L158 Benchmark]: Boogie Preprocessor took 35.05ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 76.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:44:17,445 INFO L158 Benchmark]: RCFGBuilder took 270.96ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 63.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 07:44:17,445 INFO L158 Benchmark]: TraceAbstraction took 1379.37ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 62.9MB in the end (delta: 81.2kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2025-01-09 07:44:17,445 INFO L158 Benchmark]: Witness Printer took 61.63ms. Allocated memory is still 117.4MB. Free memory was 62.9MB in the beginning and 56.9MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:44:17,446 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 83.9MB. Free memory is still 61.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.94ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 79.0MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.93ms. Allocated memory is still 117.4MB. Free memory was 79.0MB in the beginning and 77.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.05ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 76.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 270.96ms. Allocated memory is still 117.4MB. Free memory was 76.1MB in the beginning and 63.7MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1379.37ms. Allocated memory is still 117.4MB. Free memory was 63.0MB in the beginning and 62.9MB in the end (delta: 81.2kB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Witness Printer took 61.63ms. Allocated memory is still 117.4MB. Free memory was 62.9MB in the beginning and 56.9MB in the end (delta: 6.0MB). 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 - CounterExampleResult [Line: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_1 var_10 = 1; [L31] const SORT_1 var_13 = 0; [L33] SORT_1 input_2; [L35] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L36] SORT_1 state_4 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L37] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L39] SORT_1 init_12_arg_1 = var_10; [L40] state_11 = init_12_arg_1 VAL [mask_SORT_1=1, state_11=1, state_3=0, state_4=1, var_13=0] [L43] input_2 = __VERIFIER_nondet_uchar() [L44] input_2 = input_2 & mask_SORT_1 [L46] SORT_1 var_9_arg_0 = state_3; [L47] SORT_1 var_9_arg_1 = state_4; [L48] SORT_1 var_9 = var_9_arg_0 == var_9_arg_1; [L49] SORT_1 var_15_arg_0 = state_11; [L50] SORT_1 var_15_arg_1 = ~var_9; [L51] var_15_arg_1 = var_15_arg_1 & mask_SORT_1 [L52] SORT_1 var_15 = !var_15_arg_0 || var_15_arg_1; [L53] SORT_1 constr_16_arg_0 = var_15; [L54] CALL assume_abort_if_not(constr_16_arg_0) [L23] COND FALSE !(!cond) [L54] RET assume_abort_if_not(constr_16_arg_0) [L56] SORT_1 bad_17_arg_0 = var_9; [L57] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L22] COND FALSE !(!(cond)) [L57] RET __VERIFIER_assert(!(bad_17_arg_0)) [L59] SORT_1 var_5_arg_0 = ~input_2; [L60] var_5_arg_0 = var_5_arg_0 & mask_SORT_1 [L61] SORT_1 var_5_arg_1 = ~state_3; [L62] var_5_arg_1 = var_5_arg_1 & mask_SORT_1 [L63] SORT_1 var_5_arg_2 = state_3; [L64] SORT_1 var_5 = var_5_arg_0 ? var_5_arg_1 : var_5_arg_2; [L65] var_5 = var_5 & mask_SORT_1 [L66] SORT_1 next_7_arg_1 = var_5; [L67] SORT_1 var_6_arg_0 = input_2; [L68] SORT_1 var_6_arg_1 = ~state_4; [L69] var_6_arg_1 = var_6_arg_1 & mask_SORT_1 [L70] SORT_1 var_6_arg_2 = state_4; [L71] SORT_1 var_6 = var_6_arg_0 ? var_6_arg_1 : var_6_arg_2; [L72] var_6 = var_6 & mask_SORT_1 [L73] SORT_1 next_8_arg_1 = var_6; [L74] SORT_1 next_14_arg_1 = var_13; [L76] state_3 = next_7_arg_1 [L77] state_4 = next_8_arg_1 [L78] state_11 = next_14_arg_1 [L43] input_2 = __VERIFIER_nondet_uchar() [L44] input_2 = input_2 & mask_SORT_1 [L46] SORT_1 var_9_arg_0 = state_3; [L47] SORT_1 var_9_arg_1 = state_4; [L48] SORT_1 var_9 = var_9_arg_0 == var_9_arg_1; [L49] SORT_1 var_15_arg_0 = state_11; [L50] SORT_1 var_15_arg_1 = ~var_9; [L51] var_15_arg_1 = var_15_arg_1 & mask_SORT_1 [L52] SORT_1 var_15 = !var_15_arg_0 || var_15_arg_1; [L53] SORT_1 constr_16_arg_0 = var_15; [L54] CALL assume_abort_if_not(constr_16_arg_0) [L23] COND FALSE !(!cond) [L54] RET assume_abort_if_not(constr_16_arg_0) [L56] SORT_1 bad_17_arg_0 = var_9; [L57] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 14 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=2, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 59 SizeOfPredicates, 1 NumberOfNonLiveVariables, 72 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 proved your program to be incorrect! [2025-01-09 07:44:17,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE