./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 53879bee41b0f6496027fdf2ec25e7e086316c8ce4800f3fb76bfeda7e545810 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 08:37:14,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:37:14,767 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 08:37:14,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:37:14,771 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:37:14,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:37:14,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:37:14,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:37:14,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:37:14,792 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:37:14,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:37:14,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:37:14,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:37:14,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:37:14,792 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:37:14,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:37:14,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:37:14,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 08:37:14,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:37:14,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:37:14,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:37:14,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:37:14,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:37:14,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:37:14,794 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:37:14,794 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:37:14,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:37:14,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:37:14,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:37:14,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:37:14,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:37:14,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:37:14,794 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:37:14,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:37:14,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 08:37:14,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 08:37:14,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:37:14,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:37:14,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:37:14,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:37:14,795 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/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 -> 53879bee41b0f6496027fdf2ec25e7e086316c8ce4800f3fb76bfeda7e545810 [2025-03-08 08:37:15,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:37:15,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:37:15,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:37:15,028 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:37:15,029 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:37:15,030 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c [2025-03-08 08:37:16,176 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e49603d6/a9bcaf3a7d874b3bb73747600542a271/FLAG9bce6eb11 [2025-03-08 08:37:16,216 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMRebuildTask.run(PDOMRebuildTask.java:94) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-03-08 08:37:16,482 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:37:16,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c [2025-03-08 08:37:16,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e49603d6/a9bcaf3a7d874b3bb73747600542a271/FLAG9bce6eb11 [2025-03-08 08:37:16,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e49603d6/a9bcaf3a7d874b3bb73747600542a271 [2025-03-08 08:37:16,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:37:16,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:37:16,509 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:37:16,509 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:37:16,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:37:16,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,514 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6623ce6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16, skipping insertion in model container [2025-03-08 08:37:16,515 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,531 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:37:16,621 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c[1249,1262] [2025-03-08 08:37:16,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:37:16,694 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:37:16,700 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c[1249,1262] [2025-03-08 08:37:16,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:37:16,753 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:37:16,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16 WrapperNode [2025-03-08 08:37:16,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:37:16,755 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:37:16,755 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:37:16,755 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:37:16,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,819 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2025-03-08 08:37:16,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:37:16,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:37:16,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:37:16,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:37:16,826 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,868 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-03-08 08:37:16,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,919 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:37:16,921 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:37:16,921 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:37:16,921 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:37:16,922 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (1/1) ... [2025-03-08 08:37:16,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:37:16,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:37:16,947 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 08:37:16,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 08:37:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:37:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 08:37:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:37:16,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:37:17,064 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:37:17,066 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:37:17,741 INFO L? ?]: Removed 260 outVars from TransFormulas that were not future-live. [2025-03-08 08:37:17,741 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:37:17,776 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:37:17,778 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:37:17,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:37:17 BoogieIcfgContainer [2025-03-08 08:37:17,778 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:37:17,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:37:17,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:37:17,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:37:17,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:37:16" (1/3) ... [2025-03-08 08:37:17,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20683fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:37:17, skipping insertion in model container [2025-03-08 08:37:17,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:16" (2/3) ... [2025-03-08 08:37:17,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20683fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:37:17, skipping insertion in model container [2025-03-08 08:37:17,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:37:17" (3/3) ... [2025-03-08 08:37:17,785 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v7.c [2025-03-08 08:37:17,796 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:37:17,797 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v7.c that has 1 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 08:37:17,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:37:17,846 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;@351e34fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:37:17,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:37:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 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-03-08 08:37:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 08:37:17,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:37:17,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:37:17,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:37:17,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:37:17,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1212893444, now seen corresponding path program 1 times [2025-03-08 08:37:17,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:37:17,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501099817] [2025-03-08 08:37:17,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:37:17,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:37:17,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 08:37:18,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 08:37:18,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:37:18,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:37:18,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:37:18,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:37:18,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501099817] [2025-03-08 08:37:18,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501099817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:37:18,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:37:18,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:37:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366015403] [2025-03-08 08:37:18,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:37:18,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:37:18,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:37:18,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:37:18,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:37:18,499 INFO L87 Difference]: Start difference. First operand has 130 states, 128 states have (on average 1.4921875) internal successors, (191), 129 states have internal predecessors, (191), 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 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-03-08 08:37:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:37:18,608 INFO L93 Difference]: Finished difference Result 177 states and 261 transitions. [2025-03-08 08:37:18,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:37:18,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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 55 [2025-03-08 08:37:18,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:37:18,615 INFO L225 Difference]: With dead ends: 177 [2025-03-08 08:37:18,615 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 08:37:18,617 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-03-08 08:37:18,620 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:37:18,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:37:18,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 08:37:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-08 08:37:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4765625) internal successors, (189), 128 states have internal predecessors, (189), 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-03-08 08:37:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 189 transitions. [2025-03-08 08:37:18,644 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 189 transitions. Word has length 55 [2025-03-08 08:37:18,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:37:18,644 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 189 transitions. [2025-03-08 08:37:18,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-03-08 08:37:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 189 transitions. [2025-03-08 08:37:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 08:37:18,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:37:18,645 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:37:18,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 08:37:18,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:37:18,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:37:18,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1059688080, now seen corresponding path program 1 times [2025-03-08 08:37:18,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:37:18,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126376283] [2025-03-08 08:37:18,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:37:18,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:37:18,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 08:37:18,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 08:37:18,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:37:18,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:37:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:37:18,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:37:18,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126376283] [2025-03-08 08:37:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126376283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:37:18,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:37:18,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:37:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775968849] [2025-03-08 08:37:18,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:37:18,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:37:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:37:18,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:37:18,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:37:18,859 INFO L87 Difference]: Start difference. First operand 129 states and 189 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:37:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:37:18,945 INFO L93 Difference]: Finished difference Result 178 states and 259 transitions. [2025-03-08 08:37:18,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:37:18,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-08 08:37:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:37:18,948 INFO L225 Difference]: With dead ends: 178 [2025-03-08 08:37:18,948 INFO L226 Difference]: Without dead ends: 131 [2025-03-08 08:37:18,948 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-03-08 08:37:18,948 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:37:18,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 457 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:37:18,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-08 08:37:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-08 08:37:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.4692307692307693) internal successors, (191), 130 states have internal predecessors, (191), 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-03-08 08:37:18,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 191 transitions. [2025-03-08 08:37:18,954 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 191 transitions. Word has length 56 [2025-03-08 08:37:18,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:37:18,954 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 191 transitions. [2025-03-08 08:37:18,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:37:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 191 transitions. [2025-03-08 08:37:18,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 08:37:18,955 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:37:18,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:37:18,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 08:37:18,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:37:18,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:37:18,956 INFO L85 PathProgramCache]: Analyzing trace with hash 422101367, now seen corresponding path program 1 times [2025-03-08 08:37:18,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:37:18,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604073693] [2025-03-08 08:37:18,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:37:18,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:37:18,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 08:37:19,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 08:37:19,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:37:19,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:37:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:37:19,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 08:37:19,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604073693] [2025-03-08 08:37:19,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604073693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:37:19,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:37:19,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:37:19,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078707906] [2025-03-08 08:37:19,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:37:19,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:37:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 08:37:19,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:37:19,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:37:19,219 INFO L87 Difference]: Start difference. First operand 131 states and 191 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:37:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:37:19,298 INFO L93 Difference]: Finished difference Result 178 states and 258 transitions. [2025-03-08 08:37:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:37:19,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-08 08:37:19,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:37:19,300 INFO L225 Difference]: With dead ends: 178 [2025-03-08 08:37:19,301 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 08:37:19,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03-08 08:37:19,303 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 138 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 08:37:19,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 299 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 08:37:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 08:37:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-08 08:37:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 128 states have (on average 1.4609375) internal successors, (187), 128 states have internal predecessors, (187), 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-03-08 08:37:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 187 transitions. [2025-03-08 08:37:19,313 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 187 transitions. Word has length 57 [2025-03-08 08:37:19,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:37:19,313 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 187 transitions. [2025-03-08 08:37:19,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:37:19,313 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 187 transitions. [2025-03-08 08:37:19,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 08:37:19,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:37:19,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 08:37:19,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 08:37:19,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:37:19,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:37:19,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1258009064, now seen corresponding path program 1 times [2025-03-08 08:37:19,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 08:37:19,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274723424] [2025-03-08 08:37:19,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:37:19,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 08:37:19,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 08:37:19,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 08:37:19,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:37:19,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 08:37:19,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 08:37:19,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-08 08:37:19,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 08:37:19,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:37:19,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 08:37:19,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 08:37:19,430 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 08:37:19,430 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 08:37:19,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 08:37:19,434 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 08:37:19,460 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-08 08:37:19,472 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 08:37:19,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 08:37:19 BoogieIcfgContainer [2025-03-08 08:37:19,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 08:37:19,477 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 08:37:19,477 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 08:37:19,477 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 08:37:19,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:37:17" (3/4) ... [2025-03-08 08:37:19,479 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 08:37:19,480 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 08:37:19,480 INFO L158 Benchmark]: Toolchain (without parser) took 2972.52ms. Allocated memory is still 167.8MB. Free memory was 132.8MB in the beginning and 68.6MB in the end (delta: 64.2MB). Peak memory consumption was 66.8MB. Max. memory is 16.1GB. [2025-03-08 08:37:19,481 INFO L158 Benchmark]: CDTParser took 0.50ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:37:19,481 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.39ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 114.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 08:37:19,481 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.93ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 101.9MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 08:37:19,482 INFO L158 Benchmark]: Boogie Preprocessor took 99.47ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 95.0MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:37:19,482 INFO L158 Benchmark]: IcfgBuilder took 857.41ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 104.6MB in the end (delta: -9.6MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2025-03-08 08:37:19,482 INFO L158 Benchmark]: TraceAbstraction took 1696.94ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 68.6MB in the end (delta: 35.1MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. [2025-03-08 08:37:19,482 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 167.8MB. Free memory was 68.6MB in the beginning and 68.6MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 08:37:19,484 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.50ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.39ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 114.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.93ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 101.9MB in the end (delta: 11.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.47ms. Allocated memory is still 167.8MB. Free memory was 101.9MB in the beginning and 95.0MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 857.41ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 104.6MB in the end (delta: -9.6MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1696.94ms. Allocated memory is still 167.8MB. Free memory was 103.7MB in the beginning and 68.6MB in the end (delta: 35.1MB). Peak memory consumption was 39.7MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 167.8MB. Free memory was 68.6MB in the beginning and 68.6MB in the end (delta: 30.0kB). 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 155. 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_9 = 0; [L33] const SORT_5 var_22 = 0; [L34] const SORT_5 var_31 = 1; [L35] const SORT_1 var_109 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_35; [L44] SORT_5 input_37; [L45] SORT_5 input_39; [L46] SORT_5 input_51; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L48] SORT_1 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L49] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L50] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L51] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L52] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L53] SORT_5 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L54] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L54] SORT_5 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L55] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L55] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L56] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L57] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L58] SORT_5 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L59] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L60] SORT_5 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L61] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L62] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L63] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L64] SORT_1 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L65] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L66] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=255, mask_SORT_5=1, var_109=1, var_22=0, var_31=1, var_9=0] [L67] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] SORT_1 init_11_arg_1 = var_9; [L70] state_10 = init_11_arg_1 [L71] SORT_1 init_13_arg_1 = var_9; [L72] state_12 = init_13_arg_1 [L73] SORT_1 init_19_arg_1 = var_9; [L74] state_18 = init_19_arg_1 [L75] SORT_5 init_24_arg_1 = var_22; [L76] state_23 = init_24_arg_1 [L77] SORT_1 init_27_arg_1 = var_9; [L78] state_26 = init_27_arg_1 [L79] SORT_5 init_42_arg_1 = var_22; [L80] state_41 = init_42_arg_1 [L81] SORT_5 init_44_arg_1 = var_22; [L82] state_43 = init_44_arg_1 [L83] SORT_1 init_46_arg_1 = var_9; [L84] state_45 = init_46_arg_1 [L85] SORT_1 init_48_arg_1 = var_9; [L86] state_47 = init_48_arg_1 [L87] SORT_1 init_50_arg_1 = var_9; [L88] state_49 = init_50_arg_1 [L89] SORT_5 init_54_arg_1 = var_22; [L90] state_53 = init_54_arg_1 [L91] SORT_1 init_56_arg_1 = var_9; [L92] state_55 = init_56_arg_1 [L93] SORT_5 init_58_arg_1 = var_22; [L94] state_57 = init_58_arg_1 [L95] SORT_1 init_60_arg_1 = var_9; [L96] state_59 = init_60_arg_1 [L97] SORT_1 init_63_arg_1 = var_9; [L98] state_62 = init_63_arg_1 [L99] SORT_1 init_65_arg_1 = var_9; [L100] state_64 = init_65_arg_1 [L101] SORT_1 init_67_arg_1 = var_9; [L102] state_66 = init_67_arg_1 [L103] SORT_1 init_69_arg_1 = var_9; [L104] state_68 = init_69_arg_1 [L105] SORT_1 init_71_arg_1 = var_9; [L106] state_70 = init_71_arg_1 [L107] SORT_1 init_73_arg_1 = var_9; [L108] state_72 = init_73_arg_1 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L111] input_2 = __VERIFIER_nondet_uchar() [L112] input_3 = __VERIFIER_nondet_uchar() [L113] input_4 = __VERIFIER_nondet_uchar() [L114] input_6 = __VERIFIER_nondet_uchar() [L115] input_7 = __VERIFIER_nondet_uchar() [L116] input_8 = __VERIFIER_nondet_uchar() [L117] EXPR input_8 & mask_SORT_5 VAL [mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L117] input_8 = input_8 & mask_SORT_5 [L118] input_35 = __VERIFIER_nondet_uchar() [L119] input_37 = __VERIFIER_nondet_uchar() [L120] input_39 = __VERIFIER_nondet_uchar() [L121] input_51 = __VERIFIER_nondet_uchar() [L124] SORT_1 var_16_arg_0 = state_10; [L125] SORT_5 var_16 = var_16_arg_0 >> 0; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_16=0, var_22=0, var_31=1, var_9=0] [L126] EXPR var_16 & mask_SORT_5 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_10=0, state_12=0, state_18=0, state_23=0, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L126] var_16 = var_16 & mask_SORT_5 [L127] SORT_1 var_15_arg_0 = state_10; [L128] SORT_1 var_15_arg_1 = state_12; [L129] SORT_1 var_15 = var_15_arg_0 + var_15_arg_1; [L130] SORT_1 var_14_arg_0 = state_10; [L131] SORT_1 var_14_arg_1 = state_12; [L132] SORT_1 var_14 = var_14_arg_0 - var_14_arg_1; [L133] SORT_5 var_17_arg_0 = var_16; [L134] SORT_1 var_17_arg_1 = var_15; [L135] SORT_1 var_17_arg_2 = var_14; [L136] SORT_1 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L137] SORT_1 var_21_arg_0 = var_17; [L138] SORT_1 var_21_arg_1 = state_18; [L139] SORT_1 var_21 = var_21_arg_0 + var_21_arg_1; [L140] SORT_1 var_20_arg_0 = var_17; [L141] SORT_1 var_20_arg_1 = state_18; [L142] SORT_1 var_20 = var_20_arg_0 - var_20_arg_1; [L143] SORT_5 var_25_arg_0 = state_23; [L144] SORT_1 var_25_arg_1 = var_21; [L145] SORT_1 var_25_arg_2 = var_20; [L146] SORT_1 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_25=0, var_31=1, var_9=0] [L147] EXPR var_25 & mask_SORT_1 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_26=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L147] var_25 = var_25 & mask_SORT_1 [L148] SORT_1 var_28_arg_0 = var_25; [L149] SORT_1 var_28_arg_1 = state_26; [L150] SORT_5 var_28 = var_28_arg_0 == var_28_arg_1; [L151] SORT_5 var_32_arg_0 = var_28; [L152] SORT_5 var_32 = ~var_32_arg_0; [L153] SORT_5 var_33_arg_0 = var_31; [L154] SORT_5 var_33_arg_1 = var_32; VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-2, var_9=0] [L155] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L155] SORT_5 var_33 = var_33_arg_0 & var_33_arg_1; [L156] EXPR var_33 & mask_SORT_5 VAL [input_8=0, mask_SORT_1=255, mask_SORT_5=1, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_53=0, state_55=0, state_57=0, state_59=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, var_109=1, var_22=0, var_31=1, var_9=0] [L156] var_33 = var_33 & mask_SORT_5 [L157] SORT_5 bad_34_arg_0 = var_33; [L158] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 130 locations, 191 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 1216 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 756 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 272 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 460 mSDtfsCounter, 272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred 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.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 226 NumberOfCodeBlocks, 226 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 284 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-03-08 08:37:19,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 53879bee41b0f6496027fdf2ec25e7e086316c8ce4800f3fb76bfeda7e545810 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 08:37:21,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 08:37:21,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-08 08:37:21,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 08:37:21,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 08:37:21,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 08:37:21,425 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 08:37:21,425 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 08:37:21,426 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 08:37:21,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 08:37:21,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 08:37:21,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 08:37:21,426 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 08:37:21,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:37:21,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 08:37:21,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 08:37:21,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 08:37:21,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 08:37:21,430 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/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 -> 53879bee41b0f6496027fdf2ec25e7e086316c8ce4800f3fb76bfeda7e545810 [2025-03-08 08:37:21,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 08:37:21,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 08:37:21,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 08:37:21,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 08:37:21,662 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 08:37:21,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c [2025-03-08 08:37:22,829 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6fb095f/beb61b046af24164ba32bc859a3c1626/FLAG505cf551c [2025-03-08 08:37:23,042 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 08:37:23,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c [2025-03-08 08:37:23,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6fb095f/beb61b046af24164ba32bc859a3c1626/FLAG505cf551c [2025-03-08 08:37:23,399 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f6fb095f/beb61b046af24164ba32bc859a3c1626 [2025-03-08 08:37:23,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 08:37:23,402 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 08:37:23,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 08:37:23,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 08:37:23,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 08:37:23,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2437eaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23, skipping insertion in model container [2025-03-08 08:37:23,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,422 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 08:37:23,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c[1249,1262] [2025-03-08 08:37:23,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:37:23,634 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 08:37:23,642 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v7.c[1249,1262] [2025-03-08 08:37:23,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 08:37:23,703 INFO L204 MainTranslator]: Completed translation [2025-03-08 08:37:23,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23 WrapperNode [2025-03-08 08:37:23,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 08:37:23,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 08:37:23,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 08:37:23,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 08:37:23,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,744 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 358 [2025-03-08 08:37:23,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 08:37:23,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 08:37:23,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 08:37:23,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 08:37:23,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,765 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-03-08 08:37:23,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,771 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,773 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,774 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,776 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 08:37:23,778 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 08:37:23,778 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 08:37:23,779 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 08:37:23,779 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (1/1) ... [2025-03-08 08:37:23,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 08:37:23,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:37:23,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 08:37:23,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 08:37:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 08:37:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 08:37:23,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 08:37:23,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 08:37:23,939 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 08:37:23,940 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 08:37:24,238 INFO L? ?]: Removed 70 outVars from TransFormulas that were not future-live. [2025-03-08 08:37:24,239 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 08:37:24,246 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 08:37:24,247 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 08:37:24,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:37:24 BoogieIcfgContainer [2025-03-08 08:37:24,247 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 08:37:24,249 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 08:37:24,249 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 08:37:24,252 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 08:37:24,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 08:37:23" (1/3) ... [2025-03-08 08:37:24,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50276345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:37:24, skipping insertion in model container [2025-03-08 08:37:24,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 08:37:23" (2/3) ... [2025-03-08 08:37:24,255 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50276345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 08:37:24, skipping insertion in model container [2025-03-08 08:37:24,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 08:37:24" (3/3) ... [2025-03-08 08:37:24,256 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v7.c [2025-03-08 08:37:24,266 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 08:37:24,268 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.eq_sdp_v7.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 08:37:24,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 08:37:24,304 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;@128bad08, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 08:37:24,304 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 08:37:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:37:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 08:37:24,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:37:24,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 08:37:24,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:37:24,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:37:24,316 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-08 08:37:24,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 08:37:24,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1094689452] [2025-03-08 08:37:24,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:37:24,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:37:24,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:37:24,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:37:24,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 08:37:24,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 08:37:24,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 08:37:24,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:37:24,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:37:24,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 08:37:24,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:37:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:37:24,727 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 08:37:24,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 08:37:24,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094689452] [2025-03-08 08:37:24,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094689452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 08:37:24,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 08:37:24,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 08:37:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073232720] [2025-03-08 08:37:24,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 08:37:24,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 08:37:24,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 08:37:24,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 08:37:24,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 08:37:24,746 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:37:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:37:24,777 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-03-08 08:37:24,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 08:37:24,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-08 08:37:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:37:24,785 INFO L225 Difference]: With dead ends: 17 [2025-03-08 08:37:24,785 INFO L226 Difference]: Without dead ends: 9 [2025-03-08 08:37:24,787 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-03-08 08:37:24,790 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 08:37:24,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 08:37:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-08 08:37:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-08 08:37:24,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:37:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-08 08:37:24,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-08 08:37:24,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:37:24,811 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-08 08:37:24,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:37:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-08 08:37:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 08:37:24,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:37:24,813 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-08 08:37:24,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 08:37:25,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:37:25,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:37:25,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:37:25,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-08 08:37:25,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 08:37:25,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2053985733] [2025-03-08 08:37:25,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 08:37:25,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:37:25,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:37:25,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:37:25,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 08:37:25,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 08:37:25,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 08:37:25,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 08:37:25,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:37:25,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-08 08:37:25,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:37:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:37:25,562 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:37:31,255 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse27 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_64~0#1|)))) (.cse11 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_43~0#1|))))))) (.cse1 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_59~0#1|) (bvneg ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_55~0#1|)))))))))) (.cse18 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_9~0#1|)))) (.cse15 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_22~0#1|))) .cse27))))) (let ((.cse19 (not .cse15)) (.cse16 (bvneg .cse18)) (.cse20 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse31 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse31 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse31))))))) (.cse14 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse30)))))))) (.cse13 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse18)) .cse27)) (_ bv0 8))) (.cse0 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_10| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_10|)))) .cse27)) (_ bv0 8)))) (.cse10 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse29 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse29 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse29)))))))) (.cse5 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_10| (_ 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_33_arg_0~0#1_10|)))) .cse27))))) (.cse9 (forall ((|v_ULTIMATE.start_main_~var_25_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_10|)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse28))))))) (.cse8 (not .cse11)) (.cse6 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_72~0#1|))))) (.cse12 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse27 ((_ zero_extend 24) ((_ extract 7 0) .cse7))))))) (and (or (and (or (let ((.cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_68~0#1|)))))))))))))))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse2 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse2))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse2)))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse4)))))) .cse5))) .cse8) (or (and (or .cse5 .cse9) (or .cse0 .cse10)) .cse11)) (not .cse12)) (or .cse13 (and (or .cse0 (and (or .cse14 .cse15) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (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) (bvadd .cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|)))))))) .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse17))))))) .cse19))) (or (and (or .cse20 .cse15) (or .cse19 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse21 ((_ 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) (bvadd .cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|)))))))) .cse21))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse21)))))))) .cse5))) (or (and (or .cse19 (let ((.cse23 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse16 .cse18))))) .cse16))))))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse22)))))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse24))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse24)))))) .cse5)))) (or (and (or .cse5 .cse20) (or .cse0 .cse14)) .cse15)) (not .cse13)) (or (and (or .cse0 (and (or .cse11 .cse10) (or .cse8 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (not (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse25)))))))))) (or .cse5 (and (or .cse11 .cse9) (or .cse8 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse26 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse6 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse26)))))))))) .cse12))))) is different from false [2025-03-08 08:37:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-08 08:37:34,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 08:37:34,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053985733] [2025-03-08 08:37:34,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053985733] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 08:37:34,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 08:37:34,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 08:37:34,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531451238] [2025-03-08 08:37:34,951 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 08:37:34,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 08:37:34,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 08:37:34,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 08:37:34,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=53, Unknown=1, NotChecked=14, Total=90 [2025-03-08 08:37:34,953 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-03-08 08:37:36,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 08:37:36,116 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-03-08 08:37:36,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 08:37:36,116 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 08:37:36,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 08:37:36,117 INFO L225 Difference]: With dead ends: 14 [2025-03-08 08:37:36,117 INFO L226 Difference]: Without dead ends: 12 [2025-03-08 08:37:36,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=35, Invalid=78, Unknown=1, NotChecked=18, Total=132 [2025-03-08 08:37:36,118 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 08:37:36,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 6 Unchecked, 0.4s Time] [2025-03-08 08:37:36,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-08 08:37:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-08 08:37:36,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 08:37:36,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-03-08 08:37:36,120 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-03-08 08:37:36,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 08:37:36,120 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-03-08 08:37:36,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-03-08 08:37:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-03-08 08:37:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-08 08:37:36,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 08:37:36,121 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-03-08 08:37:36,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 08:37:36,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:37:36,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 08:37:36,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 08:37:36,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-03-08 08:37:36,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 08:37:36,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949203799] [2025-03-08 08:37:36,322 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 08:37:36,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 08:37:36,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 08:37:36,325 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 08:37:36,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 08:37:36,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-03-08 08:37:36,460 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-03-08 08:37:36,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 08:37:36,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 08:37:36,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-08 08:37:36,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 08:37:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 08:37:40,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 08:38:19,450 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_9~0#1|))))) (let ((.cse34 (bvneg .cse0))) (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_109~0#1|)) (.cse70 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 .cse0)))))) (.cse75 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_22~0#1|)))) (.cse63 ((_ zero_extend 24) ((_ extract 7 0) .cse0))) (.cse71 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|)) (.cse59 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_62~0#1|)))))) (.cse72 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_45~0#1|)) (.cse73 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_47~0#1|)) (.cse74 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_49~0#1|)))))) (let ((.cse14 (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_70~0#1|))))))) (.cse45 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse72 (bvneg .cse73)))))))) .cse74)))))))) (.cse11 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse71 ((_ zero_extend 24) ((_ extract 7 0) .cse59)))))) (.cse24 (bvneg .cse63)) (.cse21 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse63)) .cse71)))) (.cse58 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse75)) .cse71)))) (.cse22 ((_ zero_extend 24) ((_ extract 7 0) .cse70))) (.cse55 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse75 .cse71)))) (.cse5 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_16|) (_ bv254 32)))) .cse71))))) (.cse16 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse72 .cse73))))))) .cse74)))))))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse72 .cse4)))) (.cse7 (forall ((|v_ULTIMATE.start_main_~var_33_arg_0~0#1_16| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_33_arg_0~0#1_16|) (_ bv255 32)))) .cse71)) (_ bv0 8)))) (.cse60 (= ((_ extract 7 0) (bvand .cse71 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_41~0#1|))))))) (_ bv0 8))) (.cse32 (= ((_ extract 7 0) (bvand .cse63 .cse71)) (_ bv0 8)))) (let ((.cse10 (not .cse32)) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse70 .cse34)))))) (.cse12 (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse68 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse68))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse68))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse68 .cse3))) .cse4))))) .cse5) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse69 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse69))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse69)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse69 .cse3))) .cse4))))) .cse7)) .cse60)) (.cse20 (or (and (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse66 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse66))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse66)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse66 .cse3))) .cse4)))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse67 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse67))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse67))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse67 .cse3))) .cse4))))) .cse5)) .cse55)) (.cse27 (or .cse58 (and (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse64 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse64))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse64)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse64 .cse3))) .cse4)))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse65 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse65))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse65))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse65 .cse3))) .cse4))))) .cse5)))) (.cse39 (not .cse21)) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse63 .cse24))))) .cse24)))))) (.cse31 (not .cse11)) (.cse43 (or .cse60 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse61 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse61))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse61))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse61 .cse3))) .cse4)))) .cse5) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse62 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse62))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse62)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse62 .cse3))) .cse4)))) .cse7)))) (.cse13 (not .cse60)) (.cse28 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_66~0#1|)))))) .cse59))))) .cse14)))))) (.cse26 (not .cse58)) (.cse40 (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse56 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse56))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse56))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse56 .cse3))) .cse4)))) .cse5) (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse57 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse57))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse57)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse57 .cse3))) .cse4)))))) .cse58)) (.cse8 (not .cse55)) (.cse9 (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse53 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse53))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse53))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse53 .cse3))) .cse4)))) .cse5) (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_25_arg_1~0#1_16| (_ BitVec 8))) (let ((.cse54 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse54))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_25_arg_1~0#1_16|))) .cse54)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse54 .cse3))) .cse4)))))) .cse55))) (and (or (and (or (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse1 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse1))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse1))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse3))) .cse4)))) .cse5) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse6))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse6)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 .cse3))) .cse4)))) .cse7)) .cse8) .cse9) .cse10) (or .cse11 (and .cse12 (or .cse13 (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse15))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse15))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse15 .cse3))) .cse4))))) .cse5) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse17))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse17)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse17 .cse3))) .cse4))))) .cse7))))) (or .cse10 (and (or (and (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse18))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse18)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse18 .cse3))) .cse4)))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse19))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse2 .cse19))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse19 .cse3))) .cse4))))) .cse5)) .cse8) .cse20)) (or .cse21 (and (or (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse23))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))) .cse24))))) .cse23)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse23 .cse3))) .cse4))))) .cse7) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse25))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))) .cse24))))) .cse25))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse25 .cse3))) .cse4))))) .cse5)) .cse26) .cse27)) (or (and (or .cse13 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse29 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse29))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse29)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse29 .cse3))) .cse4))))) .cse7) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse30))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse16 .cse30))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse30 .cse3))) .cse4))))) .cse5))) .cse12) .cse31) (or .cse32 (and (or (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse33 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse33 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse33)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse33 .cse3))) .cse4))))) .cse7) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse35 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse35))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse35 .cse3))) .cse4))))) .cse5)) .cse8) .cse20)) (or (and (or .cse26 (and (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse36 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse36))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse37)))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse36 .cse3))) .cse4)))))) (or .cse5 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse38 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse3))) .cse4)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse38))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse38 .cse37))))))))))) .cse27) .cse39) (or .cse39 (and .cse40 (or .cse26 (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse41 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse3))) .cse4) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse41))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse41 .cse37)))))))) .cse5) (or .cse7 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse42 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse42))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse37)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse42 .cse3))) .cse4))))))))) (or .cse11 (and .cse43 (or .cse13 (and (or .cse7 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse44 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse44))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse44)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse44 .cse3))) .cse4))))) (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|)))))))) .cse46))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse46))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse46 .cse3))) .cse4)))) .cse5))))) (or .cse31 (and .cse43 (or .cse13 (and (or .cse5 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse47 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse47))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse47))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse47 .cse3))) .cse4))))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse48 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse28 .cse48))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse45 .cse48)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse48 .cse3))) .cse4)))) .cse7))))) (or (and (or (and (or .cse5 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse49 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse49))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))) .cse24))))) .cse49))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse49 .cse3))) .cse4))))) (or .cse7 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse50 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse50))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))) .cse24))))) .cse50)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse50 .cse3))) .cse4)))))) .cse26) .cse40) .cse21) (or .cse32 (and (or (and (or (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse51 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse51))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse51 .cse3))) .cse4)))) .cse5) (or .cse7 (forall ((|v_ULTIMATE.start_main_~var_17_arg_1~0#1_16| (_ BitVec 8)) (|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse52 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse52 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse34 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_17_arg_1~0#1_16|))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse52)))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse52 .cse3))) .cse4)))))) .cse8) .cse9)))))))) is different from false [2025-03-08 08:38:50,155 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-03-08 08:38:50,155 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 08:38:50,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949203799] [2025-03-08 08:38:50,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949203799] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 08:38:50,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 08:38:50,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-03-08 08:38:50,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484626346] [2025-03-08 08:38:50,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 08:38:50,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 08:38:50,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 08:38:50,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 08:38:50,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2025-03-08 08:38:50,156 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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)