./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 707a62cdbfecf08d6cd7391f672114e8110bcee31b0927d7d5b0c17b9e69700b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:58:04,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:58:04,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:58:04,674 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:58:04,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:58:04,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:58:04,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:58:04,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:58:04,696 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:58:04,696 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:58:04,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:58:04,696 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:58:04,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:58:04,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:58:04,697 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:58:04,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:58:04,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:58:04,698 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:58:04,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:58:04,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:58:04,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:58:04,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:58:04,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:58:04,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:58:04,698 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:58:04,698 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:58:04,698 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:58:04,698 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:58:04,699 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:58:04,699 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:58:04,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:58:04,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:58:04,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:58:04,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:58:04,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:58:04,699 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:58:04,699 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:58:04,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:58:04,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:58:04,700 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:58:04,700 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:58:04,700 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:58:04,700 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:58:04,700 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 707a62cdbfecf08d6cd7391f672114e8110bcee31b0927d7d5b0c17b9e69700b [2025-02-05 21:58:04,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:58:04,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:58:04,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:58:04,944 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:58:04,944 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:58:04,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2025-02-05 21:58:06,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25c1b6ffa/7d5ac9bb155447be92ce2e051bcd8747/FLAG1c98e87d0 [2025-02-05 21:58:06,441 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:58:06,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2025-02-05 21:58:06,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25c1b6ffa/7d5ac9bb155447be92ce2e051bcd8747/FLAG1c98e87d0 [2025-02-05 21:58:06,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/25c1b6ffa/7d5ac9bb155447be92ce2e051bcd8747 [2025-02-05 21:58:06,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:58:06,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:58:06,469 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:58:06,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:58:06,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:58:06,472 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:06,473 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661321c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06, skipping insertion in model container [2025-02-05 21:58:06,473 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:06,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:58:06,614 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i[916,929] [2025-02-05 21:58:06,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:58:06,789 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:58:06,798 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i[916,929] [2025-02-05 21:58:06,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:58:06,866 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:58:06,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06 WrapperNode [2025-02-05 21:58:06,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:58:06,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:58:06,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:58:06,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:58:06,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:06,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:06,936 INFO L138 Inliner]: procedures = 26, calls = 123, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 803 [2025-02-05 21:58:06,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:58:06,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:58:06,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:58:06,937 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:58:06,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:06,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:06,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:07,002 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 21:58:07,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:07,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:07,031 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:07,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:07,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:07,050 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:07,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:58:07,068 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:58:07,068 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:58:07,068 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:58:07,069 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (1/1) ... [2025-02-05 21:58:07,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:58:07,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:07,092 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 21:58:07,097 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 21:58:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:58:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:58:07,112 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:58:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:58:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:58:07,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:58:07,239 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:58:07,240 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:58:07,956 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: havoc property_#t~bitwise75#1; [2025-02-05 21:58:08,094 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-05 21:58:08,095 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:58:08,126 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:58:08,129 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:58:08,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:58:08 BoogieIcfgContainer [2025-02-05 21:58:08,130 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:58:08,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:58:08,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:58:08,138 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:58:08,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:58:06" (1/3) ... [2025-02-05 21:58:08,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7523dd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:58:08, skipping insertion in model container [2025-02-05 21:58:08,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:58:06" (2/3) ... [2025-02-05 21:58:08,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7523dd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:58:08, skipping insertion in model container [2025-02-05 21:58:08,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:58:08" (3/3) ... [2025-02-05 21:58:08,139 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2025-02-05 21:58:08,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:58:08,150 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-44.i that has 2 procedures, 333 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:58:08,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:58:08,193 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;@9c5507, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:58:08,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:58:08,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 333 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 221 states have internal predecessors, (345), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:58:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-02-05 21:58:08,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:08,216 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:08,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:08,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:08,220 INFO L85 PathProgramCache]: Analyzing trace with hash -94509886, now seen corresponding path program 1 times [2025-02-05 21:58:08,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:08,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601008102] [2025-02-05 21:58:08,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:08,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-02-05 21:58:08,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-02-05 21:58:08,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:08,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:08,894 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:58:08,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:08,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601008102] [2025-02-05 21:58:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601008102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:08,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:08,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 21:58:08,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085807241] [2025-02-05 21:58:08,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:08,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:58:08,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:08,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:58:08,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:58:08,922 INFO L87 Difference]: Start difference. First operand has 333 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 221 states have internal predecessors, (345), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:09,005 INFO L93 Difference]: Finished difference Result 660 states and 1235 transitions. [2025-02-05 21:58:09,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:58:09,007 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 705 [2025-02-05 21:58:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:09,022 INFO L225 Difference]: With dead ends: 660 [2025-02-05 21:58:09,023 INFO L226 Difference]: Without dead ends: 330 [2025-02-05 21:58:09,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:58:09,031 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:09,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 550 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:58:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-05 21:58:09,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-02-05 21:58:09,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 218 states have (on average 1.5504587155963303) internal successors, (338), 218 states have internal predecessors, (338), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-05 21:58:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 558 transitions. [2025-02-05 21:58:09,127 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 558 transitions. Word has length 705 [2025-02-05 21:58:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:09,131 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 558 transitions. [2025-02-05 21:58:09,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 558 transitions. [2025-02-05 21:58:09,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-02-05 21:58:09,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:09,146 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:09,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 21:58:09,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:09,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:09,148 INFO L85 PathProgramCache]: Analyzing trace with hash -773794870, now seen corresponding path program 1 times [2025-02-05 21:58:09,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:09,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045881110] [2025-02-05 21:58:09,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:09,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:09,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-02-05 21:58:09,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-02-05 21:58:09,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:09,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:58:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045881110] [2025-02-05 21:58:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045881110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:09,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:09,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202380312] [2025-02-05 21:58:09,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:09,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:09,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:09,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:09,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:09,793 INFO L87 Difference]: Start difference. First operand 330 states and 558 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:09,880 INFO L93 Difference]: Finished difference Result 849 states and 1441 transitions. [2025-02-05 21:58:09,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:09,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2025-02-05 21:58:09,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:09,889 INFO L225 Difference]: With dead ends: 849 [2025-02-05 21:58:09,889 INFO L226 Difference]: Without dead ends: 522 [2025-02-05 21:58:09,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:09,891 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 319 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:09,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1082 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:58:09,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-02-05 21:58:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 519. [2025-02-05 21:58:09,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 370 states have (on average 1.5972972972972972) internal successors, (591), 371 states have internal predecessors, (591), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 145 states have call predecessors, (146), 146 states have call successors, (146) [2025-02-05 21:58:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 883 transitions. [2025-02-05 21:58:09,953 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 883 transitions. Word has length 706 [2025-02-05 21:58:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:09,954 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 883 transitions. [2025-02-05 21:58:09,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:09,955 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 883 transitions. [2025-02-05 21:58:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-02-05 21:58:09,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:09,963 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:09,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:58:09,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:09,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:09,965 INFO L85 PathProgramCache]: Analyzing trace with hash -235785300, now seen corresponding path program 1 times [2025-02-05 21:58:09,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:09,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985660759] [2025-02-05 21:58:09,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:10,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-02-05 21:58:10,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-02-05 21:58:10,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:10,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:10,592 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-02-05 21:58:10,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:10,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985660759] [2025-02-05 21:58:10,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985660759] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:58:10,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987434911] [2025-02-05 21:58:10,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:10,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:10,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:10,598 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 21:58:10,599 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 21:58:10,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-02-05 21:58:10,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-02-05 21:58:10,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:10,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:10,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 21:58:10,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:58:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:58:11,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:58:11,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987434911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:11,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:58:11,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 21:58:11,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628012093] [2025-02-05 21:58:11,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:11,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:11,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:11,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:11,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:58:11,066 INFO L87 Difference]: Start difference. First operand 519 states and 883 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:11,162 INFO L93 Difference]: Finished difference Result 1377 states and 2347 transitions. [2025-02-05 21:58:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:11,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2025-02-05 21:58:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:11,170 INFO L225 Difference]: With dead ends: 1377 [2025-02-05 21:58:11,172 INFO L226 Difference]: Without dead ends: 861 [2025-02-05 21:58:11,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:58:11,176 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 281 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:11,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1225 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:58:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-02-05 21:58:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 857. [2025-02-05 21:58:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 640 states have (on average 1.621875) internal successors, (1038), 643 states have internal predecessors, (1038), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 209 states have call predecessors, (212), 212 states have call successors, (212) [2025-02-05 21:58:11,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1462 transitions. [2025-02-05 21:58:11,235 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1462 transitions. Word has length 706 [2025-02-05 21:58:11,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:11,236 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1462 transitions. [2025-02-05 21:58:11,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1462 transitions. [2025-02-05 21:58:11,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-02-05 21:58:11,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:11,240 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:11,249 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 21:58:11,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:11,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:11,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:11,446 INFO L85 PathProgramCache]: Analyzing trace with hash 718443595, now seen corresponding path program 1 times [2025-02-05 21:58:11,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:11,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910777574] [2025-02-05 21:58:11,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:11,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:11,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-02-05 21:58:11,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-02-05 21:58:11,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:11,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-02-05 21:58:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910777574] [2025-02-05 21:58:11,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910777574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:58:11,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211608028] [2025-02-05 21:58:11,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:11,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:11,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:11,899 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 21:58:11,900 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 21:58:12,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-02-05 21:58:12,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-02-05 21:58:12,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:12,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:12,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 21:58:12,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:58:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:58:12,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:58:12,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [211608028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:12,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:58:12,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-05 21:58:12,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625218694] [2025-02-05 21:58:12,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:12,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:58:12,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:12,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:58:12,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:58:12,309 INFO L87 Difference]: Start difference. First operand 857 states and 1462 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:12,454 INFO L93 Difference]: Finished difference Result 2581 states and 4404 transitions. [2025-02-05 21:58:12,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:58:12,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2025-02-05 21:58:12,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:12,464 INFO L225 Difference]: With dead ends: 2581 [2025-02-05 21:58:12,465 INFO L226 Difference]: Without dead ends: 1727 [2025-02-05 21:58:12,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:58:12,468 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 535 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:12,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2510 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:58:12,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2025-02-05 21:58:12,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1126. [2025-02-05 21:58:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 909 states have (on average 1.6567656765676568) internal successors, (1506), 912 states have internal predecessors, (1506), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 209 states have call predecessors, (212), 212 states have call successors, (212) [2025-02-05 21:58:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1930 transitions. [2025-02-05 21:58:12,556 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1930 transitions. Word has length 706 [2025-02-05 21:58:12,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:12,557 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1930 transitions. [2025-02-05 21:58:12,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:12,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1930 transitions. [2025-02-05 21:58:12,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-02-05 21:58:12,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:12,565 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:12,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 21:58:12,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:12,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:12,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:12,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1886639850, now seen corresponding path program 1 times [2025-02-05 21:58:12,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:12,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26799472] [2025-02-05 21:58:12,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:12,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:12,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-02-05 21:58:12,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-02-05 21:58:12,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:12,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:58:12,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:12,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26799472] [2025-02-05 21:58:12,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26799472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:12,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:12,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:12,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041115069] [2025-02-05 21:58:12,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:12,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:12,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:12,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:12,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:12,989 INFO L87 Difference]: Start difference. First operand 1126 states and 1930 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:13,094 INFO L93 Difference]: Finished difference Result 2900 states and 4953 transitions. [2025-02-05 21:58:13,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:13,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2025-02-05 21:58:13,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:13,103 INFO L225 Difference]: With dead ends: 2900 [2025-02-05 21:58:13,103 INFO L226 Difference]: Without dead ends: 1777 [2025-02-05 21:58:13,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:13,106 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 347 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:13,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1124 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:58:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-02-05 21:58:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1774. [2025-02-05 21:58:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1363 states have (on average 1.6228906823184153) internal successors, (2212), 1370 states have internal predecessors, (2212), 402 states have call successors, (402), 8 states have call predecessors, (402), 8 states have return successors, (402), 395 states have call predecessors, (402), 402 states have call successors, (402) [2025-02-05 21:58:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 3016 transitions. [2025-02-05 21:58:13,205 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 3016 transitions. Word has length 706 [2025-02-05 21:58:13,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:13,206 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 3016 transitions. [2025-02-05 21:58:13,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 3016 transitions. [2025-02-05 21:58:13,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-02-05 21:58:13,214 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:13,215 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:13,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:58:13,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:13,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:13,216 INFO L85 PathProgramCache]: Analyzing trace with hash -437387989, now seen corresponding path program 1 times [2025-02-05 21:58:13,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:13,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299196732] [2025-02-05 21:58:13,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:13,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-02-05 21:58:13,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-02-05 21:58:13,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:13,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:58:13,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:13,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299196732] [2025-02-05 21:58:13,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299196732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:13,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:13,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:13,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416667670] [2025-02-05 21:58:13,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:13,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:13,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:13,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:13,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:13,425 INFO L87 Difference]: Start difference. First operand 1774 states and 3016 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:13,519 INFO L93 Difference]: Finished difference Result 3552 states and 6034 transitions. [2025-02-05 21:58:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:13,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2025-02-05 21:58:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:13,529 INFO L225 Difference]: With dead ends: 3552 [2025-02-05 21:58:13,530 INFO L226 Difference]: Without dead ends: 1781 [2025-02-05 21:58:13,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:13,534 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 327 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:13,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1344 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:58:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-02-05 21:58:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1350. [2025-02-05 21:58:13,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1132 states have (on average 1.6793286219081272) internal successors, (1901), 1135 states have internal predecessors, (1901), 212 states have call successors, (212), 5 states have call predecessors, (212), 5 states have return successors, (212), 209 states have call predecessors, (212), 212 states have call successors, (212) [2025-02-05 21:58:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2325 transitions. [2025-02-05 21:58:13,613 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2325 transitions. Word has length 706 [2025-02-05 21:58:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:13,614 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 2325 transitions. [2025-02-05 21:58:13,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2325 transitions. [2025-02-05 21:58:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-02-05 21:58:13,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:13,619 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:13,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:58:13,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:13,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1281859860, now seen corresponding path program 1 times [2025-02-05 21:58:13,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:13,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67459625] [2025-02-05 21:58:13,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:13,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-02-05 21:58:13,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-02-05 21:58:13,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:13,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:58:13,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:13,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67459625] [2025-02-05 21:58:13,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67459625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:13,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:13,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:58:13,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582929040] [2025-02-05 21:58:13,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:13,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:58:13,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:13,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:58:13,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:58:13,934 INFO L87 Difference]: Start difference. First operand 1350 states and 2325 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:14,282 INFO L93 Difference]: Finished difference Result 3689 states and 6334 transitions. [2025-02-05 21:58:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:58:14,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2025-02-05 21:58:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:14,293 INFO L225 Difference]: With dead ends: 3689 [2025-02-05 21:58:14,293 INFO L226 Difference]: Without dead ends: 2342 [2025-02-05 21:58:14,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:58:14,296 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 662 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:14,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 2002 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:58:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2025-02-05 21:58:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2332. [2025-02-05 21:58:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 1948 states have (on average 1.673511293634497) internal successors, (3260), 1957 states have internal predecessors, (3260), 370 states have call successors, (370), 13 states have call predecessors, (370), 13 states have return successors, (370), 361 states have call predecessors, (370), 370 states have call successors, (370) [2025-02-05 21:58:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 4000 transitions. [2025-02-05 21:58:14,377 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 4000 transitions. Word has length 706 [2025-02-05 21:58:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:14,378 INFO L471 AbstractCegarLoop]: Abstraction has 2332 states and 4000 transitions. [2025-02-05 21:58:14,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 4000 transitions. [2025-02-05 21:58:14,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-02-05 21:58:14,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:14,384 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:14,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:58:14,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:14,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:14,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1560393394, now seen corresponding path program 1 times [2025-02-05 21:58:14,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226346652] [2025-02-05 21:58:14,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:14,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:14,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-02-05 21:58:14,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-02-05 21:58:14,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:14,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:58:14,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:14,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226346652] [2025-02-05 21:58:14,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226346652] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:14,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:14,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:58:14,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393616964] [2025-02-05 21:58:14,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:14,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:58:14,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:14,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:58:14,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:58:14,834 INFO L87 Difference]: Start difference. First operand 2332 states and 4000 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:15,430 INFO L93 Difference]: Finished difference Result 11362 states and 19488 transitions. [2025-02-05 21:58:15,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:58:15,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 707 [2025-02-05 21:58:15,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:15,473 INFO L225 Difference]: With dead ends: 11362 [2025-02-05 21:58:15,473 INFO L226 Difference]: Without dead ends: 9033 [2025-02-05 21:58:15,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:58:15,483 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1361 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:15,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 1928 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:58:15,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9033 states. [2025-02-05 21:58:15,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9033 to 9025. [2025-02-05 21:58:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9025 states, 7604 states have (on average 1.6604418726985797) internal successors, (12626), 7642 states have internal predecessors, (12626), 1370 states have call successors, (1370), 50 states have call predecessors, (1370), 50 states have return successors, (1370), 1332 states have call predecessors, (1370), 1370 states have call successors, (1370) [2025-02-05 21:58:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9025 states to 9025 states and 15366 transitions. [2025-02-05 21:58:15,868 INFO L78 Accepts]: Start accepts. Automaton has 9025 states and 15366 transitions. Word has length 707 [2025-02-05 21:58:15,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:15,869 INFO L471 AbstractCegarLoop]: Abstraction has 9025 states and 15366 transitions. [2025-02-05 21:58:15,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 9025 states and 15366 transitions. [2025-02-05 21:58:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-02-05 21:58:15,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:15,882 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:15,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:58:15,882 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:15,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:15,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1230627633, now seen corresponding path program 1 times [2025-02-05 21:58:15,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:15,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303744702] [2025-02-05 21:58:15,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:15,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:15,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-02-05 21:58:16,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-02-05 21:58:16,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:16,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 117 proven. 210 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-02-05 21:58:16,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303744702] [2025-02-05 21:58:16,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303744702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:58:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246969742] [2025-02-05 21:58:16,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:16,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:16,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:16,614 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 21:58:16,617 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 21:58:16,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-02-05 21:58:16,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-02-05 21:58:16,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:16,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:16,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:58:16,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:58:17,692 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11107 proven. 210 refuted. 0 times theorem prover too weak. 12663 trivial. 0 not checked. [2025-02-05 21:58:17,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:58:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 117 proven. 210 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-02-05 21:58:18,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246969742] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:58:18,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:58:18,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 21:58:18,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680153696] [2025-02-05 21:58:18,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:58:18,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:58:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:18,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:58:18,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:58:18,238 INFO L87 Difference]: Start difference. First operand 9025 states and 15366 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2025-02-05 21:58:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:18,997 INFO L93 Difference]: Finished difference Result 18171 states and 30849 transitions. [2025-02-05 21:58:18,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:58:18,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) Word has length 707 [2025-02-05 21:58:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:19,032 INFO L225 Difference]: With dead ends: 18171 [2025-02-05 21:58:19,032 INFO L226 Difference]: Without dead ends: 9149 [2025-02-05 21:58:19,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1421 GetRequests, 1411 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:58:19,047 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 779 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:19,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1066 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:58:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9149 states. [2025-02-05 21:58:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9149 to 9041. [2025-02-05 21:58:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9041 states, 7616 states have (on average 1.633140756302521) internal successors, (12438), 7654 states have internal predecessors, (12438), 1370 states have call successors, (1370), 54 states have call predecessors, (1370), 54 states have return successors, (1370), 1332 states have call predecessors, (1370), 1370 states have call successors, (1370) [2025-02-05 21:58:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9041 states to 9041 states and 15178 transitions. [2025-02-05 21:58:19,531 INFO L78 Accepts]: Start accepts. Automaton has 9041 states and 15178 transitions. Word has length 707 [2025-02-05 21:58:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:19,533 INFO L471 AbstractCegarLoop]: Abstraction has 9041 states and 15178 transitions. [2025-02-05 21:58:19,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2025-02-05 21:58:19,533 INFO L276 IsEmpty]: Start isEmpty. Operand 9041 states and 15178 transitions. [2025-02-05 21:58:19,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-02-05 21:58:19,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:19,554 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:19,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 21:58:19,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:19,758 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:19,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:19,758 INFO L85 PathProgramCache]: Analyzing trace with hash -952394931, now seen corresponding path program 1 times [2025-02-05 21:58:19,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:19,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339455201] [2025-02-05 21:58:19,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:19,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:19,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-02-05 21:58:20,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-02-05 21:58:20,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:20,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:20,412 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 264 proven. 63 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-02-05 21:58:20,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:20,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339455201] [2025-02-05 21:58:20,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339455201] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:58:20,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028536968] [2025-02-05 21:58:20,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:20,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:20,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:20,415 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 21:58:20,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 21:58:20,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-02-05 21:58:20,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-02-05 21:58:20,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:20,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:20,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:58:20,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:58:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 7677 proven. 63 refuted. 0 times theorem prover too weak. 16240 trivial. 0 not checked. [2025-02-05 21:58:20,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:58:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 264 proven. 63 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-02-05 21:58:21,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028536968] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:58:21,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:58:21,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-05 21:58:21,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821982339] [2025-02-05 21:58:21,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:58:21,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:58:21,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:21,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:58:21,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:58:21,402 INFO L87 Difference]: Start difference. First operand 9041 states and 15178 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) [2025-02-05 21:58:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:22,100 INFO L93 Difference]: Finished difference Result 16535 states and 27563 transitions. [2025-02-05 21:58:22,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:58:22,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) Word has length 707 [2025-02-05 21:58:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:22,140 INFO L225 Difference]: With dead ends: 16535 [2025-02-05 21:58:22,140 INFO L226 Difference]: Without dead ends: 7497 [2025-02-05 21:58:22,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1420 GetRequests, 1411 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:58:22,158 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 362 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:22,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1057 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:58:22,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7497 states. [2025-02-05 21:58:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7497 to 7389. [2025-02-05 21:58:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7389 states, 5962 states have (on average 1.5934250251593425) internal successors, (9500), 6000 states have internal predecessors, (9500), 1370 states have call successors, (1370), 56 states have call predecessors, (1370), 56 states have return successors, (1370), 1332 states have call predecessors, (1370), 1370 states have call successors, (1370) [2025-02-05 21:58:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 12240 transitions. [2025-02-05 21:58:22,455 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 12240 transitions. Word has length 707 [2025-02-05 21:58:22,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:22,456 INFO L471 AbstractCegarLoop]: Abstraction has 7389 states and 12240 transitions. [2025-02-05 21:58:22,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) [2025-02-05 21:58:22,456 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 12240 transitions. [2025-02-05 21:58:22,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-02-05 21:58:22,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:22,466 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:22,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 21:58:22,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 21:58:22,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:22,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:22,668 INFO L85 PathProgramCache]: Analyzing trace with hash 472648617, now seen corresponding path program 1 times [2025-02-05 21:58:22,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:22,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25443612] [2025-02-05 21:58:22,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:22,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:22,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-02-05 21:58:22,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-02-05 21:58:22,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:22,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 213 proven. 114 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-02-05 21:58:23,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25443612] [2025-02-05 21:58:23,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25443612] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:58:23,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100028476] [2025-02-05 21:58:23,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:23,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:23,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:23,319 INFO L229 MonitoredProcess]: Starting monitored process 6 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 21:58:23,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 21:58:23,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-02-05 21:58:23,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-02-05 21:58:23,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:23,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:23,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:58:23,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:58:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11811 proven. 114 refuted. 0 times theorem prover too weak. 12055 trivial. 0 not checked. [2025-02-05 21:58:24,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:58:24,927 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 213 proven. 114 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-02-05 21:58:24,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100028476] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:58:24,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:58:24,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-05 21:58:24,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439254527] [2025-02-05 21:58:24,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:58:24,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 21:58:24,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:24,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 21:58:24,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:58:24,932 INFO L87 Difference]: Start difference. First operand 7389 states and 12240 transitions. Second operand has 11 states, 11 states have (on average 30.454545454545453) internal successors, (335), 11 states have internal predecessors, (335), 6 states have call successors, (186), 3 states have call predecessors, (186), 5 states have return successors, (187), 6 states have call predecessors, (187), 6 states have call successors, (187) [2025-02-05 21:58:25,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:25,784 INFO L93 Difference]: Finished difference Result 14899 states and 24597 transitions. [2025-02-05 21:58:25,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 21:58:25,784 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 30.454545454545453) internal successors, (335), 11 states have internal predecessors, (335), 6 states have call successors, (186), 3 states have call predecessors, (186), 5 states have return successors, (187), 6 states have call predecessors, (187), 6 states have call successors, (187) Word has length 709 [2025-02-05 21:58:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:25,814 INFO L225 Difference]: With dead ends: 14899 [2025-02-05 21:58:25,815 INFO L226 Difference]: Without dead ends: 7513 [2025-02-05 21:58:25,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1427 GetRequests, 1413 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:58:25,832 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 317 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:25,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1030 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:58:25,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2025-02-05 21:58:26,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 7405. [2025-02-05 21:58:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7405 states, 5974 states have (on average 1.585537328423167) internal successors, (9472), 6012 states have internal predecessors, (9472), 1370 states have call successors, (1370), 60 states have call predecessors, (1370), 60 states have return successors, (1370), 1332 states have call predecessors, (1370), 1370 states have call successors, (1370) [2025-02-05 21:58:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7405 states to 7405 states and 12212 transitions. [2025-02-05 21:58:26,226 INFO L78 Accepts]: Start accepts. Automaton has 7405 states and 12212 transitions. Word has length 709 [2025-02-05 21:58:26,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:26,227 INFO L471 AbstractCegarLoop]: Abstraction has 7405 states and 12212 transitions. [2025-02-05 21:58:26,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 30.454545454545453) internal successors, (335), 11 states have internal predecessors, (335), 6 states have call successors, (186), 3 states have call predecessors, (186), 5 states have return successors, (187), 6 states have call predecessors, (187), 6 states have call successors, (187) [2025-02-05 21:58:26,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7405 states and 12212 transitions. [2025-02-05 21:58:26,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-02-05 21:58:26,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:26,237 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:26,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 21:58:26,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 21:58:26,438 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:26,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1537455224, now seen corresponding path program 1 times [2025-02-05 21:58:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:26,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347549601] [2025-02-05 21:58:26,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:26,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-02-05 21:58:26,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-02-05 21:58:26,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:26,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:58:26,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198619680] [2025-02-05 21:58:26,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:26,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:26,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:26,917 INFO L229 MonitoredProcess]: Starting monitored process 7 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 21:58:26,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 21:58:27,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-02-05 21:58:27,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-02-05 21:58:27,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:27,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:27,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:58:27,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:58:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:58:27,948 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:58:27,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:27,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347549601] [2025-02-05 21:58:27,949 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:58:27,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198619680] [2025-02-05 21:58:27,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198619680] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:27,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:27,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:58:27,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777970509] [2025-02-05 21:58:27,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:27,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:58:27,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:27,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:58:27,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:58:27,953 INFO L87 Difference]: Start difference. First operand 7405 states and 12212 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:29,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:29,205 INFO L93 Difference]: Finished difference Result 26495 states and 43575 transitions. [2025-02-05 21:58:29,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:58:29,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 709 [2025-02-05 21:58:29,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:29,266 INFO L225 Difference]: With dead ends: 26495 [2025-02-05 21:58:29,266 INFO L226 Difference]: Without dead ends: 19093 [2025-02-05 21:58:29,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:58:29,349 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 720 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:29,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 2163 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:58:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19093 states. [2025-02-05 21:58:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19093 to 17959. [2025-02-05 21:58:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17959 states, 14364 states have (on average 1.5789473684210527) internal successors, (22680), 14456 states have internal predecessors, (22680), 3434 states have call successors, (3434), 160 states have call predecessors, (3434), 160 states have return successors, (3434), 3342 states have call predecessors, (3434), 3434 states have call successors, (3434) [2025-02-05 21:58:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17959 states to 17959 states and 29548 transitions. [2025-02-05 21:58:30,358 INFO L78 Accepts]: Start accepts. Automaton has 17959 states and 29548 transitions. Word has length 709 [2025-02-05 21:58:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:30,359 INFO L471 AbstractCegarLoop]: Abstraction has 17959 states and 29548 transitions. [2025-02-05 21:58:30,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 17959 states and 29548 transitions. [2025-02-05 21:58:30,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-02-05 21:58:30,379 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:30,379 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:30,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 21:58:30,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 21:58:30,581 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 245495853, now seen corresponding path program 1 times [2025-02-05 21:58:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:30,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757968302] [2025-02-05 21:58:30,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:30,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:30,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-02-05 21:58:30,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-02-05 21:58:30,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:30,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:31,152 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:58:31,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:31,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757968302] [2025-02-05 21:58:31,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757968302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:31,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:31,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:58:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46956176] [2025-02-05 21:58:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:58:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:31,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:58:31,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:31,154 INFO L87 Difference]: Start difference. First operand 17959 states and 29548 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:32,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:32,154 INFO L93 Difference]: Finished difference Result 47139 states and 77394 transitions. [2025-02-05 21:58:32,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:58:32,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 710 [2025-02-05 21:58:32,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:32,248 INFO L225 Difference]: With dead ends: 47139 [2025-02-05 21:58:32,248 INFO L226 Difference]: Without dead ends: 29183 [2025-02-05 21:58:32,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:58:32,278 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 357 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:32,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1285 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:58:32,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29183 states. [2025-02-05 21:58:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29183 to 29173. [2025-02-05 21:58:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29173 states, 23024 states have (on average 1.5601111883252259) internal successors, (35920), 23168 states have internal predecessors, (35920), 5868 states have call successors, (5868), 280 states have call predecessors, (5868), 280 states have return successors, (5868), 5724 states have call predecessors, (5868), 5868 states have call successors, (5868) [2025-02-05 21:58:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29173 states to 29173 states and 47656 transitions. [2025-02-05 21:58:34,203 INFO L78 Accepts]: Start accepts. Automaton has 29173 states and 47656 transitions. Word has length 710 [2025-02-05 21:58:34,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:34,204 INFO L471 AbstractCegarLoop]: Abstraction has 29173 states and 47656 transitions. [2025-02-05 21:58:34,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:34,205 INFO L276 IsEmpty]: Start isEmpty. Operand 29173 states and 47656 transitions. [2025-02-05 21:58:34,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-02-05 21:58:34,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:34,226 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:34,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:58:34,226 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:34,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:34,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1555048857, now seen corresponding path program 1 times [2025-02-05 21:58:34,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:34,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620634453] [2025-02-05 21:58:34,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:34,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:34,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-02-05 21:58:34,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-02-05 21:58:34,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:34,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:34,636 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-02-05 21:58:34,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:58:34,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620634453] [2025-02-05 21:58:34,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620634453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:58:34,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:58:34,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:58:34,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177277505] [2025-02-05 21:58:34,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:58:34,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:58:34,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:58:34,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:58:34,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:58:34,638 INFO L87 Difference]: Start difference. First operand 29173 states and 47656 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:58:36,972 INFO L93 Difference]: Finished difference Result 70289 states and 115055 transitions. [2025-02-05 21:58:36,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:58:36,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 710 [2025-02-05 21:58:36,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:58:37,136 INFO L225 Difference]: With dead ends: 70289 [2025-02-05 21:58:37,137 INFO L226 Difference]: Without dead ends: 52333 [2025-02-05 21:58:37,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:58:37,172 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 781 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:58:37,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 2759 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:58:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52333 states. [2025-02-05 21:58:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52333 to 25945. [2025-02-05 21:58:39,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25945 states, 20452 states have (on average 1.5558380598474477) internal successors, (31820), 20572 states have internal predecessors, (31820), 5236 states have call successors, (5236), 256 states have call predecessors, (5236), 256 states have return successors, (5236), 5116 states have call predecessors, (5236), 5236 states have call successors, (5236) [2025-02-05 21:58:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25945 states to 25945 states and 42292 transitions. [2025-02-05 21:58:39,262 INFO L78 Accepts]: Start accepts. Automaton has 25945 states and 42292 transitions. Word has length 710 [2025-02-05 21:58:39,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:58:39,263 INFO L471 AbstractCegarLoop]: Abstraction has 25945 states and 42292 transitions. [2025-02-05 21:58:39,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-02-05 21:58:39,264 INFO L276 IsEmpty]: Start isEmpty. Operand 25945 states and 42292 transitions. [2025-02-05 21:58:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-02-05 21:58:39,284 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:58:39,285 INFO L218 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:58:39,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:58:39,285 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:58:39,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:58:39,286 INFO L85 PathProgramCache]: Analyzing trace with hash 605067787, now seen corresponding path program 1 times [2025-02-05 21:58:39,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:58:39,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204888934] [2025-02-05 21:58:39,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:39,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:58:39,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-02-05 21:58:40,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-02-05 21:58:40,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:40,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:58:40,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482228928] [2025-02-05 21:58:40,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:58:40,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:58:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:58:40,610 INFO L229 MonitoredProcess]: Starting monitored process 8 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 21:58:40,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 21:58:40,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-02-05 21:58:41,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-02-05 21:58:41,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:58:41,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:58:41,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 21:58:41,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:58:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 13440 proven. 255 refuted. 0 times theorem prover too weak. 10285 trivial. 0 not checked. [2025-02-05 21:58:43,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:58:55,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_66~0 256))) (let ((.cse175 (+ c_~var_1_65~0 1)) (.cse36 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 2)) (.cse5 (mod c_~var_1_73~0 65536)) (.cse15 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 1)) (.cse6 (* (- 1) .cse3))) (let ((.cse11 (forall ((v_z_3 Int)) (let ((.cse217 (+ .cse6 v_z_3))) (let ((.cse218 (div .cse217 c_~var_1_65~0))) (or (< (div .cse217 .cse5) .cse15) (< v_z_3 0) (= .cse218 .cse15) (< 8 v_z_3) (< .cse218 .cse15)))))) (.cse1 (forall ((v_z_3 Int)) (let ((.cse216 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse216 .cse5) 0) (< (div .cse216 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15)))) (.cse48 (forall ((v_z_3 Int)) (let ((.cse215 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse215 .cse5) 0) (< (div .cse215 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse215 c_~var_1_65~0) .cse15))))) (.cse16 (forall ((v_z_3 Int)) (let ((.cse214 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse214 c_~var_1_65~0))) (< v_z_3 0) (< 8 v_z_3) (< (div .cse214 c_~var_1_65~0) .cse15))))) (.cse29 (forall ((v_z_3 Int)) (let ((.cse213 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse213 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse213 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse213 c_~var_1_65~0) .cse15))))) (.cse56 (forall ((v_z_3 Int)) (let ((.cse211 (+ .cse6 v_z_3))) (let ((.cse212 (div .cse211 c_~var_1_65~0))) (or (not (= 0 (mod .cse211 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse211 .cse5) 0) (< v_z_3 0) (= .cse212 .cse15) (< 8 v_z_3) (< .cse212 .cse15)))))) (.cse99 (forall ((v_z_3 Int)) (let ((.cse209 (+ .cse6 v_z_3))) (let ((.cse210 (div .cse209 c_~var_1_65~0))) (or (not (= 0 (mod .cse209 c_~var_1_65~0))) (< (div .cse209 .cse5) .cse15) (= (mod .cse209 .cse5) 0) (< v_z_3 0) (= .cse210 .cse15) (< 8 v_z_3) (< .cse210 .cse15)))))) (.cse23 (forall ((v_z_3 Int)) (let ((.cse207 (+ .cse6 v_z_3))) (let ((.cse208 (div .cse207 c_~var_1_65~0))) (or (not (= 0 (mod .cse207 c_~var_1_65~0))) (= (mod .cse207 .cse5) 0) (< v_z_3 0) (= .cse208 .cse15) (< 8 v_z_3) (< .cse208 .cse15)))))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse206 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse206 c_~var_1_65~0))) (not (= (mod .cse206 .cse5) 0)) (< (div .cse206 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse205 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse205 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse205 c_~var_1_65~0)))))) (.cse74 (forall ((v_z_3 Int)) (let ((.cse204 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (not (= (mod .cse204 .cse5) 0)) (< (div .cse204 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse204 c_~var_1_65~0)))))) (.cse61 (forall ((v_z_3 Int)) (let ((.cse203 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse203 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse203 .cse5) 0) (< (div .cse203 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse94 (forall ((v_z_3 Int)) (let ((.cse202 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse202 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse202 .cse5) 0) (< (div .cse202 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) (.cse97 (forall ((v_z_3 Int)) (let ((.cse200 (+ .cse6 v_z_3))) (let ((.cse201 (div .cse200 .cse5))) (or (not (= 0 (mod .cse200 c_~var_1_65~0))) (< .cse201 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse201) (< 8 v_z_3)))))) (.cse120 (forall ((v_z_3 Int)) (let ((.cse198 (+ .cse6 v_z_3))) (let ((.cse199 (div .cse198 .cse5))) (or (not (= 0 (mod .cse198 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse198 .cse5) 0) (< .cse199 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse199) (< 8 v_z_3) (< (div .cse198 c_~var_1_65~0) .cse15)))))) (.cse90 (forall ((v_z_3 Int)) (let ((.cse196 (+ .cse6 v_z_3))) (let ((.cse197 (div .cse196 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse196 .cse5) 0) (= .cse197 .cse15) (< 8 v_z_3) (< .cse197 .cse15)))))) (.cse26 (forall ((v_z_3 Int)) (let ((.cse194 (+ .cse6 v_z_3))) (let ((.cse195 (div .cse194 c_~var_1_65~0))) (or (= (mod .cse194 .cse5) 0) (< v_z_3 0) (= .cse195 .cse15) (< 8 v_z_3) (< .cse195 .cse15)))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse192 (+ .cse6 v_z_3))) (let ((.cse193 (div .cse192 c_~var_1_65~0))) (or (< (div .cse192 .cse5) .cse15) (= (mod .cse192 .cse5) 0) (< v_z_3 0) (= .cse193 .cse15) (< 8 v_z_3) (< .cse193 .cse15)))))) (.cse54 (forall ((v_z_3 Int)) (let ((.cse191 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse191 .cse5) 0) (< (div .cse191 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse191 c_~var_1_65~0)))))) (.cse133 (forall ((v_z_3 Int)) (let ((.cse189 (+ .cse6 v_z_3))) (let ((.cse190 (div .cse189 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse189 .cse5) 0) (< (div .cse189 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse190 .cse15) (< 8 v_z_3) (< .cse190 .cse15)))))) (.cse27 (forall ((v_z_3 Int)) (let ((.cse187 (+ .cse6 v_z_3))) (let ((.cse188 (div .cse187 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse187 .cse5) 0) (< v_z_3 0) (= .cse188 .cse15) (< 8 v_z_3) (< .cse188 .cse15)))))) (.cse79 (forall ((v_z_3 Int)) (let ((.cse186 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse186 c_~var_1_65~0))) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse186 c_~var_1_65~0) .cse15))))) (.cse10 (forall ((v_z_3 Int)) (let ((.cse185 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< v_z_3 0) (= .cse185 .cse15) (< 8 v_z_3) (< .cse185 .cse15))))) (.cse107 (forall ((v_z_3 Int)) (let ((.cse184 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse184 c_~var_1_65~0))) (not (= (mod .cse184 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse184 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse108 (forall ((v_z_3 Int)) (let ((.cse183 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse183 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse183 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse89 (forall ((v_z_3 Int)) (let ((.cse181 (+ .cse6 v_z_3))) (let ((.cse182 (div .cse181 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse181 .cse5) 0) (< .cse182 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse182) (< 8 v_z_3) (< (div .cse181 c_~var_1_65~0) .cse15)))))) (.cse98 (forall ((v_z_3 Int)) (let ((.cse180 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse180 c_~var_1_65~0))) (not (= (mod .cse180 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse180 c_~var_1_65~0) .cse15))))) (.cse30 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (.cse34 (forall ((v_z_3 Int)) (let ((.cse179 (+ .cse6 v_z_3))) (or (not (= (mod .cse179 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse179 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse21 (< c_~var_1_65~0 .cse5)) (.cse37 (forall ((v_z_3 Int)) (let ((.cse178 (+ .cse6 v_z_3))) (or (< (div .cse178 .cse5) .cse15) (not (= (mod .cse178 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse178 c_~var_1_65~0) .cse15))))) (.cse159 (forall ((v_z_3 Int)) (let ((.cse177 (+ .cse6 v_z_3))) (or (not (= (mod .cse177 .cse5) 0)) (< (div .cse177 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse0 (< .cse5 .cse175)) (.cse49 (forall ((v_z_3 Int)) (let ((.cse176 (+ .cse6 v_z_3))) (or (< (div .cse176 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse176 .cse5) 0) (< 8 v_z_3) (< (div .cse176 c_~var_1_65~0) .cse15))))) (.cse7 (< c_~var_1_65~0 0)) (.cse9 (< 0 .cse175)) (.cse8 (forall ((v_z_3 Int)) (let ((.cse173 (+ .cse6 v_z_3))) (let ((.cse174 (div .cse173 c_~var_1_65~0))) (or (not (= 0 (mod .cse173 c_~var_1_65~0))) (< v_z_3 0) (= .cse174 .cse15) (< 8 v_z_3) (< .cse174 .cse15)))))) (.cse102 (forall ((v_z_3 Int)) (let ((.cse171 (+ .cse6 v_z_3))) (let ((.cse172 (div .cse171 c_~var_1_65~0))) (or (not (= 0 (mod .cse171 c_~var_1_65~0))) (< (div .cse171 .cse5) .cse15) (< v_z_3 0) (= .cse172 .cse15) (< 8 v_z_3) (< .cse172 .cse15))))))) (and (or .cse0 (and .cse1 (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse6 v_z_3))) (let ((.cse2 (div .cse4 c_~var_1_65~0))) (or (< .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse4 .cse5) 0) (= .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse0 .cse8) (or .cse9 (and .cse10 .cse11)) (forall ((v_z_3 Int)) (let ((.cse12 (+ .cse6 v_z_3))) (let ((.cse13 (div .cse12 .cse5)) (.cse14 (div .cse12 c_~var_1_65~0))) (or (= (mod .cse12 .cse5) 0) (< .cse13 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse13) (= .cse14 .cse15) (< 8 v_z_3) (< .cse14 .cse15))))) (or .cse0 .cse16) (forall ((v_z_3 Int)) (let ((.cse17 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse17 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse17 .cse5) 0) (< (div .cse17 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse17 c_~var_1_65~0) .cse15)))) (or .cse18 .cse9) (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse6 v_z_3))) (let ((.cse20 (div .cse19 c_~var_1_65~0))) (or (not (= (mod .cse19 .cse5) 0)) (< v_z_3 0) (= .cse20 .cse15) (< 8 v_z_3) (< .cse20 .cse15))))) .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse22 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse22 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse22 c_~var_1_65~0)))))) (or .cse23 .cse0) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse6 v_z_3))) (let ((.cse25 (div .cse24 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse24 .cse5) .cse15) (= (mod .cse24 .cse5) 0) (< v_z_3 0) (= .cse25 .cse15) (< 8 v_z_3) (< .cse25 .cse15))))) .cse10 .cse26 .cse27 .cse28 .cse11)) (or .cse1 .cse9) (or (and .cse29 .cse16) .cse9) (or (and .cse30 (or (forall ((v_z_3 Int)) (let ((.cse31 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3)))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse6 v_z_3))) (let ((.cse32 (div .cse33 c_~var_1_65~0))) (or (< .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse33 .cse5) 0)) (< v_z_3 .cse3) (= .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse34) .cse0) (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (< (div .cse35 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse35 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or .cse37 .cse7) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse38 (+ .cse6 v_z_3))) (let ((.cse39 (div .cse38 c_~var_1_65~0))) (or (not (= 0 (mod .cse38 c_~var_1_65~0))) (< (div .cse38 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse39 .cse15) (< 8 v_z_3) (< .cse39 .cse15)))))) (forall ((v_z_3 Int)) (let ((.cse40 (+ .cse6 v_z_3))) (let ((.cse41 (div .cse40 .cse5)) (.cse42 (div .cse40 c_~var_1_65~0))) (or (not (= 0 (mod .cse40 c_~var_1_65~0))) (< .cse41 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse41) (= .cse42 .cse15) (< 8 v_z_3) (< .cse42 .cse15))))) (or .cse9 .cse43) (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse44 c_~var_1_65~0))) (< (div .cse44 .cse5) .cse15) (not (= (mod .cse44 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 c_~var_1_65~0) .cse15)))) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse6 v_z_3))) (let ((.cse46 (div .cse45 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse45 .cse5) 0) (< (div .cse45 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse46 .cse15) (< 8 v_z_3) (< .cse46 .cse15))))) (or (and (or .cse0 (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse47 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse47 c_~var_1_65~0) .cse15))))) .cse48) .cse7) (or (and .cse49 (or .cse0 (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse50 .cse5) 0) (< 8 v_z_3) (< (div .cse50 c_~var_1_65~0) .cse15)))))) .cse7) (or .cse18 .cse0) (or .cse21 .cse48) (forall ((v_z_3 Int)) (let ((.cse51 (+ .cse6 v_z_3))) (let ((.cse52 (div .cse51 .cse5)) (.cse53 (div .cse51 c_~var_1_65~0))) (or (not (= 0 (mod .cse51 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse51 .cse5) 0) (< .cse52 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse52) (= .cse53 .cse15) (< 8 v_z_3) (< .cse53 .cse15))))) (or (and .cse54 (or (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse6 v_z_3))) (or (< (div .cse55 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse55 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse55 c_~var_1_65~0))))) .cse7)) .cse0) (or .cse56 .cse0) (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse6 v_z_3))) (let ((.cse58 (div .cse57 .cse5)) (.cse59 (div .cse57 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse57 .cse5) 0) (< .cse58 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse58) (= .cse59 .cse15) (< 8 v_z_3) (< .cse59 .cse15))))) (or (and (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse60 c_~var_1_65~0))) (< (div .cse60 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse60 .cse5) 0) (< (div .cse60 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse61) .cse9) (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse6 v_z_3))) (let ((.cse63 (div .cse62 c_~var_1_65~0))) (or (not (= 0 (mod .cse62 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse62 .cse5) 0) (< (div .cse62 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse63 .cse15) (< 8 v_z_3) (< .cse63 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse6 v_z_3))) (let ((.cse65 (div .cse64 c_~var_1_65~0))) (or (not (= 0 (mod .cse64 c_~var_1_65~0))) (< (div .cse64 .cse5) .cse15) (not (= (mod .cse64 .cse5) 0)) (< v_z_3 0) (= .cse65 .cse15) (< 8 v_z_3) (< .cse65 .cse15))))) (or .cse9 .cse16) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse6 v_z_3))) (let ((.cse67 (div .cse66 .cse5))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse66 .cse5) 0) (< .cse67 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse67) (< 8 v_z_3)))))) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse6 v_z_3))) (let ((.cse69 (div .cse68 c_~var_1_65~0))) (or (< (div .cse68 .cse5) .cse15) (not (= (mod .cse68 .cse5) 0)) (< v_z_3 0) (= .cse69 .cse15) (< 8 v_z_3) (< .cse69 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse6 v_z_3))) (or (< (div .cse70 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse70 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse6 v_z_3))) (or (< (div .cse71 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse71 .cse5) 0) (< (div .cse71 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or (and .cse72 (or (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse6 v_z_3))) (or (< (div .cse73 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (not (= (mod .cse73 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse73 c_~var_1_65~0))))) .cse7) .cse74 (or (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse6 v_z_3))) (or (< (div .cse75 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse75 c_~var_1_65~0))))) .cse7)) .cse0) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse6 v_z_3))) (let ((.cse76 (div .cse78 .cse5)) (.cse77 (div .cse78 c_~var_1_65~0))) (or (< .cse76 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse76) (= .cse77 .cse15) (< 8 v_z_3) (< .cse77 .cse15))))) (or .cse29 .cse0) (or .cse79 .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse6 v_z_3))) (let ((.cse81 (div .cse80 .cse5))) (or (not (= 0 (mod .cse80 c_~var_1_65~0))) (= (mod .cse80 .cse5) 0) (< .cse81 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse81) (< 8 v_z_3) (< (div .cse80 c_~var_1_65~0) .cse15)))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse6 v_z_3))) (let ((.cse83 (div .cse82 .cse5))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (< .cse83 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse83) (< 8 v_z_3) (< (div .cse82 c_~var_1_65~0) .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse6 v_z_3))) (or (< (div .cse84 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< (div .cse84 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse85 c_~var_1_65~0))) (< (div .cse85 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3)))) .cse21) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse6 v_z_3))) (or (< (div .cse86 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse86 .cse5) 0) (< 8 v_z_3))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse6 v_z_3))) (let ((.cse87 (div .cse88 .cse5))) (or (< .cse87 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse87) (< 8 v_z_3) (< (div .cse88 c_~var_1_65~0) .cse15)))))) (or .cse21 .cse89) (or .cse56 .cse9) (or .cse0 .cse26) (or .cse90 .cse0) (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse6 v_z_3))) (let ((.cse92 (div .cse91 .cse5)) (.cse93 (div .cse91 c_~var_1_65~0))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (= (mod .cse91 .cse5) 0) (< .cse92 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse92) (= .cse93 .cse15) (< 8 v_z_3) (< .cse93 .cse15))))) (or .cse21 (and .cse94 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse6 v_z_3))) (let ((.cse96 (div .cse95 .cse5))) (or (not (= 0 (mod .cse95 c_~var_1_65~0))) (= (mod .cse95 .cse5) 0) (< .cse96 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse96) (< 8 v_z_3))))) .cse97)) (or .cse9 .cse98) (or (and .cse99 .cse23) .cse9) (or (and (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse6 v_z_3))) (let ((.cse101 (div .cse100 c_~var_1_65~0))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (< (div .cse100 .cse5) .cse15) (= (mod .cse100 .cse5) 0) (< v_z_3 0) (= .cse101 .cse15) (< 8 v_z_3) (< .cse101 .cse15))))) .cse56 .cse99 .cse23 .cse8 .cse102) .cse9) (or (and .cse43 (or (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse6 v_z_3))) (let ((.cse104 (div .cse103 c_~var_1_65~0))) (or (not (= 0 (mod .cse103 c_~var_1_65~0))) (< .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse103 .cse5) 0)) (= .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse6 v_z_3))) (let ((.cse106 (div .cse105 c_~var_1_65~0))) (or (not (= 0 (mod .cse105 c_~var_1_65~0))) (< .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse105 .cse5) 0)) (< v_z_3 .cse3) (= .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse107 .cse108 (or (forall ((v_z_3 Int)) (let ((.cse109 (+ .cse6 v_z_3))) (let ((.cse110 (div .cse109 c_~var_1_65~0))) (or (not (= 0 (mod .cse109 c_~var_1_65~0))) (< .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7)) .cse0) (or (and .cse72 (forall ((v_z_3 Int)) (let ((.cse112 (+ .cse6 v_z_3))) (let ((.cse111 (div .cse112 .cse5))) (or (< .cse3 (+ v_z_3 1)) (< .cse111 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse112 c_~var_1_65~0) .cse36) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse111) (< 8 v_z_3) (= 0 (mod .cse112 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse113 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse113 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse113 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse113 c_~var_1_65~0))))) .cse74 (forall ((v_z_3 Int)) (let ((.cse114 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse114 .cse5) .cse15) (not (= (mod .cse114 .cse5) 0)) (< (div .cse114 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse114 c_~var_1_65~0)))))) .cse9) (or .cse0 (and .cse61 (or (forall ((v_z_3 Int)) (let ((.cse115 (+ .cse6 v_z_3))) (let ((.cse116 (div .cse115 c_~var_1_65~0))) (or (not (= 0 (mod .cse115 c_~var_1_65~0))) (< .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse115 .cse5) 0) (= .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse21 (and .cse94 .cse97)) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse117 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse117 c_~var_1_65~0))) (< (div .cse117 .cse5) .cse15) (not (= (mod .cse117 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3))))) (or (forall ((v_z_3 Int)) (or (< (div (+ .cse6 v_z_3) .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3))) .cse21) (or (forall ((v_z_3 Int)) (let ((.cse118 (+ .cse6 v_z_3))) (let ((.cse119 (div .cse118 c_~var_1_65~0))) (or (not (= 0 (mod .cse118 c_~var_1_65~0))) (not (= (mod .cse118 .cse5) 0)) (< v_z_3 0) (= .cse119 .cse15) (< 8 v_z_3) (< .cse119 .cse15))))) .cse0) (or .cse21 .cse120) (or .cse21 (and (forall ((v_z_3 Int)) (let ((.cse121 (+ .cse6 v_z_3))) (let ((.cse122 (div .cse121 .cse5))) (or (= (mod .cse121 .cse5) 0) (< .cse122 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse122) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse123 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse123 .cse5) 0) (< (div .cse123 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse124 (div (+ .cse6 v_z_3) .cse5))) (or (< .cse124 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse124) (< 8 v_z_3)))))) (or .cse120 .cse7) (or .cse9 (and .cse90 (forall ((v_z_3 Int)) (let ((.cse125 (+ .cse6 v_z_3))) (let ((.cse126 (div .cse125 c_~var_1_65~0))) (or (< (div .cse125 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse125 .cse5) 0) (= .cse126 .cse15) (< 8 v_z_3) (< .cse126 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse127 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse127 .cse5) .cse15) (< (div .cse127 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse127 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse128 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse128 .cse5) 0) (< (div .cse128 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse128 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse128 c_~var_1_65~0))))) (or (and .cse26 .cse28) .cse9) (or .cse0 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse129 (+ .cse6 v_z_3))) (let ((.cse130 (div .cse129 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse129 .cse5) 0) (< .cse130 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse130) (< 8 v_z_3)))))) (or (forall ((v_z_3 Int)) (let ((.cse131 (+ .cse6 v_z_3))) (let ((.cse132 (div .cse131 c_~var_1_65~0))) (or (not (= 0 (mod .cse131 c_~var_1_65~0))) (= (mod .cse131 .cse5) 0) (< (div .cse131 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse132 .cse15) (< 8 v_z_3) (< .cse132 .cse15))))) .cse0) (or .cse54 .cse9) (or .cse133 .cse0) (or (and .cse133 (or (forall ((v_z_3 Int)) (let ((.cse134 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse134 .cse5) 0) (< (div .cse134 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse134 c_~var_1_65~0) .cse15)))) .cse7)) .cse0) (or .cse9 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse135 (+ .cse6 v_z_3))) (let ((.cse136 (div .cse135 .cse5))) (or (= (mod .cse135 .cse5) 0) (< .cse136 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse136) (< 8 v_z_3) (< (div .cse135 c_~var_1_65~0) .cse15)))))) (or .cse9 .cse79) (or .cse10 .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse137 (+ .cse6 v_z_3))) (or (not (= (mod .cse137 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse137 c_~var_1_65~0) .cse15)))) .cse0) .cse37) .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< v_z_3 0) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15))) .cse0) (forall ((v_z_3 Int)) (let ((.cse138 (+ .cse6 v_z_3))) (or (< (div .cse138 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse138 c_~var_1_65~0) .cse15))))) .cse7) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse139 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse139 .cse5) 0) (< (div .cse139 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse139 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse140 (+ .cse6 v_z_3))) (or (< (div .cse140 .cse5) .cse15) (not (= (mod .cse140 .cse5) 0)) (< (div .cse140 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse141 (+ .cse6 v_z_3))) (let ((.cse142 (div .cse141 .cse5))) (or (not (= 0 (mod .cse141 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse141 .cse5) 0) (< .cse142 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse141 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse142) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse143 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse143 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse143 .cse5) 0) (< (div .cse143 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse143 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) .cse9) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse144 (+ .cse6 v_z_3))) (let ((.cse145 (div .cse144 c_~var_1_65~0))) (or (< (div .cse144 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse145 .cse15) (< 8 v_z_3) (< .cse145 .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse146 (+ .cse6 v_z_3))) (or (< (div .cse146 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse146 .cse5) 0) (< (div .cse146 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse146 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse147 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse147 c_~var_1_65~0))) (< (div .cse147 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse147 c_~var_1_65~0) .cse15)))) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse148 (+ .cse6 v_z_3))) (let ((.cse149 (div .cse148 .cse5))) (or (not (= 0 (mod .cse148 c_~var_1_65~0))) (< v_z_3 .cse3) (< .cse149 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse148 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse149) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse150 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse150 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse150 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse150 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse107 .cse108 (forall ((v_z_3 Int)) (let ((.cse151 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse151 c_~var_1_65~0))) (< (div .cse151 .cse5) .cse15) (not (= (mod .cse151 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse151 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse89 .cse7) (or (forall ((v_z_3 Int)) (let ((.cse152 (+ .cse6 v_z_3))) (or (< (div .cse152 .cse5) .cse15) (not (= (mod .cse152 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3)))) .cse21) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse153 (+ .cse6 v_z_3))) (let ((.cse154 (div .cse153 c_~var_1_65~0))) (or (= (mod .cse153 .cse5) 0) (< (div .cse153 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse154 .cse15) (< 8 v_z_3) (< .cse154 .cse15)))))) (or .cse0 (and (or (forall ((v_z_3 Int)) (let ((.cse155 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse155 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse155 .cse5) 0) (< (div .cse155 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse155 c_~var_1_65~0) .cse15)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse156 (+ .cse6 v_z_3))) (let ((.cse157 (div .cse156 c_~var_1_65~0))) (or (not (= 0 (mod .cse156 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse156 .cse5) 0) (< (div .cse156 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse157 .cse15) (< 8 v_z_3) (< .cse157 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse158 (+ .cse6 v_z_3))) (or (< (div .cse158 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse158 c_~var_1_65~0) .cse15)))) (or .cse159 .cse9) (forall ((v_z_3 Int)) (let ((.cse160 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse160 c_~var_1_65~0))) (< (div .cse160 .cse5) .cse15) (not (= (mod .cse160 .cse5) 0)) (< (div .cse160 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or .cse98 .cse0) (or .cse9 (and .cse30 (forall ((v_z_3 Int)) (let ((.cse161 (+ .cse6 v_z_3))) (or (< (div .cse161 .cse5) .cse15) (not (= (mod .cse161 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse161 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse163 (+ .cse6 v_z_3))) (let ((.cse162 (div .cse163 .cse5))) (or (< v_z_3 .cse3) (< .cse162 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse163 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse162) (< 8 v_z_3))))) .cse34 (forall ((v_z_3 Int)) (let ((.cse164 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (< (div .cse164 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse164 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse21 .cse37) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse165 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse165 .cse5) 0) (< (div .cse165 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse165 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse166 (+ .cse6 v_z_3))) (let ((.cse167 (div .cse166 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse166 .cse5) 0) (< .cse167 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse166 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse167) (< 8 v_z_3))))))) (or (and .cse159 (or (forall ((v_z_3 Int)) (let ((.cse169 (+ .cse6 v_z_3))) (let ((.cse168 (div .cse169 c_~var_1_65~0))) (or (< .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse169 .cse5) 0)) (= .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or .cse49 .cse7) (or .cse9 (and .cse8 .cse102)) (forall ((v_z_3 Int)) (let ((.cse170 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse170 c_~var_1_65~0))) (< (div .cse170 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse170 c_~var_1_65~0) .cse15)))))))) is different from false [2025-02-05 21:58:59,773 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_66~0 256))) (let ((.cse175 (+ c_~var_1_65~0 1)) (.cse36 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 2)) (.cse5 (mod c_~var_1_73~0 65536)) (.cse15 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 1)) (.cse6 (* (- 1) .cse3))) (let ((.cse11 (forall ((v_z_3 Int)) (let ((.cse217 (+ .cse6 v_z_3))) (let ((.cse218 (div .cse217 c_~var_1_65~0))) (or (< (div .cse217 .cse5) .cse15) (< v_z_3 0) (= .cse218 .cse15) (< 8 v_z_3) (< .cse218 .cse15)))))) (.cse1 (forall ((v_z_3 Int)) (let ((.cse216 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse216 .cse5) 0) (< (div .cse216 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15)))) (.cse48 (forall ((v_z_3 Int)) (let ((.cse215 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse215 .cse5) 0) (< (div .cse215 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse215 c_~var_1_65~0) .cse15))))) (.cse16 (forall ((v_z_3 Int)) (let ((.cse214 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse214 c_~var_1_65~0))) (< v_z_3 0) (< 8 v_z_3) (< (div .cse214 c_~var_1_65~0) .cse15))))) (.cse29 (forall ((v_z_3 Int)) (let ((.cse213 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse213 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse213 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse213 c_~var_1_65~0) .cse15))))) (.cse56 (forall ((v_z_3 Int)) (let ((.cse211 (+ .cse6 v_z_3))) (let ((.cse212 (div .cse211 c_~var_1_65~0))) (or (not (= 0 (mod .cse211 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse211 .cse5) 0) (< v_z_3 0) (= .cse212 .cse15) (< 8 v_z_3) (< .cse212 .cse15)))))) (.cse99 (forall ((v_z_3 Int)) (let ((.cse209 (+ .cse6 v_z_3))) (let ((.cse210 (div .cse209 c_~var_1_65~0))) (or (not (= 0 (mod .cse209 c_~var_1_65~0))) (< (div .cse209 .cse5) .cse15) (= (mod .cse209 .cse5) 0) (< v_z_3 0) (= .cse210 .cse15) (< 8 v_z_3) (< .cse210 .cse15)))))) (.cse23 (forall ((v_z_3 Int)) (let ((.cse207 (+ .cse6 v_z_3))) (let ((.cse208 (div .cse207 c_~var_1_65~0))) (or (not (= 0 (mod .cse207 c_~var_1_65~0))) (= (mod .cse207 .cse5) 0) (< v_z_3 0) (= .cse208 .cse15) (< 8 v_z_3) (< .cse208 .cse15)))))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse206 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse206 c_~var_1_65~0))) (not (= (mod .cse206 .cse5) 0)) (< (div .cse206 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse205 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse205 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse205 c_~var_1_65~0)))))) (.cse74 (forall ((v_z_3 Int)) (let ((.cse204 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (not (= (mod .cse204 .cse5) 0)) (< (div .cse204 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse204 c_~var_1_65~0)))))) (.cse61 (forall ((v_z_3 Int)) (let ((.cse203 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse203 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse203 .cse5) 0) (< (div .cse203 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse94 (forall ((v_z_3 Int)) (let ((.cse202 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse202 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse202 .cse5) 0) (< (div .cse202 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) (.cse97 (forall ((v_z_3 Int)) (let ((.cse200 (+ .cse6 v_z_3))) (let ((.cse201 (div .cse200 .cse5))) (or (not (= 0 (mod .cse200 c_~var_1_65~0))) (< .cse201 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse201) (< 8 v_z_3)))))) (.cse120 (forall ((v_z_3 Int)) (let ((.cse198 (+ .cse6 v_z_3))) (let ((.cse199 (div .cse198 .cse5))) (or (not (= 0 (mod .cse198 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse198 .cse5) 0) (< .cse199 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse199) (< 8 v_z_3) (< (div .cse198 c_~var_1_65~0) .cse15)))))) (.cse90 (forall ((v_z_3 Int)) (let ((.cse196 (+ .cse6 v_z_3))) (let ((.cse197 (div .cse196 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse196 .cse5) 0) (= .cse197 .cse15) (< 8 v_z_3) (< .cse197 .cse15)))))) (.cse26 (forall ((v_z_3 Int)) (let ((.cse194 (+ .cse6 v_z_3))) (let ((.cse195 (div .cse194 c_~var_1_65~0))) (or (= (mod .cse194 .cse5) 0) (< v_z_3 0) (= .cse195 .cse15) (< 8 v_z_3) (< .cse195 .cse15)))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse192 (+ .cse6 v_z_3))) (let ((.cse193 (div .cse192 c_~var_1_65~0))) (or (< (div .cse192 .cse5) .cse15) (= (mod .cse192 .cse5) 0) (< v_z_3 0) (= .cse193 .cse15) (< 8 v_z_3) (< .cse193 .cse15)))))) (.cse54 (forall ((v_z_3 Int)) (let ((.cse191 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse191 .cse5) 0) (< (div .cse191 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse191 c_~var_1_65~0)))))) (.cse133 (forall ((v_z_3 Int)) (let ((.cse189 (+ .cse6 v_z_3))) (let ((.cse190 (div .cse189 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse189 .cse5) 0) (< (div .cse189 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse190 .cse15) (< 8 v_z_3) (< .cse190 .cse15)))))) (.cse27 (forall ((v_z_3 Int)) (let ((.cse187 (+ .cse6 v_z_3))) (let ((.cse188 (div .cse187 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse187 .cse5) 0) (< v_z_3 0) (= .cse188 .cse15) (< 8 v_z_3) (< .cse188 .cse15)))))) (.cse79 (forall ((v_z_3 Int)) (let ((.cse186 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse186 c_~var_1_65~0))) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse186 c_~var_1_65~0) .cse15))))) (.cse10 (forall ((v_z_3 Int)) (let ((.cse185 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< v_z_3 0) (= .cse185 .cse15) (< 8 v_z_3) (< .cse185 .cse15))))) (.cse107 (forall ((v_z_3 Int)) (let ((.cse184 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse184 c_~var_1_65~0))) (not (= (mod .cse184 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse184 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse108 (forall ((v_z_3 Int)) (let ((.cse183 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse183 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse183 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse89 (forall ((v_z_3 Int)) (let ((.cse181 (+ .cse6 v_z_3))) (let ((.cse182 (div .cse181 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse181 .cse5) 0) (< .cse182 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse182) (< 8 v_z_3) (< (div .cse181 c_~var_1_65~0) .cse15)))))) (.cse98 (forall ((v_z_3 Int)) (let ((.cse180 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse180 c_~var_1_65~0))) (not (= (mod .cse180 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse180 c_~var_1_65~0) .cse15))))) (.cse30 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (.cse34 (forall ((v_z_3 Int)) (let ((.cse179 (+ .cse6 v_z_3))) (or (not (= (mod .cse179 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse179 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse21 (< c_~var_1_65~0 .cse5)) (.cse37 (forall ((v_z_3 Int)) (let ((.cse178 (+ .cse6 v_z_3))) (or (< (div .cse178 .cse5) .cse15) (not (= (mod .cse178 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse178 c_~var_1_65~0) .cse15))))) (.cse159 (forall ((v_z_3 Int)) (let ((.cse177 (+ .cse6 v_z_3))) (or (not (= (mod .cse177 .cse5) 0)) (< (div .cse177 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse0 (< .cse5 .cse175)) (.cse49 (forall ((v_z_3 Int)) (let ((.cse176 (+ .cse6 v_z_3))) (or (< (div .cse176 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse176 .cse5) 0) (< 8 v_z_3) (< (div .cse176 c_~var_1_65~0) .cse15))))) (.cse7 (< c_~var_1_65~0 0)) (.cse9 (< 0 .cse175)) (.cse8 (forall ((v_z_3 Int)) (let ((.cse173 (+ .cse6 v_z_3))) (let ((.cse174 (div .cse173 c_~var_1_65~0))) (or (not (= 0 (mod .cse173 c_~var_1_65~0))) (< v_z_3 0) (= .cse174 .cse15) (< 8 v_z_3) (< .cse174 .cse15)))))) (.cse102 (forall ((v_z_3 Int)) (let ((.cse171 (+ .cse6 v_z_3))) (let ((.cse172 (div .cse171 c_~var_1_65~0))) (or (not (= 0 (mod .cse171 c_~var_1_65~0))) (< (div .cse171 .cse5) .cse15) (< v_z_3 0) (= .cse172 .cse15) (< 8 v_z_3) (< .cse172 .cse15))))))) (and (or .cse0 (and .cse1 (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse6 v_z_3))) (let ((.cse2 (div .cse4 c_~var_1_65~0))) (or (< .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse4 .cse5) 0) (= .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse0 .cse8) (or .cse9 (and .cse10 .cse11)) (forall ((v_z_3 Int)) (let ((.cse12 (+ .cse6 v_z_3))) (let ((.cse13 (div .cse12 .cse5)) (.cse14 (div .cse12 c_~var_1_65~0))) (or (= (mod .cse12 .cse5) 0) (< .cse13 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse13) (= .cse14 .cse15) (< 8 v_z_3) (< .cse14 .cse15))))) (or .cse0 .cse16) (forall ((v_z_3 Int)) (let ((.cse17 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse17 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse17 .cse5) 0) (< (div .cse17 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse17 c_~var_1_65~0) .cse15)))) (or .cse18 .cse9) (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse6 v_z_3))) (let ((.cse20 (div .cse19 c_~var_1_65~0))) (or (not (= (mod .cse19 .cse5) 0)) (< v_z_3 0) (= .cse20 .cse15) (< 8 v_z_3) (< .cse20 .cse15))))) .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse22 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse22 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse22 c_~var_1_65~0)))))) (or .cse23 .cse0) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse6 v_z_3))) (let ((.cse25 (div .cse24 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse24 .cse5) .cse15) (= (mod .cse24 .cse5) 0) (< v_z_3 0) (= .cse25 .cse15) (< 8 v_z_3) (< .cse25 .cse15))))) .cse10 .cse26 .cse27 .cse28 .cse11)) (or .cse1 .cse9) (or (and .cse29 .cse16) .cse9) (or (and .cse30 (or (forall ((v_z_3 Int)) (let ((.cse31 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3)))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse6 v_z_3))) (let ((.cse32 (div .cse33 c_~var_1_65~0))) (or (< .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse33 .cse5) 0)) (< v_z_3 .cse3) (= .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse34) .cse0) (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (< (div .cse35 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse35 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or .cse37 .cse7) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse38 (+ .cse6 v_z_3))) (let ((.cse39 (div .cse38 c_~var_1_65~0))) (or (not (= 0 (mod .cse38 c_~var_1_65~0))) (< (div .cse38 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse39 .cse15) (< 8 v_z_3) (< .cse39 .cse15)))))) (forall ((v_z_3 Int)) (let ((.cse40 (+ .cse6 v_z_3))) (let ((.cse41 (div .cse40 .cse5)) (.cse42 (div .cse40 c_~var_1_65~0))) (or (not (= 0 (mod .cse40 c_~var_1_65~0))) (< .cse41 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse41) (= .cse42 .cse15) (< 8 v_z_3) (< .cse42 .cse15))))) (or .cse9 .cse43) (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse44 c_~var_1_65~0))) (< (div .cse44 .cse5) .cse15) (not (= (mod .cse44 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 c_~var_1_65~0) .cse15)))) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse6 v_z_3))) (let ((.cse46 (div .cse45 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse45 .cse5) 0) (< (div .cse45 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse46 .cse15) (< 8 v_z_3) (< .cse46 .cse15))))) (or (and (or .cse0 (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse47 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse47 c_~var_1_65~0) .cse15))))) .cse48) .cse7) (or (and .cse49 (or .cse0 (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse50 .cse5) 0) (< 8 v_z_3) (< (div .cse50 c_~var_1_65~0) .cse15)))))) .cse7) (or .cse18 .cse0) (or .cse21 .cse48) (forall ((v_z_3 Int)) (let ((.cse51 (+ .cse6 v_z_3))) (let ((.cse52 (div .cse51 .cse5)) (.cse53 (div .cse51 c_~var_1_65~0))) (or (not (= 0 (mod .cse51 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse51 .cse5) 0) (< .cse52 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse52) (= .cse53 .cse15) (< 8 v_z_3) (< .cse53 .cse15))))) (or (and .cse54 (or (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse6 v_z_3))) (or (< (div .cse55 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse55 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse55 c_~var_1_65~0))))) .cse7)) .cse0) (or .cse56 .cse0) (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse6 v_z_3))) (let ((.cse58 (div .cse57 .cse5)) (.cse59 (div .cse57 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse57 .cse5) 0) (< .cse58 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse58) (= .cse59 .cse15) (< 8 v_z_3) (< .cse59 .cse15))))) (or (and (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse60 c_~var_1_65~0))) (< (div .cse60 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse60 .cse5) 0) (< (div .cse60 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse61) .cse9) (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse6 v_z_3))) (let ((.cse63 (div .cse62 c_~var_1_65~0))) (or (not (= 0 (mod .cse62 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse62 .cse5) 0) (< (div .cse62 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse63 .cse15) (< 8 v_z_3) (< .cse63 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse6 v_z_3))) (let ((.cse65 (div .cse64 c_~var_1_65~0))) (or (not (= 0 (mod .cse64 c_~var_1_65~0))) (< (div .cse64 .cse5) .cse15) (not (= (mod .cse64 .cse5) 0)) (< v_z_3 0) (= .cse65 .cse15) (< 8 v_z_3) (< .cse65 .cse15))))) (or .cse9 .cse16) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse6 v_z_3))) (let ((.cse67 (div .cse66 .cse5))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse66 .cse5) 0) (< .cse67 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse67) (< 8 v_z_3)))))) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse6 v_z_3))) (let ((.cse69 (div .cse68 c_~var_1_65~0))) (or (< (div .cse68 .cse5) .cse15) (not (= (mod .cse68 .cse5) 0)) (< v_z_3 0) (= .cse69 .cse15) (< 8 v_z_3) (< .cse69 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse6 v_z_3))) (or (< (div .cse70 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse70 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse6 v_z_3))) (or (< (div .cse71 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse71 .cse5) 0) (< (div .cse71 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or (and .cse72 (or (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse6 v_z_3))) (or (< (div .cse73 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (not (= (mod .cse73 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse73 c_~var_1_65~0))))) .cse7) .cse74 (or (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse6 v_z_3))) (or (< (div .cse75 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse75 c_~var_1_65~0))))) .cse7)) .cse0) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse6 v_z_3))) (let ((.cse76 (div .cse78 .cse5)) (.cse77 (div .cse78 c_~var_1_65~0))) (or (< .cse76 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse76) (= .cse77 .cse15) (< 8 v_z_3) (< .cse77 .cse15))))) (or .cse29 .cse0) (or .cse79 .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse6 v_z_3))) (let ((.cse81 (div .cse80 .cse5))) (or (not (= 0 (mod .cse80 c_~var_1_65~0))) (= (mod .cse80 .cse5) 0) (< .cse81 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse81) (< 8 v_z_3) (< (div .cse80 c_~var_1_65~0) .cse15)))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse6 v_z_3))) (let ((.cse83 (div .cse82 .cse5))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (< .cse83 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse83) (< 8 v_z_3) (< (div .cse82 c_~var_1_65~0) .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse6 v_z_3))) (or (< (div .cse84 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< (div .cse84 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse85 c_~var_1_65~0))) (< (div .cse85 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3)))) .cse21) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse6 v_z_3))) (or (< (div .cse86 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse86 .cse5) 0) (< 8 v_z_3))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse6 v_z_3))) (let ((.cse87 (div .cse88 .cse5))) (or (< .cse87 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse87) (< 8 v_z_3) (< (div .cse88 c_~var_1_65~0) .cse15)))))) (or .cse21 .cse89) (or .cse56 .cse9) (or .cse0 .cse26) (or .cse90 .cse0) (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse6 v_z_3))) (let ((.cse92 (div .cse91 .cse5)) (.cse93 (div .cse91 c_~var_1_65~0))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (= (mod .cse91 .cse5) 0) (< .cse92 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse92) (= .cse93 .cse15) (< 8 v_z_3) (< .cse93 .cse15))))) (or .cse21 (and .cse94 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse6 v_z_3))) (let ((.cse96 (div .cse95 .cse5))) (or (not (= 0 (mod .cse95 c_~var_1_65~0))) (= (mod .cse95 .cse5) 0) (< .cse96 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse96) (< 8 v_z_3))))) .cse97)) (or .cse9 .cse98) (or (and .cse99 .cse23) .cse9) (or (and (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse6 v_z_3))) (let ((.cse101 (div .cse100 c_~var_1_65~0))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (< (div .cse100 .cse5) .cse15) (= (mod .cse100 .cse5) 0) (< v_z_3 0) (= .cse101 .cse15) (< 8 v_z_3) (< .cse101 .cse15))))) .cse56 .cse99 .cse23 .cse8 .cse102) .cse9) (or (and .cse43 (or (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse6 v_z_3))) (let ((.cse104 (div .cse103 c_~var_1_65~0))) (or (not (= 0 (mod .cse103 c_~var_1_65~0))) (< .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse103 .cse5) 0)) (= .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse6 v_z_3))) (let ((.cse106 (div .cse105 c_~var_1_65~0))) (or (not (= 0 (mod .cse105 c_~var_1_65~0))) (< .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse105 .cse5) 0)) (< v_z_3 .cse3) (= .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse107 .cse108 (or (forall ((v_z_3 Int)) (let ((.cse109 (+ .cse6 v_z_3))) (let ((.cse110 (div .cse109 c_~var_1_65~0))) (or (not (= 0 (mod .cse109 c_~var_1_65~0))) (< .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7)) .cse0) (or (and .cse72 (forall ((v_z_3 Int)) (let ((.cse112 (+ .cse6 v_z_3))) (let ((.cse111 (div .cse112 .cse5))) (or (< .cse3 (+ v_z_3 1)) (< .cse111 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse112 c_~var_1_65~0) .cse36) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse111) (< 8 v_z_3) (= 0 (mod .cse112 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse113 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse113 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse113 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse113 c_~var_1_65~0))))) .cse74 (forall ((v_z_3 Int)) (let ((.cse114 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse114 .cse5) .cse15) (not (= (mod .cse114 .cse5) 0)) (< (div .cse114 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse114 c_~var_1_65~0)))))) .cse9) (or .cse0 (and .cse61 (or (forall ((v_z_3 Int)) (let ((.cse115 (+ .cse6 v_z_3))) (let ((.cse116 (div .cse115 c_~var_1_65~0))) (or (not (= 0 (mod .cse115 c_~var_1_65~0))) (< .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse115 .cse5) 0) (= .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse21 (and .cse94 .cse97)) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse117 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse117 c_~var_1_65~0))) (< (div .cse117 .cse5) .cse15) (not (= (mod .cse117 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3))))) (or (forall ((v_z_3 Int)) (or (< (div (+ .cse6 v_z_3) .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3))) .cse21) (or (forall ((v_z_3 Int)) (let ((.cse118 (+ .cse6 v_z_3))) (let ((.cse119 (div .cse118 c_~var_1_65~0))) (or (not (= 0 (mod .cse118 c_~var_1_65~0))) (not (= (mod .cse118 .cse5) 0)) (< v_z_3 0) (= .cse119 .cse15) (< 8 v_z_3) (< .cse119 .cse15))))) .cse0) (or .cse21 .cse120) (or .cse21 (and (forall ((v_z_3 Int)) (let ((.cse121 (+ .cse6 v_z_3))) (let ((.cse122 (div .cse121 .cse5))) (or (= (mod .cse121 .cse5) 0) (< .cse122 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse122) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse123 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse123 .cse5) 0) (< (div .cse123 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse124 (div (+ .cse6 v_z_3) .cse5))) (or (< .cse124 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse124) (< 8 v_z_3)))))) (or .cse120 .cse7) (or .cse9 (and .cse90 (forall ((v_z_3 Int)) (let ((.cse125 (+ .cse6 v_z_3))) (let ((.cse126 (div .cse125 c_~var_1_65~0))) (or (< (div .cse125 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse125 .cse5) 0) (= .cse126 .cse15) (< 8 v_z_3) (< .cse126 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse127 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse127 .cse5) .cse15) (< (div .cse127 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse127 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse128 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse128 .cse5) 0) (< (div .cse128 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse128 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse128 c_~var_1_65~0))))) (or (and .cse26 .cse28) .cse9) (or .cse0 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse129 (+ .cse6 v_z_3))) (let ((.cse130 (div .cse129 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse129 .cse5) 0) (< .cse130 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse130) (< 8 v_z_3)))))) (or (forall ((v_z_3 Int)) (let ((.cse131 (+ .cse6 v_z_3))) (let ((.cse132 (div .cse131 c_~var_1_65~0))) (or (not (= 0 (mod .cse131 c_~var_1_65~0))) (= (mod .cse131 .cse5) 0) (< (div .cse131 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse132 .cse15) (< 8 v_z_3) (< .cse132 .cse15))))) .cse0) (or .cse54 .cse9) (or .cse133 .cse0) (or (and .cse133 (or (forall ((v_z_3 Int)) (let ((.cse134 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse134 .cse5) 0) (< (div .cse134 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse134 c_~var_1_65~0) .cse15)))) .cse7)) .cse0) (or .cse9 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse135 (+ .cse6 v_z_3))) (let ((.cse136 (div .cse135 .cse5))) (or (= (mod .cse135 .cse5) 0) (< .cse136 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse136) (< 8 v_z_3) (< (div .cse135 c_~var_1_65~0) .cse15)))))) (or .cse9 .cse79) (or .cse10 .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse137 (+ .cse6 v_z_3))) (or (not (= (mod .cse137 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse137 c_~var_1_65~0) .cse15)))) .cse0) .cse37) .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< v_z_3 0) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15))) .cse0) (forall ((v_z_3 Int)) (let ((.cse138 (+ .cse6 v_z_3))) (or (< (div .cse138 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse138 c_~var_1_65~0) .cse15))))) .cse7) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse139 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse139 .cse5) 0) (< (div .cse139 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse139 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse140 (+ .cse6 v_z_3))) (or (< (div .cse140 .cse5) .cse15) (not (= (mod .cse140 .cse5) 0)) (< (div .cse140 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse141 (+ .cse6 v_z_3))) (let ((.cse142 (div .cse141 .cse5))) (or (not (= 0 (mod .cse141 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse141 .cse5) 0) (< .cse142 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse141 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse142) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse143 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse143 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse143 .cse5) 0) (< (div .cse143 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse143 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) .cse9) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse144 (+ .cse6 v_z_3))) (let ((.cse145 (div .cse144 c_~var_1_65~0))) (or (< (div .cse144 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse145 .cse15) (< 8 v_z_3) (< .cse145 .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse146 (+ .cse6 v_z_3))) (or (< (div .cse146 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse146 .cse5) 0) (< (div .cse146 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse146 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse147 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse147 c_~var_1_65~0))) (< (div .cse147 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse147 c_~var_1_65~0) .cse15)))) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse148 (+ .cse6 v_z_3))) (let ((.cse149 (div .cse148 .cse5))) (or (not (= 0 (mod .cse148 c_~var_1_65~0))) (< v_z_3 .cse3) (< .cse149 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse148 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse149) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse150 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse150 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse150 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse150 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse107 .cse108 (forall ((v_z_3 Int)) (let ((.cse151 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse151 c_~var_1_65~0))) (< (div .cse151 .cse5) .cse15) (not (= (mod .cse151 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse151 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse89 .cse7) (or (forall ((v_z_3 Int)) (let ((.cse152 (+ .cse6 v_z_3))) (or (< (div .cse152 .cse5) .cse15) (not (= (mod .cse152 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3)))) .cse21) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse153 (+ .cse6 v_z_3))) (let ((.cse154 (div .cse153 c_~var_1_65~0))) (or (= (mod .cse153 .cse5) 0) (< (div .cse153 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse154 .cse15) (< 8 v_z_3) (< .cse154 .cse15)))))) (or .cse0 (and (or (forall ((v_z_3 Int)) (let ((.cse155 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse155 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse155 .cse5) 0) (< (div .cse155 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse155 c_~var_1_65~0) .cse15)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse156 (+ .cse6 v_z_3))) (let ((.cse157 (div .cse156 c_~var_1_65~0))) (or (not (= 0 (mod .cse156 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse156 .cse5) 0) (< (div .cse156 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse157 .cse15) (< 8 v_z_3) (< .cse157 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse158 (+ .cse6 v_z_3))) (or (< (div .cse158 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse158 c_~var_1_65~0) .cse15)))) (or .cse159 .cse9) (forall ((v_z_3 Int)) (let ((.cse160 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse160 c_~var_1_65~0))) (< (div .cse160 .cse5) .cse15) (not (= (mod .cse160 .cse5) 0)) (< (div .cse160 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or .cse98 .cse0) (or .cse9 (and .cse30 (forall ((v_z_3 Int)) (let ((.cse161 (+ .cse6 v_z_3))) (or (< (div .cse161 .cse5) .cse15) (not (= (mod .cse161 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse161 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse163 (+ .cse6 v_z_3))) (let ((.cse162 (div .cse163 .cse5))) (or (< v_z_3 .cse3) (< .cse162 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse163 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse162) (< 8 v_z_3))))) .cse34 (forall ((v_z_3 Int)) (let ((.cse164 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (< (div .cse164 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse164 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse21 .cse37) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse165 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse165 .cse5) 0) (< (div .cse165 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse165 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse166 (+ .cse6 v_z_3))) (let ((.cse167 (div .cse166 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse166 .cse5) 0) (< .cse167 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse166 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse167) (< 8 v_z_3))))))) (or (and .cse159 (or (forall ((v_z_3 Int)) (let ((.cse169 (+ .cse6 v_z_3))) (let ((.cse168 (div .cse169 c_~var_1_65~0))) (or (< .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse169 .cse5) 0)) (= .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or .cse49 .cse7) (or .cse9 (and .cse8 .cse102)) (forall ((v_z_3 Int)) (let ((.cse170 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse170 c_~var_1_65~0))) (< (div .cse170 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse170 c_~var_1_65~0) .cse15)))))))) is different from true [2025-02-05 21:59:27,020 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_66~0 256))) (let ((.cse89 (+ c_~var_1_65~0 1)) (.cse2 (mod c_~var_1_73~0 65536)) (.cse3 (* (- 1) .cse0))) (let ((.cse26 (forall ((v_z_3 Int)) (let ((.cse108 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse108 c_~var_1_65~0))) (= (mod .cse108 .cse2) 0) (< (div .cse108 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse30 (forall ((v_z_3 Int)) (let ((.cse107 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse107 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse107 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse11 (forall ((v_z_3 Int)) (let ((.cse106 (+ .cse3 v_z_3))) (or (not (= (mod .cse106 .cse2) 0)) (< (div .cse106 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse3 v_z_3))) (or (not (= (mod .cse105 .cse2) 0)) (< (div .cse105 .cse2) 1) (< (div .cse105 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse8 (forall ((v_z_3 Int)) (let ((.cse104 (+ .cse3 v_z_3))) (or (< (div .cse104 .cse2) 1) (< (div .cse104 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse12 (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse3 v_z_3))) (or (not (= (mod .cse103 .cse2) 0)) (< (div .cse103 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse38 (forall ((v_z_3 Int)) (let ((.cse102 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse102 c_~var_1_65~0))) (< (div .cse102 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse51 (forall ((v_z_3 Int)) (let ((.cse101 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse101 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse101 .cse2) 0) (< (div .cse101 c_~var_1_65~0) 2) (< 8 v_z_3))))) (.cse40 (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse100 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse100 .cse2) 0))))) (.cse41 (forall ((v_z_3 Int)) (let ((.cse99 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse99 c_~var_1_65~0))) (< (div .cse99 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse20 (forall ((v_z_3 Int)) (let ((.cse98 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse98 .cse2) 0) (< (div .cse98 c_~var_1_65~0) 2) (< 8 v_z_3))))) (.cse25 (forall ((v_z_3 Int)) (let ((.cse97 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse97 c_~var_1_65~0))) (< (div .cse97 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse29 (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (.cse16 (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 1) (< 8 v_z_3)))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse96 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse96 c_~var_1_65~0))) (= (mod .cse96 .cse2) 0) (< (div .cse96 .cse2) 1) (< (div .cse96 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse22 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse3 v_z_3))) (or (= (mod .cse95 .cse2) 0) (< (div .cse95 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (let ((.cse94 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse94 .cse2) 0) (< (div .cse94 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse93 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse93 .cse2) 0) (< (div .cse93 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse6 (forall ((v_z_3 Int)) (let ((.cse92 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse92 .cse2) 0) (< (div .cse92 .cse2) 1) (< (div .cse92 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse7 (< c_~var_1_65~0 0)) (.cse13 (< c_~var_1_65~0 .cse2)) (.cse5 (< .cse2 .cse89)) (.cse17 (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (not (= (mod .cse91 .cse2) 0)) (< (div .cse91 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse31 (forall ((v_z_3 Int)) (let ((.cse90 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse90 c_~var_1_65~0))) (not (= (mod .cse90 .cse2) 0)) (< (div .cse90 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse9 (< 0 .cse89))) (and (forall ((v_z_3 Int)) (let ((.cse1 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse1 .cse2) 0) (< (div .cse1 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse1 .cse2) 0) (= 0 (mod .cse1 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse4 .cse2) 0) (< (div .cse4 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse6 .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))) .cse5) .cse8) .cse7) (or .cse9 (forall ((v_z_3 Int)) (let ((.cse10 (+ .cse3 v_z_3))) (or (= (mod .cse10 .cse2) 0) (< (div .cse10 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse10 c_~var_1_65~0)))))) (or (and (or .cse11 .cse7) .cse12) .cse5) (or .cse13 .cse6) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse14 (+ .cse3 v_z_3))) (or (not (= (mod .cse14 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse14 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse15 (+ .cse3 v_z_3))) (or (not (= (mod .cse15 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse15 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7) (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 2) (< 8 v_z_3))) (or .cse16 .cse7))) (or .cse17 .cse5) (or .cse13 .cse18) (or .cse5 (and (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse3 v_z_3))) (or (= (mod .cse19 .cse2) 0) (< (div .cse19 c_~var_1_65~0) 1) (< 8 v_z_3) (< (div .cse19 .cse2) 0)))) .cse7) .cse20)) (or (forall ((v_z_3 Int)) (let ((.cse21 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse21 c_~var_1_65~0))) (< (div .cse21 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse21 .cse2) 0)))) .cse5) (or .cse22 .cse5) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse23 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse23 c_~var_1_65~0))) (not (= (mod .cse23 .cse2) 0)) (< (div .cse23 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse3 v_z_3))) (or (not (= (mod .cse24 .cse2) 0)) (< (div .cse24 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (or (and .cse25 .cse26) .cse9) (forall ((v_z_3 Int)) (let ((.cse27 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse27 .cse2) 0) (< (div .cse27 .cse2) 1) (< (div .cse27 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse28 .cse13) (or .cse29 .cse5) (or (and .cse22 .cse29) .cse9) (or .cse20 .cse5) (or .cse5 .cse30) (or .cse5 (and .cse17 (or .cse31 .cse7))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse32 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse32 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse32 .cse2) 0) (< (div .cse32 .cse2) 1) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse33 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse33 .cse2) 0) (< (div .cse33 .cse2) 1) (< (div .cse33 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse34 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse34 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse34 .cse2) 0) (< (div .cse34 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse5 (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (= (mod .cse35 .cse2) 0) (< (div .cse35 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse35 .cse2) 0))))) (or (forall ((v_z_3 Int)) (let ((.cse36 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse36 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse36 .cse2) 0) (= 0 (mod .cse36 c_~var_1_65~0))))) .cse13) (forall ((v_z_3 Int)) (let ((.cse37 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse37 c_~var_1_65~0))) (not (= (mod .cse37 .cse2) 0)) (< (div .cse37 .cse2) 1) (< (div .cse37 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or .cse38 .cse9) (or .cse9 .cse26) (or .cse13 (and (forall ((v_z_3 Int)) (let ((.cse39 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse39 c_~var_1_65~0))) (= (mod .cse39 .cse2) 0) (< (div .cse39 .cse2) 1) (< v_z_3 0) (< 8 v_z_3)))) .cse40 .cse41)) (or .cse13 (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) .cse2) 1) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse42 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse42 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse42 .cse2) 0) (< (div .cse42 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse43 .cse13) (or (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse3 v_z_3))) (or (= (mod .cse44 .cse2) 0) (< (div .cse44 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 .cse2) 0)))) .cse5) (or .cse5 .cse26) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse45 c_~var_1_65~0))) (< (div .cse45 .cse2) 1) (< (div .cse45 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse46 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse46 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse46 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse47 c_~var_1_65~0))) (not (= (mod .cse47 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse47 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse48 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse48 c_~var_1_65~0))) (not (= (mod .cse48 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse48 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse30 .cse7))) (or .cse5 (and (or (forall ((v_z_3 Int)) (let ((.cse49 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse49 .cse2) 0) (< v_z_3 0) (< (div .cse49 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse49 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse50 .cse2) 0) (< (div .cse50 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse50 c_~var_1_65~0))))))) (or (and .cse28 (or .cse5 .cse11)) .cse7) (or .cse28 .cse7) (or .cse5 (and .cse51 (or (forall ((v_z_3 Int)) (let ((.cse52 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse52 c_~var_1_65~0))) (= (mod .cse52 .cse2) 0) (< (div .cse52 c_~var_1_65~0) 1) (< 8 v_z_3) (< (div .cse52 .cse2) 0)))) .cse7))) (or .cse13 .cse8) (forall ((v_z_3 Int)) (let ((.cse53 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse53 c_~var_1_65~0))) (= (mod .cse53 .cse2) 0) (< (div .cse53 .cse2) 1) (< (div .cse53 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse54 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (< (div .cse54 .cse2) 1) (< (div .cse54 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse25 .cse5) (or .cse12 .cse5) (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse3 v_z_3))) (or (not (= (mod .cse55 .cse2) 0)) (< (div .cse55 .cse2) 1) (< (div .cse55 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse56 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse56 c_~var_1_65~0))) (< (div .cse56 .cse2) 1) (< (div .cse56 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse57 .cse2) 1) (< v_z_3 0) (< (div .cse57 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse57 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse58 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse58 .cse2) 0) (< (div .cse58 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse58 .cse2) 0)))) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse59 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (not (= (mod .cse59 .cse2) 0)) (< (div .cse59 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse59 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (not (= (mod .cse60 .cse2) 0)) (< v_z_3 0) (< (div .cse60 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse60 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse61 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse61 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse61 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< v_z_3 0) (< (div .cse62 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse62 c_~var_1_65~0))))) .cse7))) (or (forall ((v_z_3 Int)) (let ((.cse63 (+ .cse3 v_z_3))) (or (< (div .cse63 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse63 .cse2) 0)))) .cse5) (or (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< v_z_3 0) (< (div .cse64 c_~var_1_65~0) 0) (< 8 v_z_3) (< (div .cse64 .cse2) 0) (= 0 (mod .cse64 c_~var_1_65~0))))) .cse7) (or .cse9 (and .cse38 (forall ((v_z_3 Int)) (let ((.cse65 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse65 c_~var_1_65~0))) (= (mod .cse65 .cse2) 0) (< (div .cse65 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))))) (or .cse9 .cse12) (or .cse38 .cse5) (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse66 .cse2) 0) (< (div .cse66 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse66 .cse2) 0)))) (or (and .cse51 (or (forall ((v_z_3 Int)) (let ((.cse67 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse67 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse67 .cse2) 0) (< (div .cse67 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7)) .cse5) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse68 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse68 .cse2) 1) (< (div .cse68 c_~var_1_65~0) 1) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse69 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse69 .cse2) 1) (< (div .cse69 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse69 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse70 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse70 .cse2) 1) (< (div .cse70 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse71 .cse2) 1) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse71 c_~var_1_65~0)))))) (or .cse13 (and .cse40 .cse41)) (or (and (or .cse72 .cse7) .cse20) .cse5) (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse73 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse73 .cse2) 0) (< (div .cse73 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3) (< (div .cse73 .cse2) 0)))) (or .cse9 .cse25) (or .cse9 .cse29) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse74 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse74 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse74 .cse2) 1) (< 8 v_z_3))))) (or .cse16 .cse5) (or .cse13 (and (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse3 v_z_3))) (or (= (mod .cse75 .cse2) 0) (< (div .cse75 .cse2) 1) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) .cse2) 1) (< v_z_3 0) (< 8 v_z_3))) (forall ((v_z_3 Int)) (let ((.cse76 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse76 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse76 .cse2) 0)))))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse77 (+ .cse3 v_z_3))) (or (= (mod .cse77 .cse2) 0) (< (div .cse77 .cse2) 1) (< (div .cse77 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (or .cse43 .cse7) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse3 v_z_3))) (or (< (div .cse78 .cse2) 1) (< (div .cse78 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse79 (+ .cse3 v_z_3))) (or (= (mod .cse79 .cse2) 0) (< (div .cse79 .cse2) 1) (< (div .cse79 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or .cse22 .cse9) (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (< (div .cse80 .cse2) 1) (< (div .cse80 c_~var_1_65~0) 1) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse81 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse81 .cse2) 0) (< (div .cse81 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3) (< (div .cse81 .cse2) 0)))) (or .cse5 .cse18)) .cse7) (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (not (= (mod .cse82 .cse2) 0)) (< (div .cse82 .cse2) 1) (< (div .cse82 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) (or (and (or .cse72 .cse5) .cse6) .cse7) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse83 (+ .cse3 v_z_3))) (or (< (div .cse83 .cse2) 1) (< (div .cse83 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse83 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse3 v_z_3))) (or (not (= (mod .cse84 .cse2) 0)) (< (div .cse84 .cse2) 1) (< (div .cse84 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse3 v_z_3))) (or (< (div .cse85 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse85 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse3 v_z_3))) (or (< (div .cse86 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse86 .cse2) 0) (= 0 (mod .cse86 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse87 (+ .cse3 v_z_3))) (or (not (= (mod .cse87 .cse2) 0)) (< (div .cse87 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse87 c_~var_1_65~0))))))) (or (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse88 .cse2) 0) (< (div .cse88 .cse2) 1) (< 8 v_z_3)))) .cse13) (or .cse31 .cse5) (or .cse17 .cse9) (or .cse31 .cse9))))) is different from false