./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.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.eq_sdp_v3.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 449d552a97f801da54ed90777e1477523d6fe1962bd976a4f73c924025a5f144 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:02:47,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:02:47,270 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:02:47,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:02:47,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:02:47,312 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:02:47,313 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:02:47,313 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:02:47,314 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:02:47,314 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:02:47,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:02:47,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:02:47,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:02:47,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:02:47,316 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:02:47,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:02:47,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:02:47,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 23:02:47,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:02:47,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:02:47,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:02:47,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:02:47,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:02:47,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:02:47,318 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:02:47,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:02:47,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:02:47,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:02:47,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:02:47,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:02:47,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:02:47,319 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:02:47,319 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:02:47,319 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:02:47,319 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 23:02:47,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 23:02:47,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:02:47,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:02:47,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:02:47,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:02:47,320 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 -> 449d552a97f801da54ed90777e1477523d6fe1962bd976a4f73c924025a5f144 [2025-02-07 23:02:47,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:02:47,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:02:47,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:02:47,628 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:02:47,633 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:02:47,633 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.eq_sdp_v3.c [2025-02-07 23:02:48,955 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26e2ad7f1/b0db033d786445758b459001f252792c/FLAGef10f7f8e [2025-02-07 23:02:49,198 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:02:49,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2025-02-07 23:02:49,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26e2ad7f1/b0db033d786445758b459001f252792c/FLAGef10f7f8e [2025-02-07 23:02:49,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/26e2ad7f1/b0db033d786445758b459001f252792c [2025-02-07 23:02:49,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:02:49,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:02:49,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:02:49,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:02:49,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:02:49,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d353c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49, skipping insertion in model container [2025-02-07 23:02:49,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:02:49,349 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.eq_sdp_v3.c[1249,1262] [2025-02-07 23:02:49,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:02:49,440 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:02:49,454 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.eq_sdp_v3.c[1249,1262] [2025-02-07 23:02:49,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:02:49,496 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:02:49,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49 WrapperNode [2025-02-07 23:02:49,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:02:49,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:02:49,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:02:49,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:02:49,503 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:02:49" (1/1) ... [2025-02-07 23:02:49,515 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:02:49" (1/1) ... [2025-02-07 23:02:49,589 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 419 [2025-02-07 23:02:49,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:02:49,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:02:49,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:02:49,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:02:49,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,649 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:02:49,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,673 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:02:49,706 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:02:49,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:02:49,708 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:02:49,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49" (1/1) ... [2025-02-07 23:02:49,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:02:49,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:02:49,746 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:02:49,750 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:02:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:02:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 23:02:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:02:49,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:02:49,892 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:02:49,894 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:02:50,339 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2025-02-07 23:02:50,339 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:02:50,371 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:02:50,372 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:02:50,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:02:50 BoogieIcfgContainer [2025-02-07 23:02:50,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:02:50,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:02:50,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:02:50,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:02:50,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:02:49" (1/3) ... [2025-02-07 23:02:50,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3dab65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:02:50, skipping insertion in model container [2025-02-07 23:02:50,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:49" (2/3) ... [2025-02-07 23:02:50,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d3dab65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:02:50, skipping insertion in model container [2025-02-07 23:02:50,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:02:50" (3/3) ... [2025-02-07 23:02:50,379 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v3.c [2025-02-07 23:02:50,388 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:02:50,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v3.c that has 1 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:02:50,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:02:50,430 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;@2d92129, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:02:50,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:02:50,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 90 states have (on average 1.5) internal successors, (135), 91 states have internal predecessors, (135), 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:02:50,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-07 23:02:50,439 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:50,440 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] [2025-02-07 23:02:50,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:50,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:50,446 INFO L85 PathProgramCache]: Analyzing trace with hash -297899566, now seen corresponding path program 1 times [2025-02-07 23:02:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:02:50,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480293058] [2025-02-07 23:02:50,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:50,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:02:50,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-07 23:02:50,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-07 23:02:50,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:50,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:02:50,948 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:02:50,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:02:50,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480293058] [2025-02-07 23:02:50,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480293058] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:02:50,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:02:50,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:02:50,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170536524] [2025-02-07 23:02:50,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:02:50,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:02:50,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:02:50,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:02:50,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:02:50,968 INFO L87 Difference]: Start difference. First operand has 92 states, 90 states have (on average 1.5) internal successors, (135), 91 states have internal predecessors, (135), 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 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:02:51,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:02:51,057 INFO L93 Difference]: Finished difference Result 135 states and 199 transitions. [2025-02-07 23:02:51,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:02:51,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 38 [2025-02-07 23:02:51,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:02:51,062 INFO L225 Difference]: With dead ends: 135 [2025-02-07 23:02:51,063 INFO L226 Difference]: Without dead ends: 92 [2025-02-07 23:02:51,065 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:02:51,067 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:02:51,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:02:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-07 23:02:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-07 23:02:51,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4725274725274726) internal successors, (134), 91 states have internal predecessors, (134), 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:02:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-02-07 23:02:51,099 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 38 [2025-02-07 23:02:51,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:02:51,100 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-02-07 23:02:51,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:02:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-02-07 23:02:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-07 23:02:51,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:51,103 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] [2025-02-07 23:02:51,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 23:02:51,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:51,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash -640272783, now seen corresponding path program 1 times [2025-02-07 23:02:51,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:02:51,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884730596] [2025-02-07 23:02:51,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:51,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:02:51,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-07 23:02:51,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-07 23:02:51,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:51,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:02:51,265 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:02:51,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:02:51,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884730596] [2025-02-07 23:02:51,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884730596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:02:51,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:02:51,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 23:02:51,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252571000] [2025-02-07 23:02:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:02:51,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:02:51,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:02:51,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:02:51,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:02:51,269 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:02:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:02:51,350 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2025-02-07 23:02:51,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:02:51,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 39 [2025-02-07 23:02:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:02:51,353 INFO L225 Difference]: With dead ends: 137 [2025-02-07 23:02:51,353 INFO L226 Difference]: Without dead ends: 94 [2025-02-07 23:02:51,353 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:02:51,354 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 23:02:51,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 23:02:51,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-07 23:02:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-07 23:02:51,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 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:02:51,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2025-02-07 23:02:51,365 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 39 [2025-02-07 23:02:51,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:02:51,365 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2025-02-07 23:02:51,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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:02:51,365 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2025-02-07 23:02:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-07 23:02:51,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:51,366 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] [2025-02-07 23:02:51,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 23:02:51,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:51,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:51,367 INFO L85 PathProgramCache]: Analyzing trace with hash -737077843, now seen corresponding path program 1 times [2025-02-07 23:02:51,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:02:51,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455596511] [2025-02-07 23:02:51,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:51,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:02:51,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-07 23:02:51,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-07 23:02:51,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:51,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:02:51,612 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:02:51,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 23:02:51,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455596511] [2025-02-07 23:02:51,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455596511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:02:51,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:02:51,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:02:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872353896] [2025-02-07 23:02:51,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:02:51,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:02:51,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 23:02:51,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:02:51,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:02:51,614 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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:02:51,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:02:51,677 INFO L93 Difference]: Finished difference Result 137 states and 197 transitions. [2025-02-07 23:02:51,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:02:51,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2025-02-07 23:02:51,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:02:51,679 INFO L225 Difference]: With dead ends: 137 [2025-02-07 23:02:51,679 INFO L226 Difference]: Without dead ends: 92 [2025-02-07 23:02:51,680 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:02:51,680 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:02:51,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 206 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:02:51,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-07 23:02:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-07 23:02:51,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4505494505494505) internal successors, (132), 91 states have internal predecessors, (132), 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:02:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2025-02-07 23:02:51,689 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 40 [2025-02-07 23:02:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:02:51,689 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2025-02-07 23:02:51,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 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:02:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2025-02-07 23:02:51,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-07 23:02:51,690 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:51,690 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] [2025-02-07 23:02:51,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 23:02:51,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:51,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash 349987430, now seen corresponding path program 1 times [2025-02-07 23:02:51,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 23:02:51,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469583275] [2025-02-07 23:02:51,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 23:02:51,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 23:02:51,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 23:02:51,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:51,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:02:51,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:02:51,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-07 23:02:51,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-07 23:02:51,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:51,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:02:51,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 23:02:51,790 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:02:51,791 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:02:51,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 23:02:51,795 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-07 23:02:51,818 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:02:51,826 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:02:51,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:02:51 BoogieIcfgContainer [2025-02-07 23:02:51,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:02:51,830 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:02:51,830 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:02:51,830 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:02:51,830 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:02:50" (3/4) ... [2025-02-07 23:02:51,831 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-07 23:02:51,832 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:02:51,833 INFO L158 Benchmark]: Toolchain (without parser) took 2607.37ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 111.4MB in the beginning and 205.4MB in the end (delta: -94.1MB). Peak memory consumption was 123.3MB. Max. memory is 16.1GB. [2025-02-07 23:02:51,834 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:02:51,834 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.60ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 95.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:02:51,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.39ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 86.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 23:02:51,835 INFO L158 Benchmark]: Boogie Preprocessor took 114.79ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 81.4MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:02:51,835 INFO L158 Benchmark]: IcfgBuilder took 666.40ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 94.7MB in the end (delta: -13.3MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. [2025-02-07 23:02:51,836 INFO L158 Benchmark]: TraceAbstraction took 1455.21ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 94.0MB in the beginning and 205.4MB in the end (delta: -111.5MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. [2025-02-07 23:02:51,836 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 360.7MB. Free memory was 205.4MB in the beginning and 205.4MB in the end (delta: 13.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:02:51,837 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 122.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.60ms. Allocated memory is still 142.6MB. Free memory was 111.4MB in the beginning and 95.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.39ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 86.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.79ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 81.4MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 666.40ms. Allocated memory is still 142.6MB. Free memory was 81.4MB in the beginning and 94.7MB in the end (delta: -13.3MB). Peak memory consumption was 58.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1455.21ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 94.0MB in the beginning and 205.4MB in the end (delta: -111.5MB). Peak memory consumption was 107.2MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 360.7MB. Free memory was 205.4MB in the beginning and 205.4MB in the end (delta: 13.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 102. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_10=0, var_18=1, var_28=0] [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] EXPR input_7 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] EXPR input_8 & mask_SORT_5 VAL [input_7=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] EXPR input_9 & mask_SORT_5 VAL [input_7=0, input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_28=0] [L102] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] EXPR var_20 & mask_SORT_5 VAL [input_7=0, input_8=0, input_9=0, mask_SORT_1=255, mask_SORT_5=1, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 847 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 525 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 200 IncrementalHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 322 mSDtfsCounter, 200 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 114 ConstructedInterpolants, 0 QuantifiedInterpolants, 201 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-07 23:02:51,857 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.eq_sdp_v3.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 449d552a97f801da54ed90777e1477523d6fe1962bd976a4f73c924025a5f144 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 23:02:53,992 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 23:02:54,065 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:02:54,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 23:02:54,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 23:02:54,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 23:02:54,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 23:02:54,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 23:02:54,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 23:02:54,115 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 23:02:54,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 23:02:54,115 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 23:02:54,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 23:02:54,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 23:02:54,116 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 23:02:54,116 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 23:02:54,117 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 23:02:54,117 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:02:54,117 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 23:02:54,117 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 23:02:54,117 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 23:02:54,117 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 23:02:54,117 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-07 23:02:54,117 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-07 23:02:54,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 23:02:54,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 23:02:54,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 23:02:54,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 23:02:54,117 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 -> 449d552a97f801da54ed90777e1477523d6fe1962bd976a4f73c924025a5f144 [2025-02-07 23:02:54,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 23:02:54,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 23:02:54,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 23:02:54,345 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 23:02:54,345 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 23:02:54,346 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.eq_sdp_v3.c [2025-02-07 23:02:55,523 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a8181897/4c89bfc6b30741788f990c0266259c8d/FLAG060008d05 [2025-02-07 23:02:55,767 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 23:02:55,767 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2025-02-07 23:02:55,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a8181897/4c89bfc6b30741788f990c0266259c8d/FLAG060008d05 [2025-02-07 23:02:56,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a8181897/4c89bfc6b30741788f990c0266259c8d [2025-02-07 23:02:56,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 23:02:56,104 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 23:02:56,105 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 23:02:56,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 23:02:56,108 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 23:02:56,109 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,109 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:02:56, skipping insertion in model container [2025-02-07 23:02:56,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 23:02:56,238 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.eq_sdp_v3.c[1249,1262] [2025-02-07 23:02:56,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:02:56,290 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 23:02:56,297 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.eq_sdp_v3.c[1249,1262] [2025-02-07 23:02:56,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 23:02:56,329 INFO L204 MainTranslator]: Completed translation [2025-02-07 23:02:56,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56 WrapperNode [2025-02-07 23:02:56,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 23:02:56,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 23:02:56,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 23:02:56,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 23:02:56,334 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:02:56" (1/1) ... [2025-02-07 23:02:56,340 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:02:56" (1/1) ... [2025-02-07 23:02:56,359 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 251 [2025-02-07 23:02:56,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 23:02:56,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 23:02:56,360 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 23:02:56,360 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 23:02:56,365 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,369 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,377 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:02:56,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,378 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 23:02:56,390 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 23:02:56,390 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 23:02:56,390 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 23:02:56,391 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56" (1/1) ... [2025-02-07 23:02:56,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 23:02:56,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:02:56,412 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:02:56,414 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:02:56,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 23:02:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-07 23:02:56,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 23:02:56,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 23:02:56,525 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 23:02:56,527 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 23:02:56,717 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-02-07 23:02:56,717 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 23:02:56,737 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 23:02:56,738 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 23:02:56,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:02:56 BoogieIcfgContainer [2025-02-07 23:02:56,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 23:02:56,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 23:02:56,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 23:02:56,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 23:02:56,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:02:56" (1/3) ... [2025-02-07 23:02:56,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b214905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:02:56, skipping insertion in model container [2025-02-07 23:02:56,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:02:56" (2/3) ... [2025-02-07 23:02:56,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b214905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:02:56, skipping insertion in model container [2025-02-07 23:02:56,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:02:56" (3/3) ... [2025-02-07 23:02:56,745 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v3.c [2025-02-07 23:02:56,754 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 23:02:56,755 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v3.c that has 1 procedures, 8 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-07 23:02:56,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 23:02:56,788 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;@55701584, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 23:02:56,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 23:02:56,790 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:02:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-07 23:02:56,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:56,793 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-07 23:02:56,794 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:56,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1137951, now seen corresponding path program 1 times [2025-02-07 23:02:56,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:02:56,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828852015] [2025-02-07 23:02:56,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:56,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:02:56,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:02:56,809 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:02:56,810 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:02:56,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-07 23:02:56,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-07 23:02:56,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:56,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:02:56,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-07 23:02:56,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:02:56,970 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:02:56,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 23:02:56,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:02:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828852015] [2025-02-07 23:02:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828852015] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 23:02:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 23:02:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 23:02:56,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972103735] [2025-02-07 23:02:56,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 23:02:56,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 23:02:56,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:02:56,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 23:02:56,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 23:02:56,985 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:02:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:02:57,006 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-02-07 23:02:57,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 23:02:57,007 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:02:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:02:57,010 INFO L225 Difference]: With dead ends: 15 [2025-02-07 23:02:57,011 INFO L226 Difference]: Without dead ends: 8 [2025-02-07 23:02:57,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:02:57,013 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:02:57,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 23:02:57,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2025-02-07 23:02:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-02-07 23:02:57,027 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:02:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2025-02-07 23:02:57,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2025-02-07 23:02:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:02:57,029 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2025-02-07 23:02:57,029 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:02:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2025-02-07 23:02:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 23:02:57,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:02:57,030 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-02-07 23:02:57,036 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:02:57,234 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:02:57,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:02:57,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:02:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash -458170295, now seen corresponding path program 1 times [2025-02-07 23:02:57,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:02:57,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1561943070] [2025-02-07 23:02:57,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 23:02:57,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:02:57,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:02:57,238 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:02:57,241 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:02:57,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 23:02:57,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 23:02:57,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:02:57,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:02:57,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-07 23:02:57,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:02:57,542 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:02:57,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:03:02,469 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:03:02,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:03:02,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561943070] [2025-02-07 23:03:02,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561943070] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:03:02,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:03:02,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-02-07 23:03:02,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673135177] [2025-02-07 23:03:02,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:03:02,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 23:03:02,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:03:02,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 23:03:02,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2025-02-07 23:03:02,472 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:02,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:03:02,936 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2025-02-07 23:03:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-07 23:03:02,936 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 23:03:02,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:03:02,937 INFO L225 Difference]: With dead ends: 13 [2025-02-07 23:03:02,937 INFO L226 Difference]: Without dead ends: 11 [2025-02-07 23:03:02,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2025-02-07 23:03:02,937 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 23:03:02,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 23:03:02,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-02-07 23:03:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-02-07 23:03:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-02-07 23:03:02,940 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2025-02-07 23:03:02,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:03:02,940 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-02-07 23:03:02,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 23:03:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-02-07 23:03:02,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 23:03:02,941 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:03:02,941 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2025-02-07 23:03:02,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 23:03:03,145 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:03:03,145 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:03:03,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:03:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash 55678175, now seen corresponding path program 2 times [2025-02-07 23:03:03,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:03:03,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849171454] [2025-02-07 23:03:03,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 23:03:03,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:03:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:03:03,151 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:03:03,153 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:03:03,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-02-07 23:03:03,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 23:03:03,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 23:03:03,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 23:03:03,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-07 23:03:03,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 23:03:05,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 23:03:05,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 23:03:16,211 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse9 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_31~0#1|))) .cse23)))) (.cse10 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_26~0#1|)))) (.cse0 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|)))) .cse23)))) (.cse3 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_15|)))) .cse23))))) (.cse12 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_15| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_15|)))) .cse23)))))) (let ((.cse1 (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_10~0#1|))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) .cse19))) (.cse18 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_28~0#1|))) .cse23)) (_ bv0 8)))) (and (or (not .cse18) .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (bvneg .cse19)))))))) .cse20))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse21))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul .cse19 (_ bv2 32)))))))) .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse21)))))) .cse18 .cse3) .cse12)))) (.cse2 (not .cse0)) (.cse5 (bvneg .cse10)) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_40~0#1|)))))) (.cse8 (not .cse9)) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_24~0#1|)) (.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_22~0#1|))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or .cse0 (let ((.cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse13 .cse14))))))))) (and (or .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 .cse5))))))) .cse6))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse6)))))) .cse8) (or .cse9 .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse11 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse4 .cse10))))))) .cse11))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse11))))))) .cse12))) (or .cse2 (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse13) .cse14))))))))) (and (or .cse9 .cse3 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 .cse10))))))) .cse16))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse16))))))) .cse12 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse15 .cse5))))))) .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse17)))))) .cse3 .cse8)))))))) is different from false [2025-02-07 23:03:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-07 23:03:22,960 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-07 23:03:22,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849171454] [2025-02-07 23:03:22,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849171454] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 23:03:22,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 23:03:22,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2025-02-07 23:03:22,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167086598] [2025-02-07 23:03:22,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 23:03:22,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 23:03:22,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-07 23:03:22,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 23:03:22,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=102, Unknown=1, NotChecked=20, Total=156 [2025-02-07 23:03:22,962 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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:03:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 23:03:30,497 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-02-07 23:03:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 23:03:30,498 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 10 [2025-02-07 23:03:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 23:03:30,499 INFO L225 Difference]: With dead ends: 16 [2025-02-07 23:03:30,499 INFO L226 Difference]: Without dead ends: 14 [2025-02-07 23:03:30,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=73, Invalid=202, Unknown=1, NotChecked=30, Total=306 [2025-02-07 23:03:30,499 INFO L435 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-07 23:03:30,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 9 Unchecked, 1.0s Time] [2025-02-07 23:03:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-02-07 23:03:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-02-07 23:03:30,501 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:03:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-02-07 23:03:30,502 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2025-02-07 23:03:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 23:03:30,502 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-02-07 23:03:30,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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:03:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-02-07 23:03:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 23:03:30,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 23:03:30,502 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2025-02-07 23:03:30,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 23:03:30,703 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:03:30,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 23:03:30,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 23:03:30,703 INFO L85 PathProgramCache]: Analyzing trace with hash 852005001, now seen corresponding path program 3 times [2025-02-07 23:03:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-07 23:03:30,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106892005] [2025-02-07 23:03:30,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 23:03:30,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:03:30,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 23:03:30,706 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 23:03:30,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 23:03:30,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 4 equivalence classes. [2025-02-07 23:03:30,819 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 23:03:30,819 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 23:03:30,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:03:30,820 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 23:03:30,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 23:03:30,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 23:03:30,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 23:03:30,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 23:03:30,931 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2025-02-07 23:03:30,931 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 23:03:30,931 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 23:03:30,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-07 23:03:31,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 23:03:31,138 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1] [2025-02-07 23:03:31,162 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:03:31,163 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:03:31,163 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:03:31,163 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:03:31,178 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 23:03:31,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 11:03:31 BoogieIcfgContainer [2025-02-07 23:03:31,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 23:03:31,184 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 23:03:31,184 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 23:03:31,184 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 23:03:31,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:02:56" (3/4) ... [2025-02-07 23:03:31,185 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 23:03:31,193 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:03:31,193 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:03:31,193 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:03:31,193 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-07 23:03:31,259 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 12. [2025-02-07 23:03:31,302 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 23:03:31,303 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 23:03:31,303 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 23:03:31,303 INFO L158 Benchmark]: Toolchain (without parser) took 35198.97ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 90.6MB in the beginning and 127.2MB in the end (delta: -36.6MB). Peak memory consumption was 98.9MB. Max. memory is 16.1GB. [2025-02-07 23:03:31,304 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:03:31,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.29ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 74.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:03:31,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.33ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 72.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:03:31,304 INFO L158 Benchmark]: Boogie Preprocessor took 29.74ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 69.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 23:03:31,304 INFO L158 Benchmark]: IcfgBuilder took 347.92ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 89.5MB in the end (delta: -20.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2025-02-07 23:03:31,304 INFO L158 Benchmark]: TraceAbstraction took 34443.37ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 89.0MB in the beginning and 140.4MB in the end (delta: -51.4MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. [2025-02-07 23:03:31,305 INFO L158 Benchmark]: Witness Printer took 119.29ms. Allocated memory is still 251.7MB. Free memory was 140.4MB in the beginning and 127.2MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 23:03:31,305 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 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.29ms. Allocated memory is still 117.4MB. Free memory was 90.4MB in the beginning and 74.3MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.33ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 72.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.74ms. Allocated memory is still 117.4MB. Free memory was 72.1MB in the beginning and 69.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 347.92ms. Allocated memory is still 117.4MB. Free memory was 69.5MB in the beginning and 89.5MB in the end (delta: -20.0MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * TraceAbstraction took 34443.37ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 89.0MB in the beginning and 140.4MB in the end (delta: -51.4MB). Peak memory consumption was 77.7MB. Max. memory is 16.1GB. * Witness Printer took 119.29ms. Allocated memory is still 251.7MB. Free memory was 140.4MB in the beginning and 127.2MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=-1, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.4s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 41 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 10 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 21.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 24.9s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 33 ConstructedInterpolants, 14 QuantifiedInterpolants, 3163 SizeOfPredicates, 17 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-07 23:03:31,522 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-02-07 23:03:31,659 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE