./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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-?-48c9605-m [2025-02-07 23:18:16,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:18:17,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-07 23:18:17,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:18:17,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:18:17,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:18:17,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:18:17,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:18:17,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:18:17,052 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:18:17,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:18:17,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:18:17,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:18:17,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:18:17,053 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:18:17,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:18:17,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:18:17,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:18:17,053 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:18:17,054 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:18:17,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:18:17,054 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:18:17,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:18:17,054 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:18:17,054 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:18:17,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:18:17,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:18:17,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:18:17,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:18:17,056 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-07 23:18:17,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:18:17,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:18:17,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:18:17,314 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:18:17,314 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:18:17,315 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-07 23:18:18,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b8a3b487/3e26db6feb5c40ddba2588c56052ab4c/FLAG25bf68d8c [2025-02-07 23:18:18,900 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:18:18,900 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-07 23:18:18,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b8a3b487/3e26db6feb5c40ddba2588c56052ab4c/FLAG25bf68d8c [2025-02-07 23:18:19,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4b8a3b487/3e26db6feb5c40ddba2588c56052ab4c [2025-02-07 23:18:19,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:18:19,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:18:19,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:18:19,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:18:19,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:18:19,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:19,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1674a51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19, skipping insertion in model container [2025-02-07 23:18:19,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:19,160 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:18:19,289 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-07 23:18:19,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:18:19,541 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:18:19,557 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-07 23:18:19,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:18:19,664 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:18:19,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19 WrapperNode [2025-02-07 23:18:19,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:18:19,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:18:19,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:18:19,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:18:19,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:19,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:20,106 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4657 [2025-02-07 23:18:20,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:18:20,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:18:20,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:18:20,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:18:20,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:20,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:20,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:20,328 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-07 23:18:20,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:20,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:20,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:20,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:20,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:20,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:20,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:18:20,734 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:18:20,735 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:18:20,735 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:18:20,736 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (1/1) ... [2025-02-07 23:18:20,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:18:20,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:18:20,796 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-07 23:18:20,802 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-07 23:18:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:18:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:18:20,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:18:20,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:18:21,075 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:18:21,076 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:18:24,461 INFO L? ?]: Removed 2668 outVars from TransFormulas that were not future-live. [2025-02-07 23:18:24,461 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:18:24,594 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:18:24,595 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:18:24,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:18:24 BoogieIcfgContainer [2025-02-07 23:18:24,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:18:24,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:18:24,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:18:24,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:18:24,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:18:19" (1/3) ... [2025-02-07 23:18:24,600 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b563773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:18:24, skipping insertion in model container [2025-02-07 23:18:24,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:19" (2/3) ... [2025-02-07 23:18:24,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b563773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:18:24, skipping insertion in model container [2025-02-07 23:18:24,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:18:24" (3/3) ... [2025-02-07 23:18:24,601 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.2.prop1-func-interl.c [2025-02-07 23:18:24,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:18:24,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.krebs.2.prop1-func-interl.c that has 1 procedures, 1568 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:18:24,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:18:24,668 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;@61d2a008, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:18:24,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:18:24,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 1568 states, 1566 states have (on average 1.5051085568326947) internal successors, (2357), 1567 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-07 23:18:24,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-07 23:18:24,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:18:24,679 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] [2025-02-07 23:18:24,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:18:24,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:18:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1808420257, now seen corresponding path program 1 times [2025-02-07 23:18:24,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:18:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549546966] [2025-02-07 23:18:24,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:18:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:18:24,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-07 23:18:24,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-07 23:18:24,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:18:24,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:18:25,483 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-07 23:18:25,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:18:25,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549546966] [2025-02-07 23:18:25,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549546966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:18:25,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:18:25,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:18:25,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980416256] [2025-02-07 23:18:25,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:18:25,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:18:25,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:18:25,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:18:25,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:18:25,515 INFO L87 Difference]: Start difference. First operand has 1568 states, 1566 states have (on average 1.5051085568326947) internal successors, (2357), 1567 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) Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-07 23:18:26,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:18:26,199 INFO L93 Difference]: Finished difference Result 2999 states and 4511 transitions. [2025-02-07 23:18:26,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:18:26,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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 112 [2025-02-07 23:18:26,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:18:26,220 INFO L225 Difference]: With dead ends: 2999 [2025-02-07 23:18:26,223 INFO L226 Difference]: Without dead ends: 1568 [2025-02-07 23:18:26,228 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-07 23:18:26,230 INFO L435 NwaCegarLoop]: 1966 mSDtfsCounter, 0 mSDsluCounter, 3927 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5893 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.6s IncrementalHoareTripleChecker+Time [2025-02-07 23:18:26,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5893 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:18:26,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2025-02-07 23:18:26,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2025-02-07 23:18:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1567 states have (on average 1.503509891512444) internal successors, (2356), 1567 states have internal predecessors, (2356), 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-07 23:18:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2356 transitions. [2025-02-07 23:18:26,309 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2356 transitions. Word has length 112 [2025-02-07 23:18:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:18:26,310 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2356 transitions. [2025-02-07 23:18:26,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 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-07 23:18:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2356 transitions. [2025-02-07 23:18:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-07 23:18:26,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:18:26,313 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-07 23:18:26,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:18:26,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:18:26,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:18:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash -221771620, now seen corresponding path program 1 times [2025-02-07 23:18:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:18:26,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439605465] [2025-02-07 23:18:26,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:18:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:18:26,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-07 23:18:26,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-07 23:18:26,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:18:26,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:18:26,701 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-07 23:18:26,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:18:26,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439605465] [2025-02-07 23:18:26,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439605465] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:18:26,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:18:26,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:18:26,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415324569] [2025-02-07 23:18:26,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:18:26,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:18:26,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:18:26,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:18:26,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:18:26,703 INFO L87 Difference]: Start difference. First operand 1568 states and 2356 transitions. 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-07 23:18:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:18:27,665 INFO L93 Difference]: Finished difference Result 3001 states and 4510 transitions. [2025-02-07 23:18:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:18:27,665 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-07 23:18:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:18:27,671 INFO L225 Difference]: With dead ends: 3001 [2025-02-07 23:18:27,671 INFO L226 Difference]: Without dead ends: 1570 [2025-02-07 23:18:27,673 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-07 23:18:27,676 INFO L435 NwaCegarLoop]: 1966 mSDtfsCounter, 0 mSDsluCounter, 3924 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5890 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.9s IncrementalHoareTripleChecker+Time [2025-02-07 23:18:27,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5890 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 23:18:27,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-02-07 23:18:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2025-02-07 23:18:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1569 states have (on average 1.502868068833652) internal successors, (2358), 1569 states have internal predecessors, (2358), 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-07 23:18:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2358 transitions. [2025-02-07 23:18:27,713 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2358 transitions. Word has length 113 [2025-02-07 23:18:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:18:27,714 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2358 transitions. [2025-02-07 23:18:27,714 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-07 23:18:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2358 transitions. [2025-02-07 23:18:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-07 23:18:27,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:18:27,719 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-07 23:18:27,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:18:27,719 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:18:27,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:18:27,719 INFO L85 PathProgramCache]: Analyzing trace with hash -648441350, now seen corresponding path program 1 times [2025-02-07 23:18:27,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:18:27,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422820212] [2025-02-07 23:18:27,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:18:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:18:27,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-07 23:18:27,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-07 23:18:27,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:18:27,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:18:27,941 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-07 23:18:27,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:18:27,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422820212] [2025-02-07 23:18:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422820212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:18:27,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:18:27,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:18:27,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253984356] [2025-02-07 23:18:27,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:18:27,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:18:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:18:27,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:18:27,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:18:27,943 INFO L87 Difference]: Start difference. First operand 1570 states and 2358 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-07 23:18:28,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:18:28,568 INFO L93 Difference]: Finished difference Result 3009 states and 4520 transitions. [2025-02-07 23:18:28,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:18:28,569 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-07 23:18:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:18:28,574 INFO L225 Difference]: With dead ends: 3009 [2025-02-07 23:18:28,575 INFO L226 Difference]: Without dead ends: 1576 [2025-02-07 23:18:28,576 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-07 23:18:28,577 INFO L435 NwaCegarLoop]: 1966 mSDtfsCounter, 4 mSDsluCounter, 3919 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5885 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-07 23:18:28,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5885 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 23:18:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-02-07 23:18:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2025-02-07 23:18:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.5022222222222221) internal successors, (2366), 1575 states have internal predecessors, (2366), 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-07 23:18:28,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2366 transitions. [2025-02-07 23:18:28,603 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2366 transitions. Word has length 114 [2025-02-07 23:18:28,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:18:28,604 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2366 transitions. [2025-02-07 23:18:28,604 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-07 23:18:28,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2366 transitions. [2025-02-07 23:18:28,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-07 23:18:28,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:18:28,605 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-07 23:18:28,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:18:28,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:18:28,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:18:28,606 INFO L85 PathProgramCache]: Analyzing trace with hash 452232038, now seen corresponding path program 1 times [2025-02-07 23:18:28,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:18:28,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232235196] [2025-02-07 23:18:28,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:18:28,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:18:28,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-07 23:18:28,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-07 23:18:28,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:18:28,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:18:28,864 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-07 23:18:28,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:18:28,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232235196] [2025-02-07 23:18:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232235196] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:18:28,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:18:28,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 23:18:28,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452679590] [2025-02-07 23:18:28,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:18:28,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:18:28,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:18:28,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:18:28,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:18:28,867 INFO L87 Difference]: Start difference. First operand 1576 states and 2366 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 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-07 23:18:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:18:29,656 INFO L93 Difference]: Finished difference Result 3019 states and 4532 transitions. [2025-02-07 23:18:29,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:18:29,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 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-07 23:18:29,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:18:29,662 INFO L225 Difference]: With dead ends: 3019 [2025-02-07 23:18:29,663 INFO L226 Difference]: Without dead ends: 1580 [2025-02-07 23:18:29,665 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-07 23:18:29,667 INFO L435 NwaCegarLoop]: 1966 mSDtfsCounter, 0 mSDsluCounter, 3919 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5885 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.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:18:29,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5885 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-07 23:18:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-02-07 23:18:29,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1576. [2025-02-07 23:18:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.5022222222222221) internal successors, (2366), 1575 states have internal predecessors, (2366), 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-07 23:18:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2366 transitions. [2025-02-07 23:18:29,699 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2366 transitions. Word has length 115 [2025-02-07 23:18:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:18:29,700 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2366 transitions. [2025-02-07 23:18:29,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 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-07 23:18:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2366 transitions. [2025-02-07 23:18:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-07 23:18:29,702 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:18:29,702 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-07 23:18:29,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:18:29,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:18:29,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:18:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1272311147, now seen corresponding path program 1 times [2025-02-07 23:18:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:18:29,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068820555] [2025-02-07 23:18:29,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:18:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:18:29,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-07 23:18:29,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-07 23:18:29,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:18:29,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:18:29,987 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-07 23:18:29,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:18:29,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068820555] [2025-02-07 23:18:29,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068820555] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:18:29,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:18:29,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:18:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445107739] [2025-02-07 23:18:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:18:29,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:18:29,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:18:29,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:18:29,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:18:29,989 INFO L87 Difference]: Start difference. First operand 1576 states and 2366 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 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-07 23:18:31,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:18:31,806 INFO L93 Difference]: Finished difference Result 4438 states and 6664 transitions. [2025-02-07 23:18:31,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:18:31,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 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-07 23:18:31,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:18:31,816 INFO L225 Difference]: With dead ends: 4438 [2025-02-07 23:18:31,816 INFO L226 Difference]: Without dead ends: 2999 [2025-02-07 23:18:31,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 23:18:31,818 INFO L435 NwaCegarLoop]: 1579 mSDtfsCounter, 2233 mSDsluCounter, 4616 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2233 SdHoareTripleChecker+Valid, 6195 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.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:18:31,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2233 Valid, 6195 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-07 23:18:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2025-02-07 23:18:31,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 1643. [2025-02-07 23:18:31,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1642 states have (on average 1.5012180267965896) internal successors, (2465), 1642 states have internal predecessors, (2465), 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-07 23:18:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2465 transitions. [2025-02-07 23:18:31,849 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2465 transitions. Word has length 116 [2025-02-07 23:18:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:18:31,849 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2465 transitions. [2025-02-07 23:18:31,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 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-07 23:18:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2465 transitions. [2025-02-07 23:18:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-07 23:18:31,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:18:31,850 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-07 23:18:31,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 23:18:31,850 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:18:31,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:18:31,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1208897187, now seen corresponding path program 1 times [2025-02-07 23:18:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:18:31,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601732412] [2025-02-07 23:18:31,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:18:31,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:18:31,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-07 23:18:31,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-07 23:18:31,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:18:31,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:18:32,049 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-07 23:18:32,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:18:32,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601732412] [2025-02-07 23:18:32,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601732412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:18:32,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:18:32,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:18:32,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377320392] [2025-02-07 23:18:32,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:18:32,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 23:18:32,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:18:32,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 23:18:32,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:18:32,056 INFO L87 Difference]: Start difference. First operand 1643 states and 2465 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 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-07 23:18:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:18:33,766 INFO L93 Difference]: Finished difference Result 3082 states and 4626 transitions. [2025-02-07 23:18:33,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 23:18:33,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 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-07 23:18:33,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:18:33,771 INFO L225 Difference]: With dead ends: 3082 [2025-02-07 23:18:33,771 INFO L226 Difference]: Without dead ends: 1643 [2025-02-07 23:18:33,772 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-07 23:18:33,773 INFO L435 NwaCegarLoop]: 1571 mSDtfsCounter, 2248 mSDsluCounter, 3132 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2248 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:18:33,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2248 Valid, 4703 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-07 23:18:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-02-07 23:18:33,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1643. [2025-02-07 23:18:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1642 states have (on average 1.4987819732034104) internal successors, (2461), 1642 states have internal predecessors, (2461), 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-07 23:18:33,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2461 transitions. [2025-02-07 23:18:33,793 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2461 transitions. Word has length 117 [2025-02-07 23:18:33,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:18:33,794 INFO L471 AbstractCegarLoop]: Abstraction has 1643 states and 2461 transitions. [2025-02-07 23:18:33,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 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-07 23:18:33,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2461 transitions. [2025-02-07 23:18:33,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-07 23:18:33,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:18:33,795 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-07 23:18:33,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 23:18:33,795 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:18:33,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:18:33,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1291455409, now seen corresponding path program 1 times [2025-02-07 23:18:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:18:33,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908688950] [2025-02-07 23:18:33,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:18:33,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:18:33,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-07 23:18:33,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-07 23:18:33,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:18:33,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:18:33,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:18:33,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-07 23:18:33,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-07 23:18:33,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:18:33,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:18:33,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:18:33,973 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:18:33,974 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:18:33,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 23:18:33,977 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-07 23:18:34,040 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:18:34,060 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:18:34,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:18:34 BoogieIcfgContainer [2025-02-07 23:18:34,065 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:18:34,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:18:34,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:18:34,066 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:18:34,066 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:18:24" (3/4) ... [2025-02-07 23:18:34,068 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:18:34,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:18:34,069 INFO L158 Benchmark]: Toolchain (without parser) took 14957.83ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 121.9MB in the beginning and 215.0MB in the end (delta: -93.1MB). Peak memory consumption was 222.2MB. Max. memory is 16.1GB. [2025-02-07 23:18:34,070 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:18:34,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.48ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 60.4MB in the end (delta: 61.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-07 23:18:34,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 441.26ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 60.4MB in the beginning and 62.2MB in the end (delta: -1.8MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2025-02-07 23:18:34,071 INFO L158 Benchmark]: Boogie Preprocessor took 625.95ms. Allocated memory was 176.2MB in the beginning and 394.3MB in the end (delta: 218.1MB). Free memory was 62.2MB in the beginning and 266.8MB in the end (delta: -204.6MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2025-02-07 23:18:34,071 INFO L158 Benchmark]: IcfgBuilder took 3860.71ms. Allocated memory was 394.3MB in the beginning and 478.2MB in the end (delta: 83.9MB). Free memory was 266.3MB in the beginning and 125.5MB in the end (delta: 140.9MB). Peak memory consumption was 295.6MB. Max. memory is 16.1GB. [2025-02-07 23:18:34,071 INFO L158 Benchmark]: TraceAbstraction took 9468.46ms. Allocated memory is still 478.2MB. Free memory was 125.5MB in the beginning and 215.0MB in the end (delta: -89.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:18:34,072 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 478.2MB. Free memory was 215.0MB in the beginning and 215.0MB in the end (delta: 25.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:18:34,073 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.13ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 553.48ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 60.4MB in the end (delta: 61.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 441.26ms. Allocated memory was 167.8MB in the beginning and 176.2MB in the end (delta: 8.4MB). Free memory was 60.4MB in the beginning and 62.2MB in the end (delta: -1.8MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 625.95ms. Allocated memory was 176.2MB in the beginning and 394.3MB in the end (delta: 218.1MB). Free memory was 62.2MB in the beginning and 266.8MB in the end (delta: -204.6MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * IcfgBuilder took 3860.71ms. Allocated memory was 394.3MB in the beginning and 478.2MB in the end (delta: 83.9MB). Free memory was 266.3MB in the beginning and 125.5MB in the end (delta: 140.9MB). Peak memory consumption was 295.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9468.46ms. Allocated memory is still 478.2MB. Free memory was 125.5MB in the beginning and 215.0MB in the end (delta: -89.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 478.2MB. Free memory was 215.0MB in the beginning and 215.0MB in the end (delta: 25.6kB). 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 215, overapproximation of bitwiseAnd at line 213. 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, 1568 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4485 SdHoareTripleChecker+Valid, 6.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4485 mSDsluCounter, 34451 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23437 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10052 IncrementalHoareTripleChecker+Invalid, 10055 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 11014 mSDtfsCounter, 10052 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1643occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1360 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 805 NumberOfCodeBlocks, 805 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 681 ConstructedInterpolants, 0 QuantifiedInterpolants, 1586 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-07 23:18:34,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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-?-48c9605-m [2025-02-07 23:18:36,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:18:36,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-07 23:18:36,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:18:36,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:18:36,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:18:36,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:18:36,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:18:36,336 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:18:36,336 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:18:36,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:18:36,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:18:36,336 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:18:36,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:18:36,336 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:18:36,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:18:36,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:18:36,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:18:36,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:18:36,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:18:36,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:18:36,337 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:18:36,338 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:18:36,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:18:36,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:18:36,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:18:36,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:18:36,338 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-07 23:18:36,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:18:36,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:18:36,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:18:36,797 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:18:36,797 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:18:36,798 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-07 23:18:38,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/864ef357d/da1e5d4d52294f028a6a96656c5f36b9/FLAG60e5df67c [2025-02-07 23:18:38,294 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:18:38,297 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-07 23:18:38,312 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/864ef357d/da1e5d4d52294f028a6a96656c5f36b9/FLAG60e5df67c [2025-02-07 23:18:38,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/864ef357d/da1e5d4d52294f028a6a96656c5f36b9 [2025-02-07 23:18:38,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:18:38,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:18:38,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:18:38,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:18:38,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:18:38,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:38,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@440b43e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38, skipping insertion in model container [2025-02-07 23:18:38,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:38,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:18:38,522 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-07 23:18:38,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:18:38,788 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:18:38,795 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-07 23:18:38,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:18:38,883 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:18:38,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38 WrapperNode [2025-02-07 23:18:38,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:18:38,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:18:38,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:18:38,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:18:38,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:38,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:38,968 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1537 [2025-02-07 23:18:38,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:18:38,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:18:38,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:18:38,969 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:18:38,976 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:38,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:38,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:39,013 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-07 23:18:39,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:39,013 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:39,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:39,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:39,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:39,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:39,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:18:39,053 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:18:39,053 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:18:39,053 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:18:39,054 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (1/1) ... [2025-02-07 23:18:39,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:18:39,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:18:39,078 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-07 23:18:39,085 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-07 23:18:39,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:18:39,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:18:39,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:18:39,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:18:39,321 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:18:39,322 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:18:40,381 INFO L? ?]: Removed 69 outVars from TransFormulas that were not future-live. [2025-02-07 23:18:40,381 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:18:40,388 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:18:40,388 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:18:40,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:18:40 BoogieIcfgContainer [2025-02-07 23:18:40,389 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:18:40,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:18:40,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:18:40,393 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:18:40,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:18:38" (1/3) ... [2025-02-07 23:18:40,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb45058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:18:40, skipping insertion in model container [2025-02-07 23:18:40,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:18:38" (2/3) ... [2025-02-07 23:18:40,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb45058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:18:40, skipping insertion in model container [2025-02-07 23:18:40,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:18:40" (3/3) ... [2025-02-07 23:18:40,396 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.2.prop1-func-interl.c [2025-02-07 23:18:40,405 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:18:40,406 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.krebs.2.prop1-func-interl.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:18:40,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:18:40,445 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;@36c8fe92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:18:40,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:18:40,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:18:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:18:40,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:18:40,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:18:40,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:18:40,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:18:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:18:40,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:18:40,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227319634] [2025-02-07 23:18:40,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:18:40,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:18:40,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:18:40,468 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-07 23:18:40,470 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-07 23:18:40,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:18:40,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:18:40,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:18:40,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:18:40,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-07 23:18:40,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:18:40,863 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-07 23:18:40,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:18:40,863 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:18:40,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227319634] [2025-02-07 23:18:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227319634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:18:40,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:18:40,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:18:40,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134996525] [2025-02-07 23:18:40,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:18:40,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:18:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:18:40,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:18:40,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:18:40,879 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:18:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:18:40,958 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2025-02-07 23:18:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:18:40,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-07 23:18:40,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:18:40,963 INFO L225 Difference]: With dead ends: 16 [2025-02-07 23:18:40,963 INFO L226 Difference]: Without dead ends: 9 [2025-02-07 23:18:40,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 23:18:40,966 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:18:40,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:18:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-07 23:18:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-02-07 23:18:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:18:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:18:40,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:18:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:18:40,984 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:18:40,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:18:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:18:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:18:40,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:18:40,984 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:18:40,993 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-07 23:18:41,185 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-07 23:18:41,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:18:41,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:18:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:18:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:18:41,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [730333843] [2025-02-07 23:18:41,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:18:41,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:18:41,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:18:41,189 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-07 23:18:41,190 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-07 23:18:41,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:18:41,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:18:41,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:18:41,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:18:41,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-07 23:18:41,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:18:41,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:18:41,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:19:02,464 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-07 23:19:02,465 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:19:02,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730333843] [2025-02-07 23:19:02,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730333843] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:19:02,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:19:02,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-07 23:19:02,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684425561] [2025-02-07 23:19:02,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:19:02,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 23:19:02,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:19:02,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 23:19:02,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=87, Unknown=4, NotChecked=0, Total=132 [2025-02-07 23:19:02,468 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:19:07,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:19:07,692 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-02-07 23:19:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:19:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 23:19:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:19:07,694 INFO L225 Difference]: With dead ends: 17 [2025-02-07 23:19:07,694 INFO L226 Difference]: Without dead ends: 15 [2025-02-07 23:19:07,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=92, Invalid=176, Unknown=4, NotChecked=0, Total=272 [2025-02-07 23:19:07,695 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-07 23:19:07,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-07 23:19:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-02-07 23:19:07,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2025-02-07 23:19:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:19:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-07 23:19:07,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2025-02-07 23:19:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:19:07,700 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-07 23:19:07,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:19:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-07 23:19:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 23:19:07,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:19:07,701 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-02-07 23:19:07,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 23:19:07,903 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-07 23:19:07,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:19:07,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:19:07,904 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 2 times [2025-02-07 23:19:07,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:19:07,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1454275601] [2025-02-07 23:19:07,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:19:07,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:19:07,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:19:07,911 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-07 23:19:07,919 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-07 23:19:08,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-02-07 23:19:08,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 23:19:08,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:19:08,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:19:08,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-07 23:19:08,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:19:17,404 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-07 23:19:17,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:19:43,022 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-07 23:19:43,023 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:19:43,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454275601] [2025-02-07 23:19:43,023 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2025-02-07 23:19:43,024 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 101 [2025-02-07 23:19:43,035 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-07 23:19:43,224 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-07 23:19:43,225 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-07 23:19:43,229 INFO L158 Benchmark]: Toolchain (without parser) took 64898.92ms. Allocated memory was 83.9MB in the beginning and 268.4MB in the end (delta: 184.5MB). Free memory was 57.6MB in the beginning and 108.6MB in the end (delta: -51.0MB). Peak memory consumption was 132.0MB. Max. memory is 16.1GB. [2025-02-07 23:19:43,230 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:19:43,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.83ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 57.4MB in the beginning and 67.6MB in the end (delta: -10.2MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2025-02-07 23:19:43,230 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.13ms. Allocated memory is still 100.7MB. Free memory was 67.6MB in the beginning and 56.9MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:19:43,230 INFO L158 Benchmark]: Boogie Preprocessor took 83.03ms. Allocated memory is still 100.7MB. Free memory was 56.9MB in the beginning and 44.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:19:43,230 INFO L158 Benchmark]: IcfgBuilder took 1336.29ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 44.3MB in the beginning and 130.8MB in the end (delta: -86.4MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. [2025-02-07 23:19:43,231 INFO L158 Benchmark]: TraceAbstraction took 62838.43ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 129.0MB in the beginning and 108.6MB in the end (delta: 20.3MB). Peak memory consumption was 109.3MB. Max. memory is 16.1GB. [2025-02-07 23:19:43,232 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.29ms. Allocated memory is still 83.9MB. Free memory is still 47.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.83ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 57.4MB in the beginning and 67.6MB in the end (delta: -10.2MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.13ms. Allocated memory is still 100.7MB. Free memory was 67.6MB in the beginning and 56.9MB in the end (delta: 10.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.03ms. Allocated memory is still 100.7MB. Free memory was 56.9MB in the beginning and 44.3MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 1336.29ms. Allocated memory was 100.7MB in the beginning and 176.2MB in the end (delta: 75.5MB). Free memory was 44.3MB in the beginning and 130.8MB in the end (delta: -86.4MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. * TraceAbstraction took 62838.43ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 129.0MB in the beginning and 108.6MB in the end (delta: 20.3MB). Peak memory consumption was 109.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")