./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:10:15,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:10:15,836 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-05 20:10:15,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:10:15,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:10:15,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:10:15,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:10:15,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:10:15,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:10:15,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:10:15,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:10:15,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:10:15,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:10:15,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:10:15,861 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:10:15,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:10:15,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:10:15,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:10:15,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:15,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 20:10:15,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:10:15,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:10:15,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:10:15,864 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:10:15,864 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f [2025-02-05 20:10:16,093 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:10:16,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:10:16,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:10:16,103 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:10:16,103 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:10:16,105 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-02-05 20:10:17,232 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/783772651/c240b4fb8ead4cf1bea6749134241a8b/FLAG5d6a50c22 [2025-02-05 20:10:17,575 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:10:17,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-02-05 20:10:17,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/783772651/c240b4fb8ead4cf1bea6749134241a8b/FLAG5d6a50c22 [2025-02-05 20:10:17,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/783772651/c240b4fb8ead4cf1bea6749134241a8b [2025-02-05 20:10:17,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:10:17,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:10:17,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:17,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:10:17,807 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:10:17,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:17" (1/1) ... [2025-02-05 20:10:17,808 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6981aeba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:17, skipping insertion in model container [2025-02-05 20:10:17,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:17" (1/1) ... [2025-02-05 20:10:17,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:10:17,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-02-05 20:10:18,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:18,208 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:10:18,215 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-02-05 20:10:18,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:18,346 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:10:18,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18 WrapperNode [2025-02-05 20:10:18,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:18,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:18,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:10:18,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:10:18,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:18,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:18,704 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4824 [2025-02-05 20:10:18,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:18,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:10:18,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:10:18,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:10:18,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:18,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:18,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:18,887 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:10:18,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:18,890 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:18,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:18,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:18,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:19,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:19,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:10:19,091 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:10:19,091 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:10:19,092 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:10:19,093 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (1/1) ... [2025-02-05 20:10:19,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:19,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:19,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:10:19,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:10:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:10:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 20:10:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:10:19,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:10:19,560 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:10:19,562 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:10:22,675 INFO L? ?]: Removed 3123 outVars from TransFormulas that were not future-live. [2025-02-05 20:10:22,676 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:10:22,785 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:10:22,785 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:10:22,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:22 BoogieIcfgContainer [2025-02-05 20:10:22,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:10:22,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:10:22,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:10:22,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:10:22,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:10:17" (1/3) ... [2025-02-05 20:10:22,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf164c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:22, skipping insertion in model container [2025-02-05 20:10:22,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:18" (2/3) ... [2025-02-05 20:10:22,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf164c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:22, skipping insertion in model container [2025-02-05 20:10:22,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:22" (3/3) ... [2025-02-05 20:10:22,795 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-02-05 20:10:22,805 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:10:22,806 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c that has 1 procedures, 1114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:10:22,869 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:10:22,876 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;@3ab88acd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:10:22,877 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:10:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 1114 states, 1112 states have (on average 1.4991007194244603) internal successors, (1667), 1113 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 20:10:22,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:22,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:22,891 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:22,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash -386724389, now seen corresponding path program 1 times [2025-02-05 20:10:22,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:22,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545638392] [2025-02-05 20:10:22,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:22,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:23,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 20:10:23,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 20:10:23,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:23,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:23,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545638392] [2025-02-05 20:10:23,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545638392] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:23,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:23,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:10:23,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643608748] [2025-02-05 20:10:23,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:23,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:10:23,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:23,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:10:23,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:23,672 INFO L87 Difference]: Start difference. First operand has 1114 states, 1112 states have (on average 1.4991007194244603) internal successors, (1667), 1113 states have internal predecessors, (1667), 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 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:24,229 INFO L93 Difference]: Finished difference Result 2109 states and 3159 transitions. [2025-02-05 20:10:24,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:10:24,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 83 [2025-02-05 20:10:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:24,248 INFO L225 Difference]: With dead ends: 2109 [2025-02-05 20:10:24,248 INFO L226 Difference]: Without dead ends: 1113 [2025-02-05 20:10:24,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:24,257 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 0 mSDsluCounter, 2765 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4150 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:24,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4150 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:10:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2025-02-05 20:10:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2025-02-05 20:10:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1112 states have (on average 1.4973021582733812) internal successors, (1665), 1112 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1665 transitions. [2025-02-05 20:10:24,331 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1665 transitions. Word has length 83 [2025-02-05 20:10:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:24,331 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1665 transitions. [2025-02-05 20:10:24,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1665 transitions. [2025-02-05 20:10:24,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 20:10:24,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:24,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:24,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 20:10:24,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:24,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:24,335 INFO L85 PathProgramCache]: Analyzing trace with hash 901126633, now seen corresponding path program 1 times [2025-02-05 20:10:24,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:24,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997422287] [2025-02-05 20:10:24,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:24,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:24,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 20:10:24,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 20:10:24,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:24,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:24,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:24,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997422287] [2025-02-05 20:10:24,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997422287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:24,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:24,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:10:24,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503554118] [2025-02-05 20:10:24,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:24,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:10:24,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:24,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:10:24,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:24,535 INFO L87 Difference]: Start difference. First operand 1113 states and 1665 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:25,025 INFO L93 Difference]: Finished difference Result 2110 states and 3157 transitions. [2025-02-05 20:10:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:10:25,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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 84 [2025-02-05 20:10:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:25,030 INFO L225 Difference]: With dead ends: 2110 [2025-02-05 20:10:25,030 INFO L226 Difference]: Without dead ends: 1115 [2025-02-05 20:10:25,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:25,032 INFO L435 NwaCegarLoop]: 1385 mSDtfsCounter, 0 mSDsluCounter, 2762 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:25,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4147 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:10:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-02-05 20:10:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2025-02-05 20:10:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.4964093357271095) internal successors, (1667), 1114 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:25,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1667 transitions. [2025-02-05 20:10:25,053 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1667 transitions. Word has length 84 [2025-02-05 20:10:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:25,054 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1667 transitions. [2025-02-05 20:10:25,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1667 transitions. [2025-02-05 20:10:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 20:10:25,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:25,056 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:25,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 20:10:25,056 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:25,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash -198334570, now seen corresponding path program 1 times [2025-02-05 20:10:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:25,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275105381] [2025-02-05 20:10:25,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:25,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:25,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-05 20:10:25,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-05 20:10:25,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:25,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:25,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:25,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275105381] [2025-02-05 20:10:25,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275105381] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:25,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:25,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:10:25,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077188394] [2025-02-05 20:10:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:25,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:10:25,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:25,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:10:25,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:25,789 INFO L87 Difference]: Start difference. First operand 1115 states and 1667 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:26,600 INFO L93 Difference]: Finished difference Result 2147 states and 3211 transitions. [2025-02-05 20:10:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:10:26,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 85 [2025-02-05 20:10:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:26,604 INFO L225 Difference]: With dead ends: 2147 [2025-02-05 20:10:26,604 INFO L226 Difference]: Without dead ends: 1150 [2025-02-05 20:10:26,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:10:26,606 INFO L435 NwaCegarLoop]: 1364 mSDtfsCounter, 1684 mSDsluCounter, 5447 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 6811 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:26,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 6811 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:10:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2025-02-05 20:10:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1149. [2025-02-05 20:10:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.494773519163763) internal successors, (1716), 1148 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1716 transitions. [2025-02-05 20:10:26,622 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1716 transitions. Word has length 85 [2025-02-05 20:10:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:26,622 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1716 transitions. [2025-02-05 20:10:26,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1716 transitions. [2025-02-05 20:10:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 20:10:26,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:26,623 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:26,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 20:10:26,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:26,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:26,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1876320018, now seen corresponding path program 1 times [2025-02-05 20:10:26,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:26,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834179607] [2025-02-05 20:10:26,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:26,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:26,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 20:10:26,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 20:10:26,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:26,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:27,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:27,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:27,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834179607] [2025-02-05 20:10:27,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834179607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:27,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:27,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:10:27,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527395021] [2025-02-05 20:10:27,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:27,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:10:27,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:27,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:10:27,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:10:27,248 INFO L87 Difference]: Start difference. First operand 1149 states and 1716 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:27,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:27,789 INFO L93 Difference]: Finished difference Result 2172 states and 3244 transitions. [2025-02-05 20:10:27,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:27,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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 86 [2025-02-05 20:10:27,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:27,793 INFO L225 Difference]: With dead ends: 2172 [2025-02-05 20:10:27,793 INFO L226 Difference]: Without dead ends: 1149 [2025-02-05 20:10:27,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 20:10:27,794 INFO L435 NwaCegarLoop]: 1368 mSDtfsCounter, 1684 mSDsluCounter, 2734 mSDsCounter, 0 mSdLazyCounter, 886 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 4102 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:27,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 4102 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 886 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:10:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-02-05 20:10:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2025-02-05 20:10:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 1.4939024390243902) internal successors, (1715), 1148 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1715 transitions. [2025-02-05 20:10:27,810 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1715 transitions. Word has length 86 [2025-02-05 20:10:27,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:27,810 INFO L471 AbstractCegarLoop]: Abstraction has 1149 states and 1715 transitions. [2025-02-05 20:10:27,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1715 transitions. [2025-02-05 20:10:27,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 20:10:27,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:27,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:27,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 20:10:27,812 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:27,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:27,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1790267128, now seen corresponding path program 1 times [2025-02-05 20:10:27,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:27,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687635808] [2025-02-05 20:10:27,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:27,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:27,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 20:10:27,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 20:10:27,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:27,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:28,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:28,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687635808] [2025-02-05 20:10:28,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687635808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:28,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:28,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 20:10:28,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376761648] [2025-02-05 20:10:28,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:28,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 20:10:28,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:28,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 20:10:28,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 20:10:28,495 INFO L87 Difference]: Start difference. First operand 1149 states and 1715 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:29,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:29,313 INFO L93 Difference]: Finished difference Result 2172 states and 3243 transitions. [2025-02-05 20:10:29,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:10:29,314 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 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 87 [2025-02-05 20:10:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:29,317 INFO L225 Difference]: With dead ends: 2172 [2025-02-05 20:10:29,317 INFO L226 Difference]: Without dead ends: 1152 [2025-02-05 20:10:29,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:10:29,319 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1690 mSDsluCounter, 5461 mSDsCounter, 0 mSdLazyCounter, 1487 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 6828 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:29,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1690 Valid, 6828 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1487 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:10:29,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-02-05 20:10:29,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2025-02-05 20:10:29,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.4926151172893136) internal successors, (1718), 1151 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:29,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1718 transitions. [2025-02-05 20:10:29,335 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1718 transitions. Word has length 87 [2025-02-05 20:10:29,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:29,335 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1718 transitions. [2025-02-05 20:10:29,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:29,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1718 transitions. [2025-02-05 20:10:29,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 20:10:29,336 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:29,336 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:29,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 20:10:29,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:29,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:29,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1930813249, now seen corresponding path program 1 times [2025-02-05 20:10:29,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:29,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108839969] [2025-02-05 20:10:29,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:29,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:29,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 20:10:29,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 20:10:29,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:29,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:29,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:29,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108839969] [2025-02-05 20:10:29,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108839969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:29,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:29,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:10:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78507440] [2025-02-05 20:10:29,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:29,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:10:29,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:29,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:10:29,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:29,688 INFO L87 Difference]: Start difference. First operand 1152 states and 1718 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:30,049 INFO L93 Difference]: Finished difference Result 2170 states and 3239 transitions. [2025-02-05 20:10:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:10:30,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 88 [2025-02-05 20:10:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:30,054 INFO L225 Difference]: With dead ends: 2170 [2025-02-05 20:10:30,054 INFO L226 Difference]: Without dead ends: 1146 [2025-02-05 20:10:30,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:30,057 INFO L435 NwaCegarLoop]: 1383 mSDtfsCounter, 0 mSDsluCounter, 1380 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:30,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2763 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 20:10:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-02-05 20:10:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2025-02-05 20:10:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 1.491703056768559) internal successors, (1708), 1145 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:30,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1708 transitions. [2025-02-05 20:10:30,075 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1708 transitions. Word has length 88 [2025-02-05 20:10:30,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:30,075 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1708 transitions. [2025-02-05 20:10:30,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1708 transitions. [2025-02-05 20:10:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-05 20:10:30,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:30,076 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:30,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 20:10:30,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:30,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:30,077 INFO L85 PathProgramCache]: Analyzing trace with hash -414736333, now seen corresponding path program 1 times [2025-02-05 20:10:30,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:30,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579737069] [2025-02-05 20:10:30,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:30,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-05 20:10:30,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-05 20:10:30,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:30,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:30,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:30,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:30,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579737069] [2025-02-05 20:10:30,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579737069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:30,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:30,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 20:10:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204284990] [2025-02-05 20:10:30,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:30,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:10:30,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:30,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:10:30,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-05 20:10:30,654 INFO L87 Difference]: Start difference. First operand 1146 states and 1708 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:31,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:31,472 INFO L93 Difference]: Finished difference Result 2160 states and 3222 transitions. [2025-02-05 20:10:31,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 20:10:31,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 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 88 [2025-02-05 20:10:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:31,475 INFO L225 Difference]: With dead ends: 2160 [2025-02-05 20:10:31,475 INFO L226 Difference]: Without dead ends: 1146 [2025-02-05 20:10:31,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-02-05 20:10:31,478 INFO L435 NwaCegarLoop]: 1362 mSDtfsCounter, 1667 mSDsluCounter, 5479 mSDsCounter, 0 mSdLazyCounter, 1534 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1667 SdHoareTripleChecker+Valid, 6841 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:31,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1667 Valid, 6841 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 20:10:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-02-05 20:10:31,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1146. [2025-02-05 20:10:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 1145 states have (on average 1.490829694323144) internal successors, (1707), 1145 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1707 transitions. [2025-02-05 20:10:31,493 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1707 transitions. Word has length 88 [2025-02-05 20:10:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:31,493 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1707 transitions. [2025-02-05 20:10:31,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 10 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1707 transitions. [2025-02-05 20:10:31,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-02-05 20:10:31,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:31,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:31,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 20:10:31,493 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:31,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:31,494 INFO L85 PathProgramCache]: Analyzing trace with hash 691630493, now seen corresponding path program 1 times [2025-02-05 20:10:31,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:31,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838576253] [2025-02-05 20:10:31,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:31,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:31,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-05 20:10:31,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-05 20:10:31,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:31,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:31,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:31,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:31,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838576253] [2025-02-05 20:10:31,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838576253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:31,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:31,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:10:31,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938517202] [2025-02-05 20:10:31,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:31,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:10:31,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:31,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:10:31,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:10:31,984 INFO L87 Difference]: Start difference. First operand 1146 states and 1707 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:32,678 INFO L93 Difference]: Finished difference Result 2160 states and 3221 transitions. [2025-02-05 20:10:32,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:10:32,678 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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 89 [2025-02-05 20:10:32,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:32,681 INFO L225 Difference]: With dead ends: 2160 [2025-02-05 20:10:32,681 INFO L226 Difference]: Without dead ends: 1153 [2025-02-05 20:10:32,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:10:32,683 INFO L435 NwaCegarLoop]: 1361 mSDtfsCounter, 1682 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 5522 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:32,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 5522 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:10:32,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2025-02-05 20:10:32,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1152. [2025-02-05 20:10:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 1151 states have (on average 1.4900086880973067) internal successors, (1715), 1151 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1715 transitions. [2025-02-05 20:10:32,698 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1715 transitions. Word has length 89 [2025-02-05 20:10:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:32,698 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1715 transitions. [2025-02-05 20:10:32,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1715 transitions. [2025-02-05 20:10:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 20:10:32,699 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:32,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:32,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 20:10:32,699 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:32,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:32,700 INFO L85 PathProgramCache]: Analyzing trace with hash 526595914, now seen corresponding path program 1 times [2025-02-05 20:10:32,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:32,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762526084] [2025-02-05 20:10:32,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:32,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 20:10:32,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 20:10:32,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:32,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:32,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:32,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762526084] [2025-02-05 20:10:32,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762526084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:32,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:32,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:10:32,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66629435] [2025-02-05 20:10:32,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:32,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:10:32,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:32,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:10:32,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:10:32,922 INFO L87 Difference]: Start difference. First operand 1152 states and 1715 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:33,350 INFO L93 Difference]: Finished difference Result 2163 states and 3224 transitions. [2025-02-05 20:10:33,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:33,351 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 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 90 [2025-02-05 20:10:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:33,354 INFO L225 Difference]: With dead ends: 2163 [2025-02-05 20:10:33,354 INFO L226 Difference]: Without dead ends: 1148 [2025-02-05 20:10:33,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:33,355 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1661 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:33,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 4098 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:10:33,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-02-05 20:10:33,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2025-02-05 20:10:33,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4891020052310375) internal successors, (1708), 1147 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1708 transitions. [2025-02-05 20:10:33,369 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1708 transitions. Word has length 90 [2025-02-05 20:10:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:33,369 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1708 transitions. [2025-02-05 20:10:33,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1708 transitions. [2025-02-05 20:10:33,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-05 20:10:33,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:33,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:33,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 20:10:33,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:33,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:33,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1875362883, now seen corresponding path program 1 times [2025-02-05 20:10:33,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:33,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169791075] [2025-02-05 20:10:33,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:33,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:33,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-05 20:10:33,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-05 20:10:33,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:33,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:33,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:33,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169791075] [2025-02-05 20:10:33,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169791075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:33,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:33,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 20:10:33,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808568262] [2025-02-05 20:10:33,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:33,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 20:10:33,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:33,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 20:10:33,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-05 20:10:33,874 INFO L87 Difference]: Start difference. First operand 1148 states and 1708 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:35,030 INFO L93 Difference]: Finished difference Result 2157 states and 3213 transitions. [2025-02-05 20:10:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:10:35,031 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 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 90 [2025-02-05 20:10:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:35,033 INFO L225 Difference]: With dead ends: 2157 [2025-02-05 20:10:35,033 INFO L226 Difference]: Without dead ends: 1148 [2025-02-05 20:10:35,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-02-05 20:10:35,035 INFO L435 NwaCegarLoop]: 1360 mSDtfsCounter, 1658 mSDsluCounter, 12224 mSDsCounter, 0 mSdLazyCounter, 3026 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 13584 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:35,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 13584 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3026 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 20:10:35,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2025-02-05 20:10:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1148. [2025-02-05 20:10:35,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 1147 states have (on average 1.4882301656495205) internal successors, (1707), 1147 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1707 transitions. [2025-02-05 20:10:35,047 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1707 transitions. Word has length 90 [2025-02-05 20:10:35,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:35,047 INFO L471 AbstractCegarLoop]: Abstraction has 1148 states and 1707 transitions. [2025-02-05 20:10:35,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 12 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:35,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1707 transitions. [2025-02-05 20:10:35,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 20:10:35,048 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:35,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:35,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 20:10:35,048 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:35,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:35,049 INFO L85 PathProgramCache]: Analyzing trace with hash 94528194, now seen corresponding path program 1 times [2025-02-05 20:10:35,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:35,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619881331] [2025-02-05 20:10:35,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:35,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:35,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 20:10:35,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 20:10:35,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:35,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:35,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:35,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619881331] [2025-02-05 20:10:35,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619881331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:35,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:35,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 20:10:35,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513862525] [2025-02-05 20:10:35,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:35,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 20:10:35,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:35,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 20:10:35,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:10:35,477 INFO L87 Difference]: Start difference. First operand 1148 states and 1707 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:36,042 INFO L93 Difference]: Finished difference Result 2154 states and 3209 transitions. [2025-02-05 20:10:36,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 20:10:36,042 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 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 91 [2025-02-05 20:10:36,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:36,045 INFO L225 Difference]: With dead ends: 2154 [2025-02-05 20:10:36,045 INFO L226 Difference]: Without dead ends: 1152 [2025-02-05 20:10:36,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:10:36,046 INFO L435 NwaCegarLoop]: 1360 mSDtfsCounter, 1668 mSDsluCounter, 2803 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1668 SdHoareTripleChecker+Valid, 4163 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:36,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1668 Valid, 4163 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 20:10:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-02-05 20:10:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1150. [2025-02-05 20:10:36,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 1149 states have (on average 1.4873803307223672) internal successors, (1709), 1149 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1709 transitions. [2025-02-05 20:10:36,059 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1709 transitions. Word has length 91 [2025-02-05 20:10:36,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:36,059 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1709 transitions. [2025-02-05 20:10:36,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1709 transitions. [2025-02-05 20:10:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-05 20:10:36,060 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:36,060 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:36,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 20:10:36,060 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:36,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:36,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1686558536, now seen corresponding path program 1 times [2025-02-05 20:10:36,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:36,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399448746] [2025-02-05 20:10:36,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:36,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:36,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-05 20:10:36,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-05 20:10:36,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:36,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:36,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:36,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399448746] [2025-02-05 20:10:36,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399448746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:36,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:36,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 20:10:36,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497789291] [2025-02-05 20:10:36,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:36,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 20:10:36,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:36,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 20:10:36,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 20:10:36,282 INFO L87 Difference]: Start difference. First operand 1150 states and 1709 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:36,765 INFO L93 Difference]: Finished difference Result 2156 states and 3210 transitions. [2025-02-05 20:10:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 20:10:36,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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 91 [2025-02-05 20:10:36,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:36,768 INFO L225 Difference]: With dead ends: 2156 [2025-02-05 20:10:36,768 INFO L226 Difference]: Without dead ends: 1143 [2025-02-05 20:10:36,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:36,769 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1644 mSDsluCounter, 2731 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:36,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 4098 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 20:10:36,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2025-02-05 20:10:36,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2025-02-05 20:10:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.4868651488616462) internal successors, (1698), 1142 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1698 transitions. [2025-02-05 20:10:36,780 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1698 transitions. Word has length 91 [2025-02-05 20:10:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:36,781 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1698 transitions. [2025-02-05 20:10:36,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1698 transitions. [2025-02-05 20:10:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 20:10:36,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:36,782 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:36,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 20:10:36,782 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:36,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:36,782 INFO L85 PathProgramCache]: Analyzing trace with hash 839025213, now seen corresponding path program 1 times [2025-02-05 20:10:36,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:36,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792421672] [2025-02-05 20:10:36,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:36,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:36,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 20:10:36,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 20:10:36,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:36,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:37,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:37,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792421672] [2025-02-05 20:10:37,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792421672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:37,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:37,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 20:10:37,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902096958] [2025-02-05 20:10:37,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:37,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 20:10:37,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:37,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 20:10:37,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 20:10:37,140 INFO L87 Difference]: Start difference. First operand 1143 states and 1698 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:37,776 INFO L93 Difference]: Finished difference Result 2145 states and 3194 transitions. [2025-02-05 20:10:37,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:10:37,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 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 92 [2025-02-05 20:10:37,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:37,779 INFO L225 Difference]: With dead ends: 2145 [2025-02-05 20:10:37,779 INFO L226 Difference]: Without dead ends: 1146 [2025-02-05 20:10:37,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-05 20:10:37,780 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1639 mSDsluCounter, 5457 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 6824 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:37,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 6824 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 20:10:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-02-05 20:10:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1145. [2025-02-05 20:10:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 1.486013986013986) internal successors, (1700), 1144 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:37,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1700 transitions. [2025-02-05 20:10:37,791 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1700 transitions. Word has length 92 [2025-02-05 20:10:37,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:37,791 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1700 transitions. [2025-02-05 20:10:37,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:37,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1700 transitions. [2025-02-05 20:10:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 20:10:37,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:37,792 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:37,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 20:10:37,792 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:37,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1544662275, now seen corresponding path program 1 times [2025-02-05 20:10:37,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:37,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498632610] [2025-02-05 20:10:37,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:37,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:37,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 20:10:37,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 20:10:37,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:37,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:38,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 20:10:38,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498632610] [2025-02-05 20:10:38,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498632610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:38,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:38,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-05 20:10:38,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906138834] [2025-02-05 20:10:38,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:38,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 20:10:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 20:10:38,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 20:10:38,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-02-05 20:10:38,306 INFO L87 Difference]: Start difference. First operand 1145 states and 1700 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:39,892 INFO L93 Difference]: Finished difference Result 2170 states and 3232 transitions. [2025-02-05 20:10:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 20:10:39,892 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 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 92 [2025-02-05 20:10:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:39,895 INFO L225 Difference]: With dead ends: 2170 [2025-02-05 20:10:39,895 INFO L226 Difference]: Without dead ends: 1174 [2025-02-05 20:10:39,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-05 20:10:39,897 INFO L435 NwaCegarLoop]: 1366 mSDtfsCounter, 1608 mSDsluCounter, 20444 mSDsCounter, 0 mSdLazyCounter, 5011 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 21810 SdHoareTripleChecker+Invalid, 5012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:39,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 21810 Invalid, 5012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5011 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 20:10:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-02-05 20:10:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1164. [2025-02-05 20:10:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1164 states, 1163 states have (on average 1.4883920894239038) internal successors, (1731), 1163 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1164 states to 1164 states and 1731 transitions. [2025-02-05 20:10:39,908 INFO L78 Accepts]: Start accepts. Automaton has 1164 states and 1731 transitions. Word has length 92 [2025-02-05 20:10:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:39,909 INFO L471 AbstractCegarLoop]: Abstraction has 1164 states and 1731 transitions. [2025-02-05 20:10:39,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1164 states and 1731 transitions. [2025-02-05 20:10:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 20:10:39,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:39,911 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:39,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 20:10:39,911 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:39,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:39,911 INFO L85 PathProgramCache]: Analyzing trace with hash -662805913, now seen corresponding path program 1 times [2025-02-05 20:10:39,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 20:10:39,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131528136] [2025-02-05 20:10:39,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:39,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 20:10:39,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 20:10:39,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 20:10:39,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:39,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:10:39,954 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 20:10:39,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 20:10:40,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 20:10:40,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:40,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 20:10:40,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 20:10:40,059 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 20:10:40,060 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 20:10:40,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 20:10:40,064 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:40,114 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-02-05 20:10:40,134 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 20:10:40,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 08:10:40 BoogieIcfgContainer [2025-02-05 20:10:40,139 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 20:10:40,140 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 20:10:40,140 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 20:10:40,140 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 20:10:40,141 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:22" (3/4) ... [2025-02-05 20:10:40,143 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 20:10:40,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 20:10:40,144 INFO L158 Benchmark]: Toolchain (without parser) took 22340.22ms. Allocated memory was 167.8MB in the beginning and 729.8MB in the end (delta: 562.0MB). Free memory was 119.6MB in the beginning and 266.3MB in the end (delta: -146.7MB). Peak memory consumption was 421.8MB. Max. memory is 16.1GB. [2025-02-05 20:10:40,144 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 20:10:40,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 542.69ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 35.1MB in the end (delta: 84.1MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-02-05 20:10:40,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 357.13ms. Allocated memory was 167.8MB in the beginning and 184.5MB in the end (delta: 16.8MB). Free memory was 35.1MB in the beginning and 73.6MB in the end (delta: -38.5MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2025-02-05 20:10:40,145 INFO L158 Benchmark]: Boogie Preprocessor took 384.47ms. Allocated memory is still 184.5MB. Free memory was 73.6MB in the beginning and 62.6MB in the end (delta: 10.9MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. [2025-02-05 20:10:40,145 INFO L158 Benchmark]: IcfgBuilder took 3694.22ms. Allocated memory was 184.5MB in the beginning and 427.8MB in the end (delta: 243.3MB). Free memory was 62.6MB in the beginning and 112.6MB in the end (delta: -50.0MB). Peak memory consumption was 238.2MB. Max. memory is 16.1GB. [2025-02-05 20:10:40,145 INFO L158 Benchmark]: TraceAbstraction took 17351.10ms. Allocated memory was 427.8MB in the beginning and 729.8MB in the end (delta: 302.0MB). Free memory was 112.6MB in the beginning and 266.3MB in the end (delta: -153.7MB). Peak memory consumption was 144.0MB. Max. memory is 16.1GB. [2025-02-05 20:10:40,146 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 729.8MB. Free memory was 266.3MB in the beginning and 266.3MB in the end (delta: 95.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 20:10:40,147 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.15ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 542.69ms. Allocated memory is still 167.8MB. Free memory was 119.1MB in the beginning and 35.1MB in the end (delta: 84.1MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 357.13ms. Allocated memory was 167.8MB in the beginning and 184.5MB in the end (delta: 16.8MB). Free memory was 35.1MB in the beginning and 73.6MB in the end (delta: -38.5MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 384.47ms. Allocated memory is still 184.5MB. Free memory was 73.6MB in the beginning and 62.6MB in the end (delta: 10.9MB). Peak memory consumption was 72.0MB. Max. memory is 16.1GB. * IcfgBuilder took 3694.22ms. Allocated memory was 184.5MB in the beginning and 427.8MB in the end (delta: 243.3MB). Free memory was 62.6MB in the beginning and 112.6MB in the end (delta: -50.0MB). Peak memory consumption was 238.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17351.10ms. Allocated memory was 427.8MB in the beginning and 729.8MB in the end (delta: 302.0MB). Free memory was 112.6MB in the beginning and 266.3MB in the end (delta: -153.7MB). Peak memory consumption was 144.0MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 729.8MB. Free memory was 266.3MB in the beginning and 266.3MB in the end (delta: 95.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 385. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 2); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (2 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 3); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (3 - 1); [L35] const SORT_12 mask_SORT_12 = (SORT_12)-1 >> (sizeof(SORT_12) * 8 - 4); [L36] const SORT_12 msb_SORT_12 = (SORT_12)1 << (4 - 1); [L38] const SORT_16 mask_SORT_16 = (SORT_16)-1 >> (sizeof(SORT_16) * 8 - 8); [L39] const SORT_16 msb_SORT_16 = (SORT_16)1 << (8 - 1); [L41] const SORT_21 mask_SORT_21 = (SORT_21)-1 >> (sizeof(SORT_21) * 8 - 7); [L42] const SORT_21 msb_SORT_21 = (SORT_21)1 << (7 - 1); [L44] const SORT_21 var_22 = 1; [L45] const SORT_21 var_26 = 2; [L46] const SORT_21 var_29 = 4; [L47] const SORT_21 var_32 = 8; [L48] const SORT_21 var_35 = 16; [L49] const SORT_21 var_38 = 32; [L50] const SORT_21 var_41 = 64; [L51] const SORT_21 var_44 = 0; [L52] const SORT_3 var_47 = 1; [L53] const SORT_3 var_51 = 0; [L54] const SORT_6 var_138 = 0; [L56] SORT_1 input_2; [L57] SORT_3 input_4; [L58] SORT_3 input_5; [L59] SORT_6 input_7; [L60] SORT_3 input_8; [L61] SORT_3 input_9; [L62] SORT_3 input_10; [L63] SORT_3 input_11; [L64] SORT_12 input_13; [L65] SORT_3 input_14; [L66] SORT_3 input_15; [L67] SORT_16 input_17; [L68] SORT_3 input_18; [L69] SORT_3 input_19; [L70] SORT_3 input_20; [L71] SORT_3 input_360; [L72] SORT_3 input_382; [L73] SORT_3 input_397; [L74] SORT_3 input_412; [L75] SORT_3 input_427; [L76] SORT_3 input_442; [L77] SORT_3 input_457; [L78] SORT_3 input_472; [L79] SORT_3 input_487; [L80] SORT_3 input_502; [L81] SORT_3 input_517; [L82] SORT_3 input_532; [L83] SORT_3 input_547; [L84] SORT_3 input_562; [L85] SORT_3 input_577; [L86] SORT_3 input_592; [L87] SORT_3 input_608; [L88] SORT_3 input_610; [L89] SORT_3 input_612; [L90] SORT_3 input_614; [L91] SORT_3 input_616; [L92] SORT_3 input_618; [L93] SORT_3 input_620; [L94] SORT_3 input_622; [L95] SORT_3 input_627; [L96] SORT_3 input_669; [L97] SORT_3 input_678; [L98] SORT_21 input_683; [L99] SORT_21 input_684; [L100] SORT_21 input_685; [L101] SORT_21 input_686; [L102] SORT_21 input_689; [L103] SORT_21 input_693; [L104] SORT_21 input_697; [L105] SORT_21 input_705; [L106] SORT_21 input_709; [L107] SORT_21 input_711; [L108] SORT_21 input_715; [L109] SORT_21 input_718; [L110] SORT_21 input_722; [L111] SORT_21 input_727; [L112] SORT_21 input_731; [L113] SORT_21 input_736; [L114] SORT_21 input_738; [L115] SORT_21 input_739; [L116] SORT_21 input_741; [L117] SORT_21 input_745; [L118] SORT_21 input_750; [L119] SORT_21 input_757; [L120] SORT_21 input_758; [L121] SORT_21 input_760; [L122] SORT_21 input_764; [L123] SORT_21 input_769; [L124] SORT_21 input_771; [L125] SORT_21 input_772; [L126] SORT_21 input_774; [L127] SORT_21 input_778; [L128] SORT_21 input_783; [L129] SORT_21 input_787; [L130] SORT_21 input_792; [L131] SORT_21 input_794; [L132] SORT_21 input_800; [L133] SORT_21 input_812; [L134] SORT_3 input_830; [L135] SORT_3 input_837; [L136] SORT_3 input_848; [L137] SORT_3 input_854; [L138] SORT_3 input_860; [L139] SORT_3 input_866; [L140] SORT_3 input_872; [L141] SORT_3 input_878; [L142] SORT_3 input_884; [L143] SORT_3 input_890; [L144] SORT_3 input_896; [L145] SORT_3 input_902; [L146] SORT_3 input_908; [L147] SORT_3 input_914; [L148] SORT_3 input_920; [L150] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L150] SORT_21 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L151] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L151] SORT_3 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L152] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L152] SORT_3 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L153] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L153] SORT_3 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L154] EXPR __VERIFIER_nondet_uchar() & mask_SORT_21 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L154] SORT_21 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_21; [L155] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L155] SORT_3 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L156] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L156] SORT_3 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L157] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L157] SORT_3 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L158] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L158] SORT_3 state_86 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L159] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L159] SORT_3 state_103 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L160] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L160] SORT_3 state_106 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L161] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L161] SORT_3 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L162] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L162] SORT_3 state_112 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L163] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L163] SORT_3 state_116 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L164] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L164] SORT_3 state_121 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L165] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L165] SORT_3 state_124 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L166] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L166] SORT_3 state_134 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L167] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L167] SORT_3 state_141 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L168] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L168] SORT_3 state_144 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L169] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L169] SORT_3 state_153 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L170] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L170] SORT_3 state_158 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L171] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L171] SORT_3 state_161 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L172] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L172] SORT_3 state_173 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L173] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L173] SORT_3 state_183 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L174] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L174] SORT_3 state_188 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L175] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L175] SORT_3 state_191 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L176] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L176] SORT_3 state_200 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L177] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L177] SORT_3 state_213 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L178] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L178] SORT_3 state_226 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L180] SORT_21 init_24_arg_1 = var_22; [L181] state_23 = init_24_arg_1 [L182] SORT_3 init_53_arg_1 = var_51; [L183] state_52 = init_53_arg_1 [L184] SORT_3 init_55_arg_1 = var_51; [L185] state_54 = init_55_arg_1 [L186] SORT_3 init_57_arg_1 = var_51; [L187] state_56 = init_57_arg_1 [L188] SORT_21 init_59_arg_1 = var_22; [L189] state_58 = init_59_arg_1 [L190] SORT_3 init_63_arg_1 = var_51; [L191] state_62 = init_63_arg_1 [L192] SORT_3 init_67_arg_1 = var_51; [L193] state_66 = init_67_arg_1 [L194] SORT_3 init_71_arg_1 = var_51; [L195] state_70 = init_71_arg_1 [L196] SORT_3 init_87_arg_1 = var_51; [L197] state_86 = init_87_arg_1 [L198] SORT_3 init_104_arg_1 = var_51; [L199] state_103 = init_104_arg_1 [L200] SORT_3 init_107_arg_1 = var_51; [L201] state_106 = init_107_arg_1 [L202] SORT_3 init_109_arg_1 = var_51; [L203] state_108 = init_109_arg_1 [L204] SORT_3 init_113_arg_1 = var_51; [L205] state_112 = init_113_arg_1 [L206] SORT_3 init_117_arg_1 = var_51; [L207] state_116 = init_117_arg_1 [L208] SORT_3 init_122_arg_1 = var_51; [L209] state_121 = init_122_arg_1 [L210] SORT_3 init_125_arg_1 = var_51; [L211] state_124 = init_125_arg_1 [L212] SORT_3 init_135_arg_1 = var_51; [L213] state_134 = init_135_arg_1 [L214] SORT_3 init_142_arg_1 = var_51; [L215] state_141 = init_142_arg_1 [L216] SORT_3 init_145_arg_1 = var_51; [L217] state_144 = init_145_arg_1 [L218] SORT_3 init_154_arg_1 = var_51; [L219] state_153 = init_154_arg_1 [L220] SORT_3 init_159_arg_1 = var_51; [L221] state_158 = init_159_arg_1 [L222] SORT_3 init_162_arg_1 = var_51; [L223] state_161 = init_162_arg_1 [L224] SORT_3 init_174_arg_1 = var_51; [L225] state_173 = init_174_arg_1 [L226] SORT_3 init_184_arg_1 = var_51; [L227] state_183 = init_184_arg_1 [L228] SORT_3 init_189_arg_1 = var_51; [L229] state_188 = init_189_arg_1 [L230] SORT_3 init_192_arg_1 = var_51; [L231] state_191 = init_192_arg_1 [L232] SORT_3 init_201_arg_1 = var_51; [L233] state_200 = init_201_arg_1 [L234] SORT_3 init_214_arg_1 = var_51; [L235] state_213 = init_214_arg_1 [L236] SORT_3 init_227_arg_1 = var_51; [L237] state_226 = init_227_arg_1 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L240] input_2 = __VERIFIER_nondet_uchar() [L241] input_4 = __VERIFIER_nondet_uchar() [L242] input_5 = __VERIFIER_nondet_uchar() [L243] input_7 = __VERIFIER_nondet_uchar() [L244] EXPR input_7 & mask_SORT_6 VAL [mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L244] input_7 = input_7 & mask_SORT_6 [L245] input_8 = __VERIFIER_nondet_uchar() [L246] input_9 = __VERIFIER_nondet_uchar() [L247] input_10 = __VERIFIER_nondet_uchar() [L248] input_11 = __VERIFIER_nondet_uchar() [L249] input_13 = __VERIFIER_nondet_uchar() [L250] input_14 = __VERIFIER_nondet_uchar() [L251] input_15 = __VERIFIER_nondet_uchar() [L252] input_17 = __VERIFIER_nondet_uchar() [L253] input_18 = __VERIFIER_nondet_uchar() [L254] input_19 = __VERIFIER_nondet_uchar() [L255] input_20 = __VERIFIER_nondet_uchar() [L256] input_360 = __VERIFIER_nondet_uchar() [L257] input_382 = __VERIFIER_nondet_uchar() [L258] input_397 = __VERIFIER_nondet_uchar() [L259] input_412 = __VERIFIER_nondet_uchar() [L260] input_427 = __VERIFIER_nondet_uchar() [L261] input_442 = __VERIFIER_nondet_uchar() [L262] input_457 = __VERIFIER_nondet_uchar() [L263] input_472 = __VERIFIER_nondet_uchar() [L264] input_487 = __VERIFIER_nondet_uchar() [L265] input_502 = __VERIFIER_nondet_uchar() [L266] input_517 = __VERIFIER_nondet_uchar() [L267] input_532 = __VERIFIER_nondet_uchar() [L268] input_547 = __VERIFIER_nondet_uchar() [L269] input_562 = __VERIFIER_nondet_uchar() [L270] input_577 = __VERIFIER_nondet_uchar() [L271] input_592 = __VERIFIER_nondet_uchar() [L272] input_608 = __VERIFIER_nondet_uchar() [L273] input_610 = __VERIFIER_nondet_uchar() [L274] input_612 = __VERIFIER_nondet_uchar() [L275] input_614 = __VERIFIER_nondet_uchar() [L276] input_616 = __VERIFIER_nondet_uchar() [L277] input_618 = __VERIFIER_nondet_uchar() [L278] input_620 = __VERIFIER_nondet_uchar() [L279] input_622 = __VERIFIER_nondet_uchar() [L280] input_627 = __VERIFIER_nondet_uchar() [L281] input_669 = __VERIFIER_nondet_uchar() [L282] input_678 = __VERIFIER_nondet_uchar() [L283] input_683 = __VERIFIER_nondet_uchar() [L284] input_684 = __VERIFIER_nondet_uchar() [L285] input_685 = __VERIFIER_nondet_uchar() [L286] input_686 = __VERIFIER_nondet_uchar() [L287] input_689 = __VERIFIER_nondet_uchar() [L288] input_693 = __VERIFIER_nondet_uchar() [L289] input_697 = __VERIFIER_nondet_uchar() [L290] input_705 = __VERIFIER_nondet_uchar() [L291] input_709 = __VERIFIER_nondet_uchar() [L292] input_711 = __VERIFIER_nondet_uchar() [L293] input_715 = __VERIFIER_nondet_uchar() [L294] input_718 = __VERIFIER_nondet_uchar() [L295] input_722 = __VERIFIER_nondet_uchar() [L296] input_727 = __VERIFIER_nondet_uchar() [L297] input_731 = __VERIFIER_nondet_uchar() [L298] input_736 = __VERIFIER_nondet_uchar() [L299] input_738 = __VERIFIER_nondet_uchar() [L300] input_739 = __VERIFIER_nondet_uchar() [L301] input_741 = __VERIFIER_nondet_uchar() [L302] input_745 = __VERIFIER_nondet_uchar() [L303] input_750 = __VERIFIER_nondet_uchar() [L304] input_757 = __VERIFIER_nondet_uchar() [L305] input_758 = __VERIFIER_nondet_uchar() [L306] input_760 = __VERIFIER_nondet_uchar() [L307] input_764 = __VERIFIER_nondet_uchar() [L308] input_769 = __VERIFIER_nondet_uchar() [L309] input_771 = __VERIFIER_nondet_uchar() [L310] input_772 = __VERIFIER_nondet_uchar() [L311] input_774 = __VERIFIER_nondet_uchar() [L312] input_778 = __VERIFIER_nondet_uchar() [L313] input_783 = __VERIFIER_nondet_uchar() [L314] input_787 = __VERIFIER_nondet_uchar() [L315] input_792 = __VERIFIER_nondet_uchar() [L316] input_794 = __VERIFIER_nondet_uchar() [L317] input_800 = __VERIFIER_nondet_uchar() [L318] input_812 = __VERIFIER_nondet_uchar() [L319] input_830 = __VERIFIER_nondet_uchar() [L320] input_837 = __VERIFIER_nondet_uchar() [L321] input_848 = __VERIFIER_nondet_uchar() [L322] input_854 = __VERIFIER_nondet_uchar() [L323] input_860 = __VERIFIER_nondet_uchar() [L324] input_866 = __VERIFIER_nondet_uchar() [L325] input_872 = __VERIFIER_nondet_uchar() [L326] input_878 = __VERIFIER_nondet_uchar() [L327] input_884 = __VERIFIER_nondet_uchar() [L328] input_890 = __VERIFIER_nondet_uchar() [L329] input_896 = __VERIFIER_nondet_uchar() [L330] input_902 = __VERIFIER_nondet_uchar() [L331] input_908 = __VERIFIER_nondet_uchar() [L332] input_914 = __VERIFIER_nondet_uchar() [L333] input_920 = __VERIFIER_nondet_uchar() [L336] SORT_21 var_25_arg_0 = state_23; [L337] SORT_21 var_25_arg_1 = var_22; [L338] SORT_3 var_25 = var_25_arg_0 == var_25_arg_1; [L339] SORT_21 var_27_arg_0 = state_23; [L340] SORT_21 var_27_arg_1 = var_26; [L341] SORT_3 var_27 = var_27_arg_0 == var_27_arg_1; [L342] SORT_3 var_28_arg_0 = var_25; [L343] SORT_3 var_28_arg_1 = var_27; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_28_arg_0=1, var_28_arg_1=0, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L344] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L344] SORT_3 var_28 = var_28_arg_0 | var_28_arg_1; [L345] SORT_21 var_30_arg_0 = state_23; [L346] SORT_21 var_30_arg_1 = var_29; [L347] SORT_3 var_30 = var_30_arg_0 == var_30_arg_1; [L348] SORT_3 var_31_arg_0 = var_28; [L349] SORT_3 var_31_arg_1 = var_30; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_31_arg_0=1, var_31_arg_1=0, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L350] EXPR var_31_arg_0 | var_31_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L350] SORT_3 var_31 = var_31_arg_0 | var_31_arg_1; [L351] SORT_21 var_33_arg_0 = state_23; [L352] SORT_21 var_33_arg_1 = var_32; [L353] SORT_3 var_33 = var_33_arg_0 == var_33_arg_1; [L354] SORT_3 var_34_arg_0 = var_31; [L355] SORT_3 var_34_arg_1 = var_33; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_34_arg_0=1, var_34_arg_1=0, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L356] EXPR var_34_arg_0 | var_34_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L356] SORT_3 var_34 = var_34_arg_0 | var_34_arg_1; [L357] SORT_21 var_36_arg_0 = state_23; [L358] SORT_21 var_36_arg_1 = var_35; [L359] SORT_3 var_36 = var_36_arg_0 == var_36_arg_1; [L360] SORT_3 var_37_arg_0 = var_34; [L361] SORT_3 var_37_arg_1 = var_36; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_37_arg_0=1, var_37_arg_1=0, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L362] EXPR var_37_arg_0 | var_37_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L362] SORT_3 var_37 = var_37_arg_0 | var_37_arg_1; [L363] SORT_21 var_39_arg_0 = state_23; [L364] SORT_21 var_39_arg_1 = var_38; [L365] SORT_3 var_39 = var_39_arg_0 == var_39_arg_1; [L366] SORT_3 var_40_arg_0 = var_37; [L367] SORT_3 var_40_arg_1 = var_39; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_40_arg_0=1, var_40_arg_1=0, var_41=64, var_44=0, var_47=1, var_51=0] [L368] EXPR var_40_arg_0 | var_40_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L368] SORT_3 var_40 = var_40_arg_0 | var_40_arg_1; [L369] SORT_21 var_42_arg_0 = state_23; [L370] SORT_21 var_42_arg_1 = var_41; [L371] SORT_3 var_42 = var_42_arg_0 == var_42_arg_1; [L372] SORT_3 var_43_arg_0 = var_40; [L373] SORT_3 var_43_arg_1 = var_42; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_43_arg_0=1, var_43_arg_1=0, var_44=0, var_47=1, var_51=0] [L374] EXPR var_43_arg_0 | var_43_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_23=1, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L374] SORT_3 var_43 = var_43_arg_0 | var_43_arg_1; [L375] SORT_21 var_45_arg_0 = state_23; [L376] SORT_21 var_45_arg_1 = var_44; [L377] SORT_3 var_45 = var_45_arg_0 == var_45_arg_1; [L378] SORT_3 var_46_arg_0 = var_43; [L379] SORT_3 var_46_arg_1 = var_45; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_46_arg_0=1, var_46_arg_1=0, var_47=1, var_51=0] [L380] EXPR var_46_arg_0 | var_46_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L380] SORT_3 var_46 = var_46_arg_0 | var_46_arg_1; [L381] SORT_3 var_48_arg_0 = var_46; [L382] SORT_3 var_48 = ~var_48_arg_0; [L383] SORT_3 var_49_arg_0 = var_47; [L384] SORT_3 var_49_arg_1 = var_48; VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_49_arg_0=1, var_49_arg_1=-2, var_51=0] [L385] EXPR var_49_arg_0 & var_49_arg_1 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L385] SORT_3 var_49 = var_49_arg_0 & var_49_arg_1; [L386] EXPR var_49 & mask_SORT_3 VAL [input_7=0, mask_SORT_1=3, mask_SORT_21=127, mask_SORT_3=1, mask_SORT_6=7, state_103=0, state_106=0, state_108=0, state_112=0, state_116=0, state_121=0, state_124=0, state_134=0, state_141=0, state_144=0, state_153=0, state_158=0, state_161=0, state_173=0, state_183=0, state_188=0, state_191=0, state_200=0, state_213=0, state_226=0, state_52=0, state_54=0, state_56=0, state_58=1, state_62=0, state_66=0, state_70=0, state_86=0, var_138=0, var_22=1, var_26=2, var_29=4, var_32=8, var_35=16, var_38=32, var_41=64, var_44=0, var_47=1, var_51=0] [L386] var_49 = var_49 & mask_SORT_3 [L387] SORT_3 bad_50_arg_0 = var_49; [L388] CALL __VERIFIER_assert(!(bad_50_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18285 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18285 mSDsluCounter, 95741 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76579 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21242 IncrementalHoareTripleChecker+Invalid, 21252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 19162 mSDtfsCounter, 21242 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=14, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 1329 NumberOfCodeBlocks, 1329 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1222 ConstructedInterpolants, 0 QuantifiedInterpolants, 6521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 20:10:40,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 20:10:41,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 20:10:42,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-02-05 20:10:42,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 20:10:42,014 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 20:10:42,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 20:10:42,041 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 20:10:42,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 20:10:42,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 20:10:42,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 20:10:42,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 20:10:42,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 20:10:42,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 20:10:42,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 20:10:42,042 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 20:10:42,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 20:10:42,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 20:10:42,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 20:10:42,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 20:10:42,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:42,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 20:10:42,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 20:10:42,045 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 20:10:42,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 20:10:42,045 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 20:10:42,045 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 20:10:42,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 20:10:42,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 20:10:42,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 20:10:42,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 20:10:42,045 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c8208b6c8f4a2ac058115c356d3ca9113d648f4f67e8abc6f1ec7c44bb7ab63f [2025-02-05 20:10:42,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 20:10:42,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 20:10:42,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 20:10:42,256 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 20:10:42,257 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 20:10:42,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-02-05 20:10:43,339 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b13a7bdad/44e91e4251b34e658f63fec165dac208/FLAGf3c2a36a7 [2025-02-05 20:10:43,672 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 20:10:43,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-02-05 20:10:43,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b13a7bdad/44e91e4251b34e658f63fec165dac208/FLAGf3c2a36a7 [2025-02-05 20:10:43,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b13a7bdad/44e91e4251b34e658f63fec165dac208 [2025-02-05 20:10:43,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 20:10:43,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 20:10:43,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:43,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 20:10:43,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 20:10:43,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:43" (1/1) ... [2025-02-05 20:10:43,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be52615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:43, skipping insertion in model container [2025-02-05 20:10:43,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 08:10:43" (1/1) ... [2025-02-05 20:10:43,771 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 20:10:43,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-02-05 20:10:44,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:44,199 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 20:10:44,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c[1268,1281] [2025-02-05 20:10:44,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 20:10:44,342 INFO L204 MainTranslator]: Completed translation [2025-02-05 20:10:44,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44 WrapperNode [2025-02-05 20:10:44,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 20:10:44,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:44,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 20:10:44,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 20:10:44,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,482 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2616 [2025-02-05 20:10:44,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 20:10:44,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 20:10:44,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 20:10:44,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 20:10:44,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,544 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 20:10:44,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,577 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 20:10:44,624 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 20:10:44,624 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 20:10:44,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 20:10:44,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (1/1) ... [2025-02-05 20:10:44,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 20:10:44,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:44,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 20:10:44,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 20:10:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 20:10:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 20:10:44,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 20:10:44,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 20:10:44,984 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 20:10:44,985 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 20:10:46,980 INFO L? ?]: Removed 159 outVars from TransFormulas that were not future-live. [2025-02-05 20:10:46,981 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 20:10:46,988 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 20:10:46,989 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 20:10:46,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:46 BoogieIcfgContainer [2025-02-05 20:10:46,989 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 20:10:46,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 20:10:46,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 20:10:46,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 20:10:46,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 08:10:43" (1/3) ... [2025-02-05 20:10:46,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba1306d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:46, skipping insertion in model container [2025-02-05 20:10:46,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 08:10:44" (2/3) ... [2025-02-05 20:10:46,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba1306d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 08:10:46, skipping insertion in model container [2025-02-05 20:10:46,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 08:10:46" (3/3) ... [2025-02-05 20:10:46,999 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c [2025-02-05 20:10:47,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 20:10:47,013 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vcegar_QF_BV_pj_icu_icctl_p1.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 20:10:47,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 20:10:47,061 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;@6a43689c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 20:10:47,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 20:10:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:47,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-05 20:10:47,070 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:47,071 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-05 20:10:47,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:47,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-02-05 20:10:47,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:10:47,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703067352] [2025-02-05 20:10:47,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:47,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:47,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:47,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:10:47,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 20:10:47,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-05 20:10:47,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-05 20:10:47,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:47,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:47,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 20:10:47,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:10:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:47,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 20:10:47,715 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:10:47,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703067352] [2025-02-05 20:10:47,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703067352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 20:10:47,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 20:10:47,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 20:10:47,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794788573] [2025-02-05 20:10:47,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 20:10:47,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 20:10:47,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:10:47,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 20:10:47,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:47,739 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:47,816 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2025-02-05 20:10:47,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 20:10:47,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-05 20:10:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:47,826 INFO L225 Difference]: With dead ends: 17 [2025-02-05 20:10:47,826 INFO L226 Difference]: Without dead ends: 9 [2025-02-05 20:10:47,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 20:10:47,832 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:47,834 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.1s Time] [2025-02-05 20:10:47,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-02-05 20:10:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-02-05 20:10:47,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-02-05 20:10:47,855 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-02-05 20:10:47,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:47,855 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-02-05 20:10:47,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 20:10:47,856 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-02-05 20:10:47,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-05 20:10:47,856 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:47,856 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-05 20:10:47,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 20:10:48,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:48,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:48,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:48,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-02-05 20:10:48,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:10:48,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018838527] [2025-02-05 20:10:48,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 20:10:48,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:48,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:48,069 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:10:48,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 20:10:48,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-05 20:10:48,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-05 20:10:48,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 20:10:48,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:48,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-05 20:10:48,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 20:10:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:48,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 20:10:54,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 20:10:54,798 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 20:10:54,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018838527] [2025-02-05 20:10:54,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018838527] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 20:10:54,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 20:10:54,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2025-02-05 20:10:54,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994331876] [2025-02-05 20:10:54,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 20:10:54,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 20:10:54,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 20:10:54,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 20:10:54,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=64, Unknown=1, NotChecked=0, Total=90 [2025-02-05 20:10:54,800 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-02-05 20:10:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 20:10:54,967 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-02-05 20:10:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 20:10:54,967 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-02-05 20:10:54,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 20:10:54,967 INFO L225 Difference]: With dead ends: 14 [2025-02-05 20:10:54,967 INFO L226 Difference]: Without dead ends: 12 [2025-02-05 20:10:54,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=40, Invalid=91, Unknown=1, NotChecked=0, Total=132 [2025-02-05 20:10:54,968 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 20:10:54,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 20:10:54,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-05 20:10:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-05 20:10:54,970 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-02-05 20:10:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2025-02-05 20:10:54,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2025-02-05 20:10:54,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 20:10:54,970 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2025-02-05 20:10:54,970 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-02-05 20:10:54,970 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2025-02-05 20:10:54,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 20:10:54,971 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 20:10:54,971 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2025-02-05 20:10:54,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 20:10:55,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:55,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 20:10:55,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 20:10:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1791040441, now seen corresponding path program 2 times [2025-02-05 20:10:55,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 20:10:55,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1792314019] [2025-02-05 20:10:55,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 20:10:55,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 20:10:55,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 20:10:55,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 20:10:55,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 20:10:55,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-02-05 20:10:55,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 20:10:55,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 20:10:55,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 20:10:55,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-02-05 20:10:55,895 INFO L279 TraceCheckSpWp]: Computing forward predicates...