./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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.synabs2.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 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:01:14,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:01:14,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:01:14,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:01:14,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:01:14,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:01:14,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:01:14,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:01:14,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:01:14,782 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:01:14,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:01:14,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:01:14,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:01:14,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:01:14,783 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:01:14,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:01:14,783 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:01:14,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:01:14,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:01:14,784 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:01:14,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:01:14,784 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:01:14,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:01:14,784 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:01:14,784 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:01:14,784 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:01:14,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:01:14,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:01:14,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:01:14,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:01:14,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:01:14,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:01:14,785 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:01:14,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:01:14,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:01:14,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:01:14,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:01:14,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:01:14,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:01:14,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:01:14,786 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 -> 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 [2025-02-08 00:01:15,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:01:15,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:01:15,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:01:15,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:01:15,063 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:01:15,064 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.synabs2.c [2025-02-08 00:01:16,290 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/634b48cd2/415bd439897c49fe9c8e12dc8ef4b681/FLAG8f262eae4 [2025-02-08 00:01:16,550 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:01:16,551 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2025-02-08 00:01:16,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/634b48cd2/415bd439897c49fe9c8e12dc8ef4b681/FLAG8f262eae4 [2025-02-08 00:01:16,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/634b48cd2/415bd439897c49fe9c8e12dc8ef4b681 [2025-02-08 00:01:16,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:01:16,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:01:16,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:01:16,611 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:01:16,614 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:01:16,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a28e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16, skipping insertion in model container [2025-02-08 00:01:16,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,629 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:01:16,748 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.synabs2.c[1247,1260] [2025-02-08 00:01:16,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:01:16,798 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:01:16,806 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.synabs2.c[1247,1260] [2025-02-08 00:01:16,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:01:16,835 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:01:16,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16 WrapperNode [2025-02-08 00:01:16,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:01:16,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:01:16,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:01:16,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:01:16,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,854 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,886 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 143 [2025-02-08 00:01:16,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:01:16,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:01:16,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:01:16,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:01:16,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,912 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-02-08 00:01:16,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,922 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,925 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,931 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:01:16,932 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:01:16,932 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:01:16,932 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:01:16,936 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (1/1) ... [2025-02-08 00:01:16,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:01:16,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:16,962 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-02-08 00:01:16,967 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-02-08 00:01:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:01:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:01:16,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:01:16,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:01:17,036 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:01:17,038 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:01:17,300 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-02-08 00:01:17,300 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:01:17,320 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:01:17,321 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:01:17,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:01:17 BoogieIcfgContainer [2025-02-08 00:01:17,321 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:01:17,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:01:17,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:01:17,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:01:17,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:01:16" (1/3) ... [2025-02-08 00:01:17,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2442afca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:01:17, skipping insertion in model container [2025-02-08 00:01:17,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:16" (2/3) ... [2025-02-08 00:01:17,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2442afca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:01:17, skipping insertion in model container [2025-02-08 00:01:17,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:01:17" (3/3) ... [2025-02-08 00:01:17,330 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2025-02-08 00:01:17,341 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:01:17,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.synabs2.c that has 1 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:01:17,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:01:17,393 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;@7f3e5311, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:01:17,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:01:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:17,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 00:01:17,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:17,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:17,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:17,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1993826321, now seen corresponding path program 1 times [2025-02-08 00:01:17,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:17,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94811092] [2025-02-08 00:01:17,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:17,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:17,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 00:01:17,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 00:01:17,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:17,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:17,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94811092] [2025-02-08 00:01:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94811092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:17,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:01:17,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35022560] [2025-02-08 00:01:17,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:17,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:01:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:17,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:01:17,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:01:17,827 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:17,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:17,878 INFO L93 Difference]: Finished difference Result 71 states and 103 transitions. [2025-02-08 00:01:17,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:01:17,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 00:01:17,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:17,884 INFO L225 Difference]: With dead ends: 71 [2025-02-08 00:01:17,884 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 00:01:17,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:01:17,888 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:17,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:01:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 00:01:17,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 00:01:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 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-02-08 00:01:17,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-02-08 00:01:17,908 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 12 [2025-02-08 00:01:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:17,908 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-02-08 00:01:17,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-02-08 00:01:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 00:01:17,909 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:17,909 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:17,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:01:17,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:17,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:17,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1683752978, now seen corresponding path program 1 times [2025-02-08 00:01:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:17,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217261741] [2025-02-08 00:01:17,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:17,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 00:01:17,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 00:01:17,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:17,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:18,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:18,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217261741] [2025-02-08 00:01:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217261741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:18,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:18,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:01:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404599558] [2025-02-08 00:01:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:18,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:01:18,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:18,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:01:18,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:01:18,068 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-02-08 00:01:18,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:18,107 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2025-02-08 00:01:18,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:01:18,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-08 00:01:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:18,108 INFO L225 Difference]: With dead ends: 73 [2025-02-08 00:01:18,108 INFO L226 Difference]: Without dead ends: 42 [2025-02-08 00:01:18,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:01:18,109 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:18,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:01:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-08 00:01:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-02-08 00:01:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 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-02-08 00:01:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2025-02-08 00:01:18,113 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 13 [2025-02-08 00:01:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:18,113 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2025-02-08 00:01:18,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-02-08 00:01:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2025-02-08 00:01:18,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 00:01:18,113 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:18,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:18,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:01:18,114 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:18,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1706723284, now seen corresponding path program 1 times [2025-02-08 00:01:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:18,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482912318] [2025-02-08 00:01:18,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:18,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:18,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 00:01:18,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 00:01:18,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:18,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:18,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:18,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:18,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482912318] [2025-02-08 00:01:18,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482912318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:18,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:18,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:01:18,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909197606] [2025-02-08 00:01:18,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:18,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:01:18,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:18,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:01:18,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:01:18,365 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-02-08 00:01:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:18,447 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-02-08 00:01:18,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:01:18,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-08 00:01:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:18,448 INFO L225 Difference]: With dead ends: 90 [2025-02-08 00:01:18,448 INFO L226 Difference]: Without dead ends: 57 [2025-02-08 00:01:18,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:01:18,449 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:18,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 149 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:01:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-08 00:01:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2025-02-08 00:01:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 44 states have internal predecessors, (61), 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-02-08 00:01:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2025-02-08 00:01:18,454 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 14 [2025-02-08 00:01:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:18,455 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2025-02-08 00:01:18,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 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-02-08 00:01:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2025-02-08 00:01:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 00:01:18,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:18,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:18,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:01:18,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:18,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:18,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1322666450, now seen corresponding path program 1 times [2025-02-08 00:01:18,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:18,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428409808] [2025-02-08 00:01:18,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:18,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:01:18,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:01:18,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:18,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:01:18,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:01:18,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 00:01:18,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 00:01:18,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:18,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:01:18,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 00:01:18,499 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:01:18,499 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:01:18,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:01:18,503 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 00:01:18,513 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:18,518 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:01:18,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:01:18 BoogieIcfgContainer [2025-02-08 00:01:18,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:01:18,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:01:18,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:01:18,523 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:01:18,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:01:17" (3/4) ... [2025-02-08 00:01:18,525 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-08 00:01:18,526 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:01:18,526 INFO L158 Benchmark]: Toolchain (without parser) took 1917.56ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 54.6MB in the end (delta: 68.8MB). Peak memory consumption was 64.7MB. Max. memory is 16.1GB. [2025-02-08 00:01:18,526 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:01:18,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.80ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 111.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:01:18,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.83ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 107.3MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:01:18,527 INFO L158 Benchmark]: Boogie Preprocessor took 43.91ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 105.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:01:18,527 INFO L158 Benchmark]: IcfgBuilder took 389.39ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 81.2MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 00:01:18,527 INFO L158 Benchmark]: TraceAbstraction took 1198.98ms. Allocated memory is still 167.8MB. Free memory was 80.3MB in the beginning and 54.6MB in the end (delta: 25.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2025-02-08 00:01:18,528 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory was 54.6MB in the beginning and 54.6MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:01:18,529 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.25ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.80ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 111.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.83ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 107.3MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.91ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 105.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 389.39ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 81.2MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1198.98ms. Allocated memory is still 167.8MB. Free memory was 80.3MB in the beginning and 54.6MB in the end (delta: 25.7MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 167.8MB. Free memory was 54.6MB in the beginning and 54.6MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 63. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, var_14=1, var_21=2, var_5=0, var_8=6] [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=31, var_14=1, var_21=2, var_5=0, var_8=6] [L44] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_16_arg_0=1, var_16_arg_1=-2, var_21=2] [L63] EXPR var_16_arg_0 & var_16_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] EXPR var_16 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 400 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 271 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 129 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 106 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-08 00:01:18,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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.synabs2.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 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:01:20,581 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:01:20,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-08 00:01:20,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:01:20,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:01:20,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:01:20,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:01:20,699 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:01:20,699 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:01:20,699 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:01:20,700 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:01:20,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:01:20,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:01:20,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:01:20,701 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:01:20,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:01:20,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:01:20,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:01:20,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:01:20,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:01:20,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:01:20,702 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 00:01:20,702 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-08 00:01:20,702 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-08 00:01:20,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:01:20,702 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:01:20,702 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:01:20,702 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:01:20,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:01:20,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:01:20,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:01:20,703 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 -> 6556ff515d0922dbe3a06bc5063ec9f60439b7c3554b3a4149c1075ac229d4f7 [2025-02-08 00:01:20,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:01:20,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:01:20,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:01:20,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:01:20,974 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:01:20,975 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.synabs2.c [2025-02-08 00:01:22,147 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a4670f4c/9238130e3e4d431a8b0384edbf3d702d/FLAG7e9fa3e69 [2025-02-08 00:01:22,321 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:01:22,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.synabs2.c [2025-02-08 00:01:22,327 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a4670f4c/9238130e3e4d431a8b0384edbf3d702d/FLAG7e9fa3e69 [2025-02-08 00:01:22,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8a4670f4c/9238130e3e4d431a8b0384edbf3d702d [2025-02-08 00:01:22,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:01:22,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:01:22,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:01:22,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:01:22,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:01:22,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4637b992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22, skipping insertion in model container [2025-02-08 00:01:22,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:01:22,489 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.synabs2.c[1247,1260] [2025-02-08 00:01:22,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:01:22,531 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:01:22,542 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.synabs2.c[1247,1260] [2025-02-08 00:01:22,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:01:22,577 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:01:22,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22 WrapperNode [2025-02-08 00:01:22,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:01:22,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:01:22,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:01:22,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:01:22,584 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,606 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2025-02-08 00:01:22,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:01:22,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:01:22,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:01:22,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:01:22,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,631 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-02-08 00:01:22,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,641 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:01:22,643 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:01:22,646 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:01:22,646 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:01:22,647 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (1/1) ... [2025-02-08 00:01:22,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:01:22,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:22,683 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-02-08 00:01:22,695 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-02-08 00:01:22,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:01:22,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-08 00:01:22,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:01:22,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:01:22,767 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:01:22,769 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:01:22,920 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-08 00:01:22,920 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:01:22,928 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:01:22,929 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:01:22,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:01:22 BoogieIcfgContainer [2025-02-08 00:01:22,930 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:01:22,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:01:22,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:01:22,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:01:22,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:01:22" (1/3) ... [2025-02-08 00:01:22,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e009f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:01:22, skipping insertion in model container [2025-02-08 00:01:22,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:01:22" (2/3) ... [2025-02-08 00:01:22,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e009f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:01:22, skipping insertion in model container [2025-02-08 00:01:22,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:01:22" (3/3) ... [2025-02-08 00:01:22,940 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.synabs2.c [2025-02-08 00:01:22,953 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:01:22,955 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.synabs2.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:01:22,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:01:23,012 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;@904e930, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:01:23,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:01:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:23,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 00:01:23,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:23,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 00:01:23,021 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:23,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:23,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-08 00:01:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:01:23,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [697586848] [2025-02-08 00:01:23,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:23,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:23,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:23,045 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-02-08 00:01:23,053 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-02-08 00:01:23,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 00:01:23,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 00:01:23,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:23,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:23,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 00:01:23,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:23,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:01:23,361 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:01:23,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697586848] [2025-02-08 00:01:23,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697586848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:01:23,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:01:23,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 00:01:23,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886925769] [2025-02-08 00:01:23,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:23,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:01:23,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:01:23,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:01:23,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:01:23,384 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:23,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:23,428 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-08 00:01:23,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:01:23,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 00:01:23,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:23,446 INFO L225 Difference]: With dead ends: 16 [2025-02-08 00:01:23,446 INFO L226 Difference]: Without dead ends: 9 [2025-02-08 00:01:23,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:01:23,452 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:23,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 00:01:23,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-08 00:01:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-08 00:01:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-08 00:01:23,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-08 00:01:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:23,497 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-08 00:01:23,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-08 00:01:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 00:01:23,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:23,498 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-08 00:01:23,506 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-02-08 00:01:23,699 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-02-08 00:01:23,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:23,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:23,700 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-08 00:01:23,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:01:23,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927443191] [2025-02-08 00:01:23,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:23,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:23,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:23,704 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-02-08 00:01:23,705 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-02-08 00:01:23,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 00:01:23,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 00:01:23,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:23,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:23,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-08 00:01:23,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:24,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:24,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:24,293 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:01:24,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927443191] [2025-02-08 00:01:24,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927443191] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:01:24,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:01:24,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-08 00:01:24,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923747666] [2025-02-08 00:01:24,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:01:24,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 00:01:24,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:01:24,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 00:01:24,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:01:24,299 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:24,476 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-02-08 00:01:24,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 00:01:24,477 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 00:01:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:24,478 INFO L225 Difference]: With dead ends: 17 [2025-02-08 00:01:24,478 INFO L226 Difference]: Without dead ends: 15 [2025-02-08 00:01:24,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:01:24,479 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:24,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 13 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:01:24,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-08 00:01:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-02-08 00:01:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-02-08 00:01:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-08 00:01:24,484 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-02-08 00:01:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:24,484 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-08 00:01:24,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-08 00:01:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 00:01:24,485 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:24,485 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-02-08 00:01:24,491 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-02-08 00:01:24,686 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-02-08 00:01:24,686 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:24,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 2 times [2025-02-08 00:01:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:01:24,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1920140195] [2025-02-08 00:01:24,688 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 00:01:24,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:24,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:24,690 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-02-08 00:01:24,691 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-02-08 00:01:24,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-08 00:01:24,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 00:01:24,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 00:01:24,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:24,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 00:01:24,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:25,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:25,536 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:01:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920140195] [2025-02-08 00:01:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920140195] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:01:25,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:01:25,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-02-08 00:01:25,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171221740] [2025-02-08 00:01:25,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:01:25,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 00:01:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:01:25,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 00:01:25,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-08 00:01:25,539 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:26,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:26,226 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-02-08 00:01:26,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 00:01:26,228 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-02-08 00:01:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:26,228 INFO L225 Difference]: With dead ends: 29 [2025-02-08 00:01:26,228 INFO L226 Difference]: Without dead ends: 27 [2025-02-08 00:01:26,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2025-02-08 00:01:26,229 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:26,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 17 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:01:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-02-08 00:01:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-02-08 00:01:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:26,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2025-02-08 00:01:26,239 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2025-02-08 00:01:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:26,240 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2025-02-08 00:01:26,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2025-02-08 00:01:26,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 00:01:26,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:26,241 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2025-02-08 00:01:26,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 00:01:26,442 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-02-08 00:01:26,442 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:26,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:26,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1857839369, now seen corresponding path program 3 times [2025-02-08 00:01:26,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:01:26,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1243073535] [2025-02-08 00:01:26,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 00:01:26,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:26,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:26,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:01:26,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 00:01:26,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 8 equivalence classes. [2025-02-08 00:01:26,563 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 00:01:26,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-02-08 00:01:26,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:26,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 00:01:26,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:26,986 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:26,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:28,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-08 00:01:28,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243073535] [2025-02-08 00:01:28,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243073535] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:01:28,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:01:28,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2025-02-08 00:01:28,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739161594] [2025-02-08 00:01:28,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 00:01:28,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 00:01:28,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-08 00:01:28,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 00:01:28,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-02-08 00:01:28,639 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 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-02-08 00:01:30,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:30,547 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2025-02-08 00:01:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 00:01:30,548 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-08 00:01:30,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:30,549 INFO L225 Difference]: With dead ends: 47 [2025-02-08 00:01:30,549 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 00:01:30,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=424, Invalid=1136, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 00:01:30,550 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:30,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 00:01:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 00:01:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-02-08 00:01:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 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-02-08 00:01:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2025-02-08 00:01:30,559 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 25 [2025-02-08 00:01:30,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:30,559 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2025-02-08 00:01:30,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 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-02-08 00:01:30,559 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2025-02-08 00:01:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 00:01:30,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:30,560 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1] [2025-02-08 00:01:30,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 00:01:30,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:30,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:30,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:30,761 INFO L85 PathProgramCache]: Analyzing trace with hash 481374665, now seen corresponding path program 4 times [2025-02-08 00:01:30,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-08 00:01:30,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185818375] [2025-02-08 00:01:30,762 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 00:01:30,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:30,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:30,765 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:01:30,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 00:01:30,838 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-02-08 00:01:30,998 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 00:01:30,998 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 00:01:30,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:01:30,998 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 00:01:31,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 00:01:31,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 00:01:31,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:31,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 00:01:31,128 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-08 00:01:31,128 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 00:01:31,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-08 00:01:31,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 00:01:31,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:31,334 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-02-08 00:01:31,364 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,365 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,375 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 00:01:31,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 12:01:31 BoogieIcfgContainer [2025-02-08 00:01:31,377 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 00:01:31,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 00:01:31,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 00:01:31,378 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 00:01:31,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:01:22" (3/4) ... [2025-02-08 00:01:31,379 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,395 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-08 00:01:31,467 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 42. [2025-02-08 00:01:31,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 00:01:31,534 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 00:01:31,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 00:01:31,535 INFO L158 Benchmark]: Toolchain (without parser) took 9189.00ms. Allocated memory was 83.9MB in the beginning and 151.0MB in the end (delta: 67.1MB). Free memory was 59.7MB in the beginning and 82.3MB in the end (delta: -22.6MB). Peak memory consumption was 46.5MB. Max. memory is 16.1GB. [2025-02-08 00:01:31,535 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 83.9MB. Free memory was 63.0MB in the beginning and 63.0MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:01:31,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.09ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 47.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:01:31,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.79ms. Allocated memory is still 83.9MB. Free memory was 47.2MB in the beginning and 45.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:01:31,536 INFO L158 Benchmark]: Boogie Preprocessor took 34.86ms. Allocated memory is still 83.9MB. Free memory was 45.8MB in the beginning and 44.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 00:01:31,536 INFO L158 Benchmark]: IcfgBuilder took 286.20ms. Allocated memory is still 83.9MB. Free memory was 44.2MB in the beginning and 31.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 00:01:31,537 INFO L158 Benchmark]: TraceAbstraction took 8445.48ms. Allocated memory was 83.9MB in the beginning and 151.0MB in the end (delta: 67.1MB). Free memory was 30.9MB in the beginning and 95.4MB in the end (delta: -64.5MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2025-02-08 00:01:31,537 INFO L158 Benchmark]: Witness Printer took 156.42ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 82.3MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 00:01:31,538 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.33ms. Allocated memory is still 83.9MB. Free memory was 63.0MB in the beginning and 63.0MB in the end (delta: 34.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.09ms. Allocated memory is still 83.9MB. Free memory was 59.7MB in the beginning and 47.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.79ms. Allocated memory is still 83.9MB. Free memory was 47.2MB in the beginning and 45.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.86ms. Allocated memory is still 83.9MB. Free memory was 45.8MB in the beginning and 44.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 286.20ms. Allocated memory is still 83.9MB. Free memory was 44.2MB in the beginning and 31.5MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8445.48ms. Allocated memory was 83.9MB in the beginning and 151.0MB in the end (delta: 67.1MB). Free memory was 30.9MB in the beginning and 95.4MB in the end (delta: -64.5MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Witness Printer took 156.42ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 82.3MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. 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: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 5); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (5 - 1); [L32] const SORT_19 mask_SORT_19 = (SORT_19)-1 >> (sizeof(SORT_19) * 8 - 32); [L33] const SORT_19 msb_SORT_19 = (SORT_19)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_4 var_8 = 6; [L37] const SORT_1 var_14 = 1; [L38] const SORT_19 var_21 = 2; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] SORT_4 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L46] SORT_4 init_7_arg_1 = var_5; [L47] state_6 = init_7_arg_1 [L48] SORT_4 init_10_arg_1 = var_8; [L49] state_9 = init_10_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=31, state_6=0, state_9=6, var_14=1, var_21=2] [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND FALSE !(!(cond)) [L66] RET __VERIFIER_assert(!(bad_17_arg_0)) [L68] SORT_4 var_20_arg_0 = state_6; [L69] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L70] SORT_19 var_20 = var_20_arg_0; [L71] SORT_19 var_22_arg_0 = var_20; [L72] SORT_19 var_22_arg_1 = var_21; [L73] SORT_19 var_22 = var_22_arg_0 + var_22_arg_1; [L74] SORT_19 var_23_arg_0 = var_22; [L75] SORT_4 var_23 = var_23_arg_0 >> 0; [L76] var_23 = var_23 & mask_SORT_4 [L77] SORT_4 next_24_arg_1 = var_23; [L78] SORT_4 var_25_arg_0 = state_9; [L79] var_25_arg_0 = var_25_arg_0 & mask_SORT_4 [L80] SORT_19 var_25 = var_25_arg_0; [L81] SORT_19 var_26_arg_0 = var_25; [L82] SORT_19 var_26_arg_1 = var_21; [L83] SORT_19 var_26 = var_26_arg_0 + var_26_arg_1; [L84] SORT_19 var_27_arg_0 = var_26; [L85] SORT_4 var_27 = var_27_arg_0 >> 0; [L86] var_27 = var_27 & mask_SORT_4 [L87] SORT_4 next_28_arg_1 = var_27; [L89] state_6 = next_24_arg_1 [L90] state_9 = next_28_arg_1 [L52] input_2 = __VERIFIER_nondet_uchar() [L53] input_3 = __VERIFIER_nondet_uchar() [L56] SORT_4 var_11_arg_0 = state_6; [L57] SORT_4 var_11_arg_1 = state_9; [L58] SORT_1 var_11 = var_11_arg_0 < var_11_arg_1; [L59] SORT_1 var_15_arg_0 = var_11; [L60] SORT_1 var_15 = ~var_15_arg_0; [L61] SORT_1 var_16_arg_0 = var_14; [L62] SORT_1 var_16_arg_1 = var_15; [L63] SORT_1 var_16 = var_16_arg_0 & var_16_arg_1; [L64] var_16 = var_16 & mask_SORT_1 [L65] SORT_1 bad_17_arg_0 = var_16; [L66] CALL __VERIFIER_assert(!(bad_17_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 382 IncrementalHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 12 mSDtfsCounter, 382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=4, InterpolantAutomatonStates: 56, 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, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 87 ConstructedInterpolants, 36 QuantifiedInterpolants, 7952 SizeOfPredicates, 18 NumberOfNonLiveVariables, 310 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 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-02-08 00:01:31,561 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