./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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.krebs.2.prop1-func-interl.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 6d786879f21443213b301092b19eae5efebfd81144e40b7e6f6914d5cc6ac7cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 19:18:19,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 19:18:19,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 19:18:19,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 19:18:19,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 19:18:19,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 19:18:19,685 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 19:18:19,685 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 19:18:19,685 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 19:18:19,685 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 19:18:19,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 19:18:19,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 19:18:19,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 19:18:19,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 19:18:19,687 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 19:18:19,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 19:18:19,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 19:18:19,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 19:18:19,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 19:18:19,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 19:18:19,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 19:18:19,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 19:18:19,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 19:18:19,688 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 19:18:19,688 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 19:18:19,688 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 19:18:19,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 19:18:19,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 19:18:19,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 19:18:19,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:18:19,688 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 19:18:19,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 19:18:19,688 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 19:18:19,689 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 19:18:19,689 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 19:18:19,689 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 19:18:19,689 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 19:18:19,689 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 19:18:19,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 19:18:19,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 19:18:19,690 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 -> 6d786879f21443213b301092b19eae5efebfd81144e40b7e6f6914d5cc6ac7cf [2025-02-05 19:18:19,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 19:18:19,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 19:18:19,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 19:18:19,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 19:18:19,903 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 19:18:19,903 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.krebs.2.prop1-func-interl.c [2025-02-05 19:18:21,101 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d67439db/1ff0c70d36a741489a046e829669a148/FLAGa0a67d682 [2025-02-05 19:18:21,475 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 19:18:21,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.2.prop1-func-interl.c [2025-02-05 19:18:21,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d67439db/1ff0c70d36a741489a046e829669a148/FLAGa0a67d682 [2025-02-05 19:18:21,685 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8d67439db/1ff0c70d36a741489a046e829669a148 [2025-02-05 19:18:21,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 19:18:21,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 19:18:21,689 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 19:18:21,689 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 19:18:21,692 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 19:18:21,693 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:18:21" (1/1) ... [2025-02-05 19:18:21,693 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34b640b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:21, skipping insertion in model container [2025-02-05 19:18:21,693 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:18:21" (1/1) ... [2025-02-05 19:18:21,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 19:18:21,873 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.krebs.2.prop1-func-interl.c[1172,1185] [2025-02-05 19:18:22,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:18:22,114 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 19:18:22,122 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.krebs.2.prop1-func-interl.c[1172,1185] [2025-02-05 19:18:22,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:18:22,245 INFO L204 MainTranslator]: Completed translation [2025-02-05 19:18:22,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22 WrapperNode [2025-02-05 19:18:22,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 19:18:22,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 19:18:22,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 19:18:22,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 19:18:22,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:22,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:22,736 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4657 [2025-02-05 19:18:22,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 19:18:22,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 19:18:22,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 19:18:22,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 19:18:22,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:22,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:22,829 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:22,965 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-05 19:18:22,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:22,967 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:23,153 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:23,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:23,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:23,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:23,336 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 19:18:23,337 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 19:18:23,337 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 19:18:23,337 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 19:18:23,338 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (1/1) ... [2025-02-05 19:18:23,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:18:23,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:18:23,362 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-05 19:18:23,371 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-05 19:18:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 19:18:23,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 19:18:23,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 19:18:23,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 19:18:23,633 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 19:18:23,634 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 19:18:27,520 INFO L? ?]: Removed 2670 outVars from TransFormulas that were not future-live. [2025-02-05 19:18:27,521 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 19:18:27,699 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 19:18:27,700 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 19:18:27,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:18:27 BoogieIcfgContainer [2025-02-05 19:18:27,700 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 19:18:27,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 19:18:27,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 19:18:27,708 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 19:18:27,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:18:21" (1/3) ... [2025-02-05 19:18:27,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2608022f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:18:27, skipping insertion in model container [2025-02-05 19:18:27,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:22" (2/3) ... [2025-02-05 19:18:27,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2608022f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:18:27, skipping insertion in model container [2025-02-05 19:18:27,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:18:27" (3/3) ... [2025-02-05 19:18:27,711 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.2.prop1-func-interl.c [2025-02-05 19:18:27,723 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 19:18:27,725 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.krebs.2.prop1-func-interl.c that has 1 procedures, 1570 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 19:18:27,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 19:18:27,814 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;@11650ebb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 19:18:27,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 19:18:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 1570 states, 1568 states have (on average 1.5044642857142858) internal successors, (2359), 1569 states have internal predecessors, (2359), 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-05 19:18:27,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-05 19:18:27,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:18:27,833 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:18:27,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:18:27,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:18:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash 786601781, now seen corresponding path program 1 times [2025-02-05 19:18:27,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:18:27,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437986195] [2025-02-05 19:18:27,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:18:27,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:18:27,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-05 19:18:28,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-05 19:18:28,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:18:28,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:18:28,694 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-05 19:18:28,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:18:28,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437986195] [2025-02-05 19:18:28,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437986195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:18:28,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:18:28,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:18:28,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668594078] [2025-02-05 19:18:28,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:18:28,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:18:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:18:28,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:18:28,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:18:28,719 INFO L87 Difference]: Start difference. First operand has 1570 states, 1568 states have (on average 1.5044642857142858) internal successors, (2359), 1569 states have internal predecessors, (2359), 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 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-05 19:18:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:18:29,546 INFO L93 Difference]: Finished difference Result 3001 states and 4513 transitions. [2025-02-05 19:18:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:18:29,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 113 [2025-02-05 19:18:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:18:29,559 INFO L225 Difference]: With dead ends: 3001 [2025-02-05 19:18:29,559 INFO L226 Difference]: Without dead ends: 1569 [2025-02-05 19:18:29,563 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-05 19:18:29,565 INFO L435 NwaCegarLoop]: 1967 mSDtfsCounter, 0 mSDsluCounter, 3929 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5896 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 19:18:29,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5896 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 19:18:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-02-05 19:18:29,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2025-02-05 19:18:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 1.503188775510204) internal successors, (2357), 1568 states have internal predecessors, (2357), 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-05 19:18:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2357 transitions. [2025-02-05 19:18:29,626 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2357 transitions. Word has length 113 [2025-02-05 19:18:29,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:18:29,626 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2357 transitions. [2025-02-05 19:18:29,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-05 19:18:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2357 transitions. [2025-02-05 19:18:29,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-05 19:18:29,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:18:29,630 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:18:29,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 19:18:29,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:18:29,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:18:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1380467064, now seen corresponding path program 1 times [2025-02-05 19:18:29,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:18:29,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880742611] [2025-02-05 19:18:29,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:18:29,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:18:29,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-05 19:18:29,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-05 19:18:29,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:18:29,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:18:29,899 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-05 19:18:29,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:18:29,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880742611] [2025-02-05 19:18:29,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880742611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:18:29,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:18:29,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:18:29,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26638281] [2025-02-05 19:18:29,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:18:29,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:18:29,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:18:29,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:18:29,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:18:29,902 INFO L87 Difference]: Start difference. First operand 1569 states and 2357 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-05 19:18:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:18:30,477 INFO L93 Difference]: Finished difference Result 3002 states and 4511 transitions. [2025-02-05 19:18:30,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:18:30,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 114 [2025-02-05 19:18:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:18:30,483 INFO L225 Difference]: With dead ends: 3002 [2025-02-05 19:18:30,483 INFO L226 Difference]: Without dead ends: 1571 [2025-02-05 19:18:30,484 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-05 19:18:30,485 INFO L435 NwaCegarLoop]: 1967 mSDtfsCounter, 0 mSDsluCounter, 3926 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5893 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 19:18:30,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5893 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 19:18:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-02-05 19:18:30,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1571. [2025-02-05 19:18:30,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1570 states have (on average 1.502547770700637) internal successors, (2359), 1570 states have internal predecessors, (2359), 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-05 19:18:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2359 transitions. [2025-02-05 19:18:30,535 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2359 transitions. Word has length 114 [2025-02-05 19:18:30,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:18:30,535 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2359 transitions. [2025-02-05 19:18:30,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-05 19:18:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2359 transitions. [2025-02-05 19:18:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 19:18:30,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:18:30,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:18:30,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 19:18:30,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:18:30,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:18:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2086705552, now seen corresponding path program 1 times [2025-02-05 19:18:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:18:30,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279551394] [2025-02-05 19:18:30,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:18:30,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:18:30,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 19:18:30,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 19:18:30,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:18:30,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:18:30,756 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-05 19:18:30,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:18:30,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279551394] [2025-02-05 19:18:30,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279551394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:18:30,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:18:30,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:18:30,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296885371] [2025-02-05 19:18:30,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:18:30,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:18:30,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:18:30,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:18:30,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:18:30,759 INFO L87 Difference]: Start difference. First operand 1571 states and 2359 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-05 19:18:31,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:18:31,397 INFO L93 Difference]: Finished difference Result 3010 states and 4521 transitions. [2025-02-05 19:18:31,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:18:31,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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 115 [2025-02-05 19:18:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:18:31,404 INFO L225 Difference]: With dead ends: 3010 [2025-02-05 19:18:31,404 INFO L226 Difference]: Without dead ends: 1577 [2025-02-05 19:18:31,406 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-05 19:18:31,409 INFO L435 NwaCegarLoop]: 1967 mSDtfsCounter, 4 mSDsluCounter, 3921 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5888 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:18:31,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5888 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:18:31,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-02-05 19:18:31,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1577. [2025-02-05 19:18:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1576 states have (on average 1.5019035532994924) internal successors, (2367), 1576 states have internal predecessors, (2367), 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-05 19:18:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2367 transitions. [2025-02-05 19:18:31,445 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2367 transitions. Word has length 115 [2025-02-05 19:18:31,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:18:31,445 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2367 transitions. [2025-02-05 19:18:31,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-05 19:18:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2367 transitions. [2025-02-05 19:18:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-05 19:18:31,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:18:31,447 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:18:31,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 19:18:31,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:18:31,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:18:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash -657559918, now seen corresponding path program 1 times [2025-02-05 19:18:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:18:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648547881] [2025-02-05 19:18:31,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:18:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:18:31,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-05 19:18:31,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-05 19:18:31,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:18:31,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:18:31,665 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-05 19:18:31,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:18:31,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648547881] [2025-02-05 19:18:31,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648547881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:18:31,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:18:31,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:18:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042404436] [2025-02-05 19:18:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:18:31,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:18:31,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:18:31,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:18:31,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:18:31,667 INFO L87 Difference]: Start difference. First operand 1577 states and 2367 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-05 19:18:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:18:32,281 INFO L93 Difference]: Finished difference Result 3020 states and 4533 transitions. [2025-02-05 19:18:32,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:18:32,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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 116 [2025-02-05 19:18:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:18:32,287 INFO L225 Difference]: With dead ends: 3020 [2025-02-05 19:18:32,287 INFO L226 Difference]: Without dead ends: 1581 [2025-02-05 19:18:32,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:18:32,289 INFO L435 NwaCegarLoop]: 1967 mSDtfsCounter, 0 mSDsluCounter, 3921 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5888 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 19:18:32,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5888 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 19:18:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2025-02-05 19:18:32,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1577. [2025-02-05 19:18:32,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1576 states have (on average 1.5019035532994924) internal successors, (2367), 1576 states have internal predecessors, (2367), 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-05 19:18:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2367 transitions. [2025-02-05 19:18:32,313 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2367 transitions. Word has length 116 [2025-02-05 19:18:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:18:32,314 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2367 transitions. [2025-02-05 19:18:32,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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-05 19:18:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2367 transitions. [2025-02-05 19:18:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-05 19:18:32,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:18:32,315 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:18:32,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 19:18:32,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:18:32,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:18:32,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1316123413, now seen corresponding path program 1 times [2025-02-05 19:18:32,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:18:32,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103584195] [2025-02-05 19:18:32,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:18:32,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:18:32,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-05 19:18:32,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-05 19:18:32,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:18:32,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:18:32,554 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-05 19:18:32,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:18:32,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103584195] [2025-02-05 19:18:32,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103584195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:18:32,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:18:32,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 19:18:32,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20812181] [2025-02-05 19:18:32,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:18:32,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 19:18:32,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:18:32,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 19:18:32,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:18:32,555 INFO L87 Difference]: Start difference. First operand 1577 states and 2367 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-05 19:18:34,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:18:34,432 INFO L93 Difference]: Finished difference Result 4439 states and 6665 transitions. [2025-02-05 19:18:34,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 19:18:34,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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 117 [2025-02-05 19:18:34,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:18:34,440 INFO L225 Difference]: With dead ends: 4439 [2025-02-05 19:18:34,441 INFO L226 Difference]: Without dead ends: 3000 [2025-02-05 19:18:34,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-05 19:18:34,444 INFO L435 NwaCegarLoop]: 1580 mSDtfsCounter, 2233 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2233 SdHoareTripleChecker+Valid, 6199 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 19:18:34,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2233 Valid, 6199 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 19:18:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2025-02-05 19:18:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1644. [2025-02-05 19:18:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1643 states have (on average 1.5009129640900791) internal successors, (2466), 1643 states have internal predecessors, (2466), 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-05 19:18:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2466 transitions. [2025-02-05 19:18:34,478 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2466 transitions. Word has length 117 [2025-02-05 19:18:34,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:18:34,478 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 2466 transitions. [2025-02-05 19:18:34,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-05 19:18:34,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2466 transitions. [2025-02-05 19:18:34,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-05 19:18:34,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:18:34,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:18:34,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 19:18:34,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:18:34,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:18:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1434486858, now seen corresponding path program 1 times [2025-02-05 19:18:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:18:34,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462253353] [2025-02-05 19:18:34,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:18:34,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:18:34,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-05 19:18:34,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-05 19:18:34,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:18:34,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:18:34,834 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-05 19:18:34,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 19:18:34,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462253353] [2025-02-05 19:18:34,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462253353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:18:34,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:18:34,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 19:18:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241230559] [2025-02-05 19:18:34,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:18:34,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 19:18:34,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 19:18:34,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 19:18:34,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 19:18:34,836 INFO L87 Difference]: Start difference. First operand 1644 states and 2466 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-05 19:18:36,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:18:36,341 INFO L93 Difference]: Finished difference Result 3098 states and 4648 transitions. [2025-02-05 19:18:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 19:18:36,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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 118 [2025-02-05 19:18:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:18:36,347 INFO L225 Difference]: With dead ends: 3098 [2025-02-05 19:18:36,347 INFO L226 Difference]: Without dead ends: 1659 [2025-02-05 19:18:36,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 19:18:36,350 INFO L435 NwaCegarLoop]: 1571 mSDtfsCounter, 2266 mSDsluCounter, 4701 mSDsCounter, 0 mSdLazyCounter, 3147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 6272 SdHoareTripleChecker+Invalid, 3148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 19:18:36,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 6272 Invalid, 3148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3147 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 19:18:36,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-02-05 19:18:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1657. [2025-02-05 19:18:36,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1656 states have (on average 1.4981884057971016) internal successors, (2481), 1656 states have internal predecessors, (2481), 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-05 19:18:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2481 transitions. [2025-02-05 19:18:36,377 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2481 transitions. Word has length 118 [2025-02-05 19:18:36,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:18:36,378 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2481 transitions. [2025-02-05 19:18:36,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-05 19:18:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2481 transitions. [2025-02-05 19:18:36,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 19:18:36,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:18:36,379 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:18:36,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 19:18:36,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:18:36,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:18:36,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1435468677, now seen corresponding path program 1 times [2025-02-05 19:18:36,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 19:18:36,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947251932] [2025-02-05 19:18:36,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:18:36,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 19:18:36,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 19:18:36,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 19:18:36,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:18:36,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 19:18:36,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 19:18:36,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 19:18:36,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 19:18:36,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:18:36,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 19:18:36,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 19:18:36,504 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 19:18:36,505 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 19:18:36,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 19:18:36,508 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-05 19:18:36,558 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 19:18:36,573 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 19:18:36,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 07:18:36 BoogieIcfgContainer [2025-02-05 19:18:36,575 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 19:18:36,575 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 19:18:36,576 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 19:18:36,576 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 19:18:36,576 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:18:27" (3/4) ... [2025-02-05 19:18:36,577 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 19:18:36,578 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 19:18:36,579 INFO L158 Benchmark]: Toolchain (without parser) took 14890.11ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 872.4MB). Free memory was 106.2MB in the beginning and 668.4MB in the end (delta: -562.2MB). Peak memory consumption was 314.8MB. Max. memory is 16.1GB. [2025-02-05 19:18:36,579 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:18:36,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 556.77ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 44.6MB in the end (delta: 61.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 19:18:36,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 490.09ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 44.6MB in the beginning and 47.7MB in the end (delta: -3.0MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. [2025-02-05 19:18:36,580 INFO L158 Benchmark]: Boogie Preprocessor took 599.55ms. Allocated memory was 151.0MB in the beginning and 369.1MB in the end (delta: 218.1MB). Free memory was 47.7MB in the beginning and 241.3MB in the end (delta: -193.6MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2025-02-05 19:18:36,580 INFO L158 Benchmark]: IcfgBuilder took 4362.80ms. Allocated memory was 369.1MB in the beginning and 1.0GB in the end (delta: 645.9MB). Free memory was 241.2MB in the beginning and 846.5MB in the end (delta: -605.4MB). Peak memory consumption was 603.7MB. Max. memory is 16.1GB. [2025-02-05 19:18:36,581 INFO L158 Benchmark]: TraceAbstraction took 8870.46ms. Allocated memory is still 1.0GB. Free memory was 846.5MB in the beginning and 668.5MB in the end (delta: 178.0MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. [2025-02-05 19:18:36,581 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 1.0GB. Free memory was 668.5MB in the beginning and 668.4MB in the end (delta: 86.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 19:18:36,582 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.23ms. Allocated memory is still 201.3MB. Free memory is still 115.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 556.77ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 44.6MB in the end (delta: 61.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 490.09ms. Allocated memory was 142.6MB in the beginning and 151.0MB in the end (delta: 8.4MB). Free memory was 44.6MB in the beginning and 47.7MB in the end (delta: -3.0MB). Peak memory consumption was 84.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 599.55ms. Allocated memory was 151.0MB in the beginning and 369.1MB in the end (delta: 218.1MB). Free memory was 47.7MB in the beginning and 241.3MB in the end (delta: -193.6MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * IcfgBuilder took 4362.80ms. Allocated memory was 369.1MB in the beginning and 1.0GB in the end (delta: 645.9MB). Free memory was 241.2MB in the beginning and 846.5MB in the end (delta: -605.4MB). Peak memory consumption was 603.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8870.46ms. Allocated memory is still 1.0GB. Free memory was 846.5MB in the beginning and 668.5MB in the end (delta: 178.0MB). Peak memory consumption was 178.0MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 1.0GB. Free memory was 668.5MB in the beginning and 668.4MB in the end (delta: 86.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 213, overapproximation of bitwiseAnd at line 215. 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_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_30 = 0; [L40] const SORT_3 var_75 = 0; [L41] const SORT_4 var_77 = 20; [L42] const SORT_2 var_81 = 3; [L43] const SORT_4 var_85 = 1; [L44] const SORT_2 var_91 = 4; [L45] const SORT_4 var_93 = 2; [L46] const SORT_2 var_117 = 12; [L47] const SORT_2 var_140 = 2; [L48] const SORT_2 var_181 = 15; [L49] const SORT_2 var_198 = 10; [L51] SORT_1 input_82; [L52] SORT_1 input_92; [L53] SORT_1 input_98; [L54] SORT_1 input_122; [L55] SORT_1 input_125; [L56] SORT_1 input_126; [L57] SORT_1 input_127; [L58] SORT_1 input_128; [L59] SORT_1 input_147; [L60] SORT_1 input_148; [L61] SORT_1 input_170; [L62] SORT_1 input_174; [L63] SORT_1 input_217; [L64] SORT_1 input_220; [L65] SORT_1 input_241; [L66] SORT_1 input_262; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L68] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L69] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L70] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L71] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L72] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L73] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L74] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L75] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L76] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L77] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L78] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L79] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L80] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L81] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L82] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L83] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L84] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L85] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L86] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L87] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L88] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L89] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L90] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L91] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L92] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L93] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L94] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L95] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L96] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L97] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L98] SORT_1 state_67 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L99] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L100] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L100] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L101] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_198=10, var_30=0, var_5=0, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L101] SORT_1 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L103] SORT_2 init_7_arg_1 = var_5; [L104] state_6 = init_7_arg_1 [L105] SORT_2 init_9_arg_1 = var_5; [L106] state_8 = init_9_arg_1 [L107] SORT_2 init_11_arg_1 = var_5; [L108] state_10 = init_11_arg_1 [L109] SORT_2 init_13_arg_1 = var_5; [L110] state_12 = init_13_arg_1 [L111] SORT_2 init_15_arg_1 = var_5; [L112] state_14 = init_15_arg_1 [L113] SORT_2 init_17_arg_1 = var_5; [L114] state_16 = init_17_arg_1 [L115] SORT_2 init_19_arg_1 = var_5; [L116] state_18 = init_19_arg_1 [L117] SORT_2 init_21_arg_1 = var_5; [L118] state_20 = init_21_arg_1 [L119] SORT_2 init_23_arg_1 = var_5; [L120] state_22 = init_23_arg_1 [L121] SORT_2 init_25_arg_1 = var_5; [L122] state_24 = init_25_arg_1 [L123] SORT_2 init_27_arg_1 = var_5; [L124] state_26 = init_27_arg_1 [L125] SORT_2 init_29_arg_1 = var_5; [L126] state_28 = init_29_arg_1 [L127] SORT_1 init_32_arg_1 = var_30; [L128] state_31 = init_32_arg_1 [L129] SORT_1 init_34_arg_1 = var_30; [L130] state_33 = init_34_arg_1 [L131] SORT_1 init_36_arg_1 = var_30; [L132] state_35 = init_36_arg_1 [L133] SORT_1 init_38_arg_1 = var_30; [L134] state_37 = init_38_arg_1 [L135] SORT_1 init_40_arg_1 = var_30; [L136] state_39 = init_40_arg_1 [L137] SORT_1 init_42_arg_1 = var_30; [L138] state_41 = init_42_arg_1 [L139] SORT_1 init_44_arg_1 = var_30; [L140] state_43 = init_44_arg_1 [L141] SORT_1 init_46_arg_1 = var_30; [L142] state_45 = init_46_arg_1 [L143] SORT_1 init_48_arg_1 = var_30; [L144] state_47 = init_48_arg_1 [L145] SORT_1 init_50_arg_1 = var_30; [L146] state_49 = init_50_arg_1 [L147] SORT_1 init_52_arg_1 = var_30; [L148] state_51 = init_52_arg_1 [L149] SORT_1 init_54_arg_1 = var_30; [L150] state_53 = init_54_arg_1 [L151] SORT_1 init_56_arg_1 = var_30; [L152] state_55 = init_56_arg_1 [L153] SORT_1 init_58_arg_1 = var_30; [L154] state_57 = init_58_arg_1 [L155] SORT_1 init_60_arg_1 = var_30; [L156] state_59 = init_60_arg_1 [L157] SORT_1 init_62_arg_1 = var_30; [L158] state_61 = init_62_arg_1 [L159] SORT_1 init_64_arg_1 = var_30; [L160] state_63 = init_64_arg_1 [L161] SORT_1 init_66_arg_1 = var_30; [L162] state_65 = init_66_arg_1 [L163] SORT_1 init_68_arg_1 = var_30; [L164] state_67 = init_68_arg_1 [L165] SORT_1 init_70_arg_1 = var_30; [L166] state_69 = init_70_arg_1 [L167] SORT_1 init_72_arg_1 = var_30; [L168] state_71 = init_72_arg_1 [L169] SORT_1 init_74_arg_1 = var_30; [L170] state_73 = init_74_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L173] input_82 = __VERIFIER_nondet_uchar() [L174] EXPR input_82 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L174] input_82 = input_82 & mask_SORT_1 [L175] input_92 = __VERIFIER_nondet_uchar() [L176] EXPR input_92 & mask_SORT_1 VAL [input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L176] input_92 = input_92 & mask_SORT_1 [L177] input_98 = __VERIFIER_nondet_uchar() [L178] EXPR input_98 & mask_SORT_1 VAL [input_82=0, input_92=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L178] input_98 = input_98 & mask_SORT_1 [L179] input_122 = __VERIFIER_nondet_uchar() [L180] EXPR input_122 & mask_SORT_1 VAL [input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L180] input_122 = input_122 & mask_SORT_1 [L181] input_125 = __VERIFIER_nondet_uchar() [L182] EXPR input_125 & mask_SORT_1 VAL [input_122=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L182] input_125 = input_125 & mask_SORT_1 [L183] input_126 = __VERIFIER_nondet_uchar() [L184] EXPR input_126 & mask_SORT_1 VAL [input_122=0, input_125=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L184] input_126 = input_126 & mask_SORT_1 [L185] input_127 = __VERIFIER_nondet_uchar() [L186] EXPR input_127 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L186] input_127 = input_127 & mask_SORT_1 [L187] input_128 = __VERIFIER_nondet_uchar() [L188] EXPR input_128 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L188] input_128 = input_128 & mask_SORT_1 [L189] input_147 = __VERIFIER_nondet_uchar() [L190] EXPR input_147 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L190] input_147 = input_147 & mask_SORT_1 [L191] input_148 = __VERIFIER_nondet_uchar() [L192] EXPR input_148 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L192] input_148 = input_148 & mask_SORT_1 [L193] input_170 = __VERIFIER_nondet_uchar() [L194] EXPR input_170 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L194] input_170 = input_170 & mask_SORT_1 [L195] input_174 = __VERIFIER_nondet_uchar() [L196] EXPR input_174 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L196] input_174 = input_174 & mask_SORT_1 [L197] input_217 = __VERIFIER_nondet_uchar() [L198] EXPR input_217 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L198] input_217 = input_217 & mask_SORT_1 [L199] input_220 = __VERIFIER_nondet_uchar() [L200] EXPR input_220 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_217=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L200] input_220 = input_220 & mask_SORT_1 [L201] input_241 = __VERIFIER_nondet_uchar() [L202] input_262 = __VERIFIER_nondet_uchar() [L205] SORT_3 var_76_arg_0 = var_75; [L206] SORT_2 var_76_arg_1 = state_28; VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_217=0, input_220=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_76_arg_0=0, var_76_arg_1=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L207] EXPR ((SORT_4)var_76_arg_0 << 8) | var_76_arg_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_217=0, input_220=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L207] SORT_4 var_76 = ((SORT_4)var_76_arg_0 << 8) | var_76_arg_1; [L208] EXPR var_76 & mask_SORT_4 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_217=0, input_220=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L208] var_76 = var_76 & mask_SORT_4 [L209] SORT_4 var_78_arg_0 = var_76; [L210] SORT_4 var_78_arg_1 = var_77; [L211] SORT_1 var_78 = var_78_arg_0 <= var_78_arg_1; [L212] SORT_1 var_79_arg_0 = ~state_73; VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_217=0, input_220=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_76=0, var_77=20, var_78=1, var_79_arg_0=-1, var_81=3, var_85=1, var_91=4, var_93=2] [L213] EXPR var_79_arg_0 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_217=0, input_220=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_76=0, var_77=20, var_78=1, var_81=3, var_85=1, var_91=4, var_93=2] [L213] var_79_arg_0 = var_79_arg_0 & mask_SORT_1 [L214] SORT_1 var_79_arg_1 = ~var_78; VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_217=0, input_220=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_76=0, var_77=20, var_79_arg_0=1, var_79_arg_1=-2, var_81=3, var_85=1, var_91=4, var_93=2] [L215] EXPR var_79_arg_1 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_217=0, input_220=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_76=0, var_77=20, var_79_arg_0=1, var_81=3, var_85=1, var_91=4, var_93=2] [L215] var_79_arg_1 = var_79_arg_1 & mask_SORT_1 [L216] EXPR var_79_arg_0 & var_79_arg_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_217=0, input_220=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_76=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L216] SORT_1 var_79 = var_79_arg_0 & var_79_arg_1; [L217] EXPR var_79 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_217=0, input_220=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_198=10, var_75=0, var_76=0, var_77=20, var_81=3, var_85=1, var_91=4, var_93=2] [L217] var_79 = var_79 & mask_SORT_1 [L218] SORT_1 bad_80_arg_0 = var_79; [L219] CALL __VERIFIER_assert(!(bad_80_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1570 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4503 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4503 mSDsluCounter, 36036 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25017 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10855 IncrementalHoareTripleChecker+Invalid, 10858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 11019 mSDtfsCounter, 10855 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1657occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1362 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 812 NumberOfCodeBlocks, 812 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 687 ConstructedInterpolants, 0 QuantifiedInterpolants, 1987 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-05 19:18:36,607 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.krebs.2.prop1-func-interl.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 6d786879f21443213b301092b19eae5efebfd81144e40b7e6f6914d5cc6ac7cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 19:18:38,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 19:18:38,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 19:18:38,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 19:18:38,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 19:18:38,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 19:18:38,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 19:18:38,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 19:18:38,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 19:18:38,697 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 19:18:38,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 19:18:38,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 19:18:38,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 19:18:38,698 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 19:18:38,698 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 19:18:38,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 19:18:38,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 19:18:38,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 19:18:38,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 19:18:38,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 19:18:38,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 19:18:38,698 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 19:18:38,699 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 19:18:38,699 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 19:18:38,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 19:18:38,699 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 19:18:38,699 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 19:18:38,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 19:18:38,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 19:18:38,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 19:18:38,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 19:18:38,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:18:38,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 19:18:38,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 19:18:38,700 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 19:18:38,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 19:18:38,700 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 19:18:38,700 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 19:18:38,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 19:18:38,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 19:18:38,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 19:18:38,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 19:18:38,700 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 -> 6d786879f21443213b301092b19eae5efebfd81144e40b7e6f6914d5cc6ac7cf [2025-02-05 19:18:38,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 19:18:38,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 19:18:38,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 19:18:38,961 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 19:18:38,961 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 19:18:38,962 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.krebs.2.prop1-func-interl.c [2025-02-05 19:18:40,260 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ef11e575/888aebc6a695457694e8a0de20421ca2/FLAGf57a65fcc [2025-02-05 19:18:40,571 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 19:18:40,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.2.prop1-func-interl.c [2025-02-05 19:18:40,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ef11e575/888aebc6a695457694e8a0de20421ca2/FLAGf57a65fcc [2025-02-05 19:18:40,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ef11e575/888aebc6a695457694e8a0de20421ca2 [2025-02-05 19:18:40,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 19:18:40,603 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 19:18:40,604 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 19:18:40,604 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 19:18:40,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 19:18:40,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:18:40" (1/1) ... [2025-02-05 19:18:40,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5aa578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:40, skipping insertion in model container [2025-02-05 19:18:40,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 07:18:40" (1/1) ... [2025-02-05 19:18:40,638 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 19:18:40,774 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.krebs.2.prop1-func-interl.c[1172,1185] [2025-02-05 19:18:41,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:18:41,015 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 19:18:41,022 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.krebs.2.prop1-func-interl.c[1172,1185] [2025-02-05 19:18:41,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 19:18:41,166 INFO L204 MainTranslator]: Completed translation [2025-02-05 19:18:41,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41 WrapperNode [2025-02-05 19:18:41,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 19:18:41,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 19:18:41,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 19:18:41,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 19:18:41,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,201 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,252 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1537 [2025-02-05 19:18:41,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 19:18:41,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 19:18:41,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 19:18:41,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 19:18:41,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,314 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-05 19:18:41,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 19:18:41,411 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 19:18:41,411 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 19:18:41,411 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 19:18:41,412 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (1/1) ... [2025-02-05 19:18:41,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 19:18:41,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:18:41,443 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-05 19:18:41,445 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-05 19:18:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 19:18:41,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 19:18:41,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 19:18:41,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 19:18:41,707 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 19:18:41,708 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 19:18:42,666 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-02-05 19:18:42,666 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 19:18:42,673 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 19:18:42,675 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 19:18:42,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:18:42 BoogieIcfgContainer [2025-02-05 19:18:42,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 19:18:42,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 19:18:42,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 19:18:42,682 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 19:18:42,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 07:18:40" (1/3) ... [2025-02-05 19:18:42,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d356395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:18:42, skipping insertion in model container [2025-02-05 19:18:42,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 07:18:41" (2/3) ... [2025-02-05 19:18:42,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d356395 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 07:18:42, skipping insertion in model container [2025-02-05 19:18:42,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 07:18:42" (3/3) ... [2025-02-05 19:18:42,684 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.2.prop1-func-interl.c [2025-02-05 19:18:42,694 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 19:18:42,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.krebs.2.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 19:18:42,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 19:18:42,739 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;@6a717b2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 19:18:42,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 19:18:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:18:42,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 19:18:42,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:18:42,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 19:18:42,749 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:18:42,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:18:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 19:18:42,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 19:18:42,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794920941] [2025-02-05 19:18:42,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:18:42,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:18:42,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:18:42,771 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-05 19:18:42,783 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-05 19:18:43,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 19:18:43,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 19:18:43,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:18:43,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:18:43,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 19:18:43,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:18:43,189 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-05 19:18:43,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 19:18:43,190 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 19:18:43,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794920941] [2025-02-05 19:18:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794920941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 19:18:43,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 19:18:43,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 19:18:43,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641611068] [2025-02-05 19:18:43,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 19:18:43,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 19:18:43,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 19:18:43,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 19:18:43,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 19:18:43,212 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:18:43,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:18:43,326 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-02-05 19:18:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 19:18:43,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-05 19:18:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:18:43,332 INFO L225 Difference]: With dead ends: 18 [2025-02-05 19:18:43,332 INFO L226 Difference]: Without dead ends: 10 [2025-02-05 19:18:43,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 19:18:43,336 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 19:18:43,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 19:18:43,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-02-05 19:18:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-02-05 19:18:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:18:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 19:18:43,354 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 19:18:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:18:43,354 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 19:18:43,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:18:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 19:18:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 19:18:43,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:18:43,355 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 19:18:43,364 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-05 19:18:43,559 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-05 19:18:43,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:18:43,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:18:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 19:18:43,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 19:18:43,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522686128] [2025-02-05 19:18:43,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 19:18:43,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:18:43,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:18:43,563 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-05 19:18:43,565 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-05 19:18:43,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 19:18:43,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 19:18:43,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 19:18:43,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:18:43,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-05 19:18:43,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:18:44,207 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-05 19:18:44,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:19:06,033 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-05 19:19:06,033 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 19:19:06,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522686128] [2025-02-05 19:19:06,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522686128] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 19:19:06,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 19:19:06,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-02-05 19:19:06,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695031216] [2025-02-05 19:19:06,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 19:19:06,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 19:19:06,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 19:19:06,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 19:19:06,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=87, Unknown=4, NotChecked=0, Total=132 [2025-02-05 19:19:06,037 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-05 19:19:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 19:19:11,020 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-02-05 19:19:11,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 19:19:11,022 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-05 19:19:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 19:19:11,024 INFO L225 Difference]: With dead ends: 18 [2025-02-05 19:19:11,025 INFO L226 Difference]: Without dead ends: 16 [2025-02-05 19:19:11,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=92, Invalid=176, Unknown=4, NotChecked=0, Total=272 [2025-02-05 19:19:11,028 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 19:19:11,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 19:19:11,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-02-05 19:19:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-02-05 19:19:11,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 19:19:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-02-05 19:19:11,034 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-02-05 19:19:11,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 19:19:11,034 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-02-05 19:19:11,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-05 19:19:11,035 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-02-05 19:19:11,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 19:19:11,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 19:19:11,036 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-02-05 19:19:11,045 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-05 19:19:11,236 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-05 19:19:11,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 19:19:11,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 19:19:11,239 INFO L85 PathProgramCache]: Analyzing trace with hash -506187805, now seen corresponding path program 2 times [2025-02-05 19:19:11,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 19:19:11,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429706751] [2025-02-05 19:19:11,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 19:19:11,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 19:19:11,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 19:19:11,243 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-05 19:19:11,246 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-05 19:19:11,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-02-05 19:19:11,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 19:19:11,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 19:19:11,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 19:19:11,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-05 19:19:11,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 19:19:22,602 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-05 19:19:22,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 19:19:51,645 WARN L249 Executor]: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-02-05 19:19:51,646 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 19:19:51,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429706751] [2025-02-05 19:19:51,647 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-05 19:19:51,652 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 101 [2025-02-05 19:19:51,664 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-05 19:19:51,847 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-05 19:19:51,852 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:555) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:428) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:314) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:275) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2025-02-05 19:19:51,861 INFO L158 Benchmark]: Toolchain (without parser) took 71258.37ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 113.7MB in the beginning and 99.8MB in the end (delta: 13.9MB). Peak memory consumption was 135.5MB. Max. memory is 16.1GB. [2025-02-05 19:19:51,861 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 19:19:51,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.77ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 66.3MB in the end (delta: 47.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-05 19:19:51,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.43ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 55.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 19:19:51,863 INFO L158 Benchmark]: Boogie Preprocessor took 154.88ms. Allocated memory is still 142.6MB. Free memory was 55.7MB in the beginning and 105.4MB in the end (delta: -49.7MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2025-02-05 19:19:51,863 INFO L158 Benchmark]: IcfgBuilder took 1264.73ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 105.3MB in the beginning and 115.0MB in the end (delta: -9.7MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. [2025-02-05 19:19:51,863 INFO L158 Benchmark]: TraceAbstraction took 69183.22ms. Allocated memory is still 201.3MB. Free memory was 115.0MB in the beginning and 99.8MB in the end (delta: 15.2MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. [2025-02-05 19:19:51,865 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.14ms. Allocated memory is still 117.4MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.77ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 66.3MB in the end (delta: 47.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.43ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 55.7MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 154.88ms. Allocated memory is still 142.6MB. Free memory was 55.7MB in the beginning and 105.4MB in the end (delta: -49.7MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1264.73ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 105.3MB in the beginning and 115.0MB in the end (delta: -9.7MB). Peak memory consumption was 79.6MB. Max. memory is 16.1GB. * TraceAbstraction took 69183.22ms. Allocated memory is still 201.3MB. Free memory was 115.0MB in the beginning and 99.8MB in the end (delta: 15.2MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")