./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 551b0097 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-?-551b009-m [2025-01-09 10:05:02,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:05:03,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:05:03,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:05:03,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:05:03,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:05:03,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:05:03,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:05:03,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:05:03,046 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:05:03,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:05:03,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:05:03,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:05:03,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:05:03,047 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:05:03,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:05:03,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:05:03,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:05:03,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:05:03,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:05:03,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:05:03,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:05:03,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:05:03,048 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:05:03,048 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:05:03,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:05:03,049 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:05:03,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:05:03,049 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:05:03,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:05:03,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:05:03,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:05:03,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:05:03,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:05:03,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:05:03,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:05:03,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:05:03,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:05:03,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:05:03,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:05:03,050 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:05:03,050 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:05:03,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:05:03,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:05:03,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:05:03,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:05:03,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:05:03,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:05:03,051 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-01-09 10:05:03,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:05:03,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:05:03,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:05:03,293 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:05:03,293 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:05:03,294 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-01-09 10:05:04,383 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d123f210a/66507b6466e043978bad58ae756cf99e/FLAGe4ebe269c [2025-01-09 10:05:04,669 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:05:04,670 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-01-09 10:05:04,681 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d123f210a/66507b6466e043978bad58ae756cf99e/FLAGe4ebe269c [2025-01-09 10:05:04,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d123f210a/66507b6466e043978bad58ae756cf99e [2025-01-09 10:05:04,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:05:04,963 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:05:04,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:05:04,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:05:04,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:05:04,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:04,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca01079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:04, skipping insertion in model container [2025-01-09 10:05:04,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:05:04" (1/1) ... [2025-01-09 10:05:05,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:05:05,118 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-01-09 10:05:05,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:05:05,313 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:05:05,324 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-01-09 10:05:05,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:05:05,426 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:05:05,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05 WrapperNode [2025-01-09 10:05:05,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:05:05,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:05:05,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:05:05,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:05:05,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,515 INFO L138 Inliner]: procedures = 26, calls = 123, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 803 [2025-01-09 10:05:05,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:05:05,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:05:05,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:05:05,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:05:05,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,578 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-01-09 10:05:05,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,608 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,626 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:05:05,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:05:05,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:05:05,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:05:05,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (1/1) ... [2025-01-09 10:05:05,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:05:05,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:05,695 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-01-09 10:05:05,701 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-01-09 10:05:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:05:05,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:05:05,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:05:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:05:05,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:05:05,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:05:05,849 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:05:05,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:05:06,814 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 10:05:06,814 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:05:06,837 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:05:06,837 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:05:06,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:05:06 BoogieIcfgContainer [2025-01-09 10:05:06,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:05:06,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:05:06,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:05:06,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:05:06,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:05:04" (1/3) ... [2025-01-09 10:05:06,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791ae917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:05:06, skipping insertion in model container [2025-01-09 10:05:06,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:05:05" (2/3) ... [2025-01-09 10:05:06,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791ae917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:05:06, skipping insertion in model container [2025-01-09 10:05:06,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:05:06" (3/3) ... [2025-01-09 10:05:06,849 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2025-01-09 10:05:06,861 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:05:06,864 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-01-09 10:05:06,924 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:05:06,935 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;@dab6ed8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:05:06,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:05:06,940 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-01-09 10:05:06,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-01-09 10:05:06,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:06,974 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-01-09 10:05:06,975 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:06,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:06,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2027520381, now seen corresponding path program 1 times [2025-01-09 10:05:06,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:06,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434858271] [2025-01-09 10:05:06,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:06,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:07,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-01-09 10:05:07,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-01-09 10:05:07,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:07,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 218 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2025-01-09 10:05:07,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:07,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434858271] [2025-01-09 10:05:07,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434858271] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:05:07,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623349867] [2025-01-09 10:05:07,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:07,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:07,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:07,603 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-01-09 10:05:07,605 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-01-09 10:05:07,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-01-09 10:05:07,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-01-09 10:05:07,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:07,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:07,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:05:07,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:05:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2025-01-09 10:05:08,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:05:08,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623349867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:08,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:05:08,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:05:08,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825879063] [2025-01-09 10:05:08,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:08,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:05:08,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:08,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:05:08,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:05:08,081 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 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2025-01-09 10:05:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:08,154 INFO L93 Difference]: Finished difference Result 660 states and 1235 transitions. [2025-01-09 10:05:08,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:05:08,155 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) Word has length 705 [2025-01-09 10:05:08,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:08,166 INFO L225 Difference]: With dead ends: 660 [2025-01-09 10:05:08,167 INFO L226 Difference]: Without dead ends: 330 [2025-01-09 10:05:08,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 706 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-01-09 10:05:08,178 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:08,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-01-09 10:05:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-01-09 10:05:08,251 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-01-09 10:05:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 558 transitions. [2025-01-09 10:05:08,261 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 558 transitions. Word has length 705 [2025-01-09 10:05:08,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:08,262 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 558 transitions. [2025-01-09 10:05:08,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2025-01-09 10:05:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 558 transitions. [2025-01-09 10:05:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-01-09 10:05:08,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:08,276 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-01-09 10:05:08,285 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-01-09 10:05:08,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:05:08,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:08,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1868947765, now seen corresponding path program 1 times [2025-01-09 10:05:08,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:08,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741828688] [2025-01-09 10:05:08,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:08,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:08,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-01-09 10:05:08,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-01-09 10:05:08,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:08,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-01-09 10:05:09,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:09,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741828688] [2025-01-09 10:05:09,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741828688] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:05:09,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585333953] [2025-01-09 10:05:09,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:09,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:09,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:09,753 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-01-09 10:05:09,755 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-01-09 10:05:09,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-01-09 10:05:10,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-01-09 10:05:10,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:10,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:10,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 10:05:10,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:05:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:05:10,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:05:10,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585333953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:10,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:05:10,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 10:05:10,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481417085] [2025-01-09 10:05:10,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:10,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:10,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:10,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:10,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:05:10,191 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-01-09 10:05:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:10,274 INFO L93 Difference]: Finished difference Result 829 states and 1406 transitions. [2025-01-09 10:05:10,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:10,275 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-01-09 10:05:10,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:10,281 INFO L225 Difference]: With dead ends: 829 [2025-01-09 10:05:10,283 INFO L226 Difference]: Without dead ends: 502 [2025-01-09 10:05:10,285 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-01-09 10:05:10,285 INFO L435 NwaCegarLoop]: 707 mSDtfsCounter, 281 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:10,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1240 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-01-09 10:05:10,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 499. [2025-01-09 10:05:10,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 353 states have (on average 1.5920679886685551) internal successors, (562), 354 states have internal predecessors, (562), 143 states have call successors, (143), 2 states have call predecessors, (143), 2 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2025-01-09 10:05:10,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 848 transitions. [2025-01-09 10:05:10,339 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 848 transitions. Word has length 706 [2025-01-09 10:05:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:10,340 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 848 transitions. [2025-01-09 10:05:10,340 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-01-09 10:05:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 848 transitions. [2025-01-09 10:05:10,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-01-09 10:05:10,355 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:10,356 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-01-09 10:05:10,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 10:05:10,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:10,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:10,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash -517561741, now seen corresponding path program 1 times [2025-01-09 10:05:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:10,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232773349] [2025-01-09 10:05:10,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:10,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-01-09 10:05:10,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-01-09 10:05:10,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:10,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:11,131 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-01-09 10:05:11,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:11,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232773349] [2025-01-09 10:05:11,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232773349] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:05:11,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834071658] [2025-01-09 10:05:11,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:11,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:11,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:11,134 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-01-09 10:05:11,135 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-01-09 10:05:11,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-01-09 10:05:11,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-01-09 10:05:11,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:11,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:11,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 10:05:11,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:05:11,555 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:05:11,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:05:11,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834071658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:11,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:05:11,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 10:05:11,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244134718] [2025-01-09 10:05:11,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:11,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:05:11,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:11,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:05:11,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:05:11,558 INFO L87 Difference]: Start difference. First operand 499 states and 848 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-01-09 10:05:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:11,739 INFO L93 Difference]: Finished difference Result 1499 states and 2550 transitions. [2025-01-09 10:05:11,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:05:11,740 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-01-09 10:05:11,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:11,748 INFO L225 Difference]: With dead ends: 1499 [2025-01-09 10:05:11,748 INFO L226 Difference]: Without dead ends: 1003 [2025-01-09 10:05:11,750 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-01-09 10:05:11,751 INFO L435 NwaCegarLoop]: 1006 mSDtfsCounter, 535 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:11,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2534 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:05:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2025-01-09 10:05:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 641. [2025-01-09 10:05:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 495 states have (on average 1.6404040404040403) internal successors, (812), 496 states have internal predecessors, (812), 143 states have call successors, (143), 2 states have call predecessors, (143), 2 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2025-01-09 10:05:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1098 transitions. [2025-01-09 10:05:11,816 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1098 transitions. Word has length 706 [2025-01-09 10:05:11,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:11,818 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 1098 transitions. [2025-01-09 10:05:11,818 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-01-09 10:05:11,818 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1098 transitions. [2025-01-09 10:05:11,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-01-09 10:05:11,823 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:11,823 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-01-09 10:05:11,832 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-01-09 10:05:12,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:12,024 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:12,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:12,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1818830769, now seen corresponding path program 1 times [2025-01-09 10:05:12,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:12,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340126487] [2025-01-09 10:05:12,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:12,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-01-09 10:05:12,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-01-09 10:05:12,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:12,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:05:12,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:12,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340126487] [2025-01-09 10:05:12,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340126487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:12,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:12,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271890811] [2025-01-09 10:05:12,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:12,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:12,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:12,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:12,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:12,267 INFO L87 Difference]: Start difference. First operand 641 states and 1098 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-01-09 10:05:12,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:12,312 INFO L93 Difference]: Finished difference Result 1570 states and 2682 transitions. [2025-01-09 10:05:12,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:12,313 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-01-09 10:05:12,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:12,318 INFO L225 Difference]: With dead ends: 1570 [2025-01-09 10:05:12,319 INFO L226 Difference]: Without dead ends: 932 [2025-01-09 10:05:12,320 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-01-09 10:05:12,321 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 223 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:12,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1205 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:12,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-01-09 10:05:12,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 929. [2025-01-09 10:05:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 710 states have (on average 1.6211267605633803) internal successors, (1151), 713 states have internal predecessors, (1151), 214 states have call successors, (214), 4 states have call predecessors, (214), 4 states have return successors, (214), 211 states have call predecessors, (214), 214 states have call successors, (214) [2025-01-09 10:05:12,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 1579 transitions. [2025-01-09 10:05:12,375 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 1579 transitions. Word has length 706 [2025-01-09 10:05:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:12,376 INFO L471 AbstractCegarLoop]: Abstraction has 929 states and 1579 transitions. [2025-01-09 10:05:12,377 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-01-09 10:05:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1579 transitions. [2025-01-09 10:05:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-01-09 10:05:12,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:12,381 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-01-09 10:05:12,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:05:12,382 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:12,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1104329229, now seen corresponding path program 1 times [2025-01-09 10:05:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:12,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059605295] [2025-01-09 10:05:12,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:12,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:12,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-01-09 10:05:12,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-01-09 10:05:12,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:12,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:05:12,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:12,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059605295] [2025-01-09 10:05:12,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059605295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:12,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:12,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:12,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843358020] [2025-01-09 10:05:12,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:12,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:12,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:12,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:12,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:12,618 INFO L87 Difference]: Start difference. First operand 929 states and 1579 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-01-09 10:05:12,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:12,708 INFO L93 Difference]: Finished difference Result 2505 states and 4244 transitions. [2025-01-09 10:05:12,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:12,710 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-01-09 10:05:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:12,720 INFO L225 Difference]: With dead ends: 2505 [2025-01-09 10:05:12,720 INFO L226 Difference]: Without dead ends: 1579 [2025-01-09 10:05:12,723 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-01-09 10:05:12,723 INFO L435 NwaCegarLoop]: 787 mSDtfsCounter, 327 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:12,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1332 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2025-01-09 10:05:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1576. [2025-01-09 10:05:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1161 states have (on average 1.5900086132644273) internal successors, (1846), 1168 states have internal predecessors, (1846), 406 states have call successors, (406), 8 states have call predecessors, (406), 8 states have return successors, (406), 399 states have call predecessors, (406), 406 states have call successors, (406) [2025-01-09 10:05:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2658 transitions. [2025-01-09 10:05:12,799 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2658 transitions. Word has length 706 [2025-01-09 10:05:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:12,800 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2658 transitions. [2025-01-09 10:05:12,800 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-01-09 10:05:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2658 transitions. [2025-01-09 10:05:12,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-01-09 10:05:12,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:12,806 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-01-09 10:05:12,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:05:12,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:12,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:12,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1501694325, now seen corresponding path program 1 times [2025-01-09 10:05:12,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:12,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015534360] [2025-01-09 10:05:12,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:12,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:12,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-01-09 10:05:12,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-01-09 10:05:12,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:12,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:05:13,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:13,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015534360] [2025-01-09 10:05:13,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015534360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:13,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:13,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:05:13,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691319575] [2025-01-09 10:05:13,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:13,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:05:13,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:13,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:05:13,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:05:13,215 INFO L87 Difference]: Start difference. First operand 1576 states and 2658 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-01-09 10:05:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:13,662 INFO L93 Difference]: Finished difference Result 4538 states and 7616 transitions. [2025-01-09 10:05:13,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:05:13,663 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-01-09 10:05:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:13,680 INFO L225 Difference]: With dead ends: 4538 [2025-01-09 10:05:13,680 INFO L226 Difference]: Without dead ends: 2965 [2025-01-09 10:05:13,686 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-01-09 10:05:13,687 INFO L435 NwaCegarLoop]: 908 mSDtfsCounter, 662 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:13,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 2030 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:05:13,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2025-01-09 10:05:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2949. [2025-01-09 10:05:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2202 states have (on average 1.5899182561307903) internal successors, (3501), 2221 states have internal predecessors, (3501), 722 states have call successors, (722), 24 states have call predecessors, (722), 24 states have return successors, (722), 703 states have call predecessors, (722), 722 states have call successors, (722) [2025-01-09 10:05:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4945 transitions. [2025-01-09 10:05:13,873 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4945 transitions. Word has length 706 [2025-01-09 10:05:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:13,874 INFO L471 AbstractCegarLoop]: Abstraction has 2949 states and 4945 transitions. [2025-01-09 10:05:13,874 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-01-09 10:05:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4945 transitions. [2025-01-09 10:05:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-01-09 10:05:13,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:13,881 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-01-09 10:05:13,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:05:13,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:13,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:13,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1240142133, now seen corresponding path program 1 times [2025-01-09 10:05:13,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:13,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463681023] [2025-01-09 10:05:13,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:13,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:13,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-01-09 10:05:13,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-01-09 10:05:13,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:13,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:14,512 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:05:14,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:14,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463681023] [2025-01-09 10:05:14,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463681023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:14,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:14,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:05:14,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90178530] [2025-01-09 10:05:14,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:14,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:05:14,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:14,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:05:14,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:05:14,514 INFO L87 Difference]: Start difference. First operand 2949 states and 4945 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-01-09 10:05:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:15,208 INFO L93 Difference]: Finished difference Result 14355 states and 24053 transitions. [2025-01-09 10:05:15,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:05:15,209 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-01-09 10:05:15,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:15,273 INFO L225 Difference]: With dead ends: 14355 [2025-01-09 10:05:15,273 INFO L226 Difference]: Without dead ends: 11409 [2025-01-09 10:05:15,284 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-01-09 10:05:15,285 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 1361 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:15,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 1961 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:05:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11409 states. [2025-01-09 10:05:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11409 to 11399. [2025-01-09 10:05:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11399 states, 8590 states have (on average 1.5809080325960418) internal successors, (13580), 8668 states have internal predecessors, (13580), 2712 states have call successors, (2712), 96 states have call predecessors, (2712), 96 states have return successors, (2712), 2634 states have call predecessors, (2712), 2712 states have call successors, (2712) [2025-01-09 10:05:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11399 states to 11399 states and 19004 transitions. [2025-01-09 10:05:16,042 INFO L78 Accepts]: Start accepts. Automaton has 11399 states and 19004 transitions. Word has length 707 [2025-01-09 10:05:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:16,043 INFO L471 AbstractCegarLoop]: Abstraction has 11399 states and 19004 transitions. [2025-01-09 10:05:16,043 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-01-09 10:05:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 11399 states and 19004 transitions. [2025-01-09 10:05:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-01-09 10:05:16,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:16,064 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-01-09 10:05:16,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:05:16,064 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:16,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:16,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1899673655, now seen corresponding path program 1 times [2025-01-09 10:05:16,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:16,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287560281] [2025-01-09 10:05:16,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:16,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:16,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-01-09 10:05:16,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-01-09 10:05:16,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:16,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:17,025 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 117 proven. 210 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-01-09 10:05:17,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287560281] [2025-01-09 10:05:17,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287560281] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:05:17,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679033768] [2025-01-09 10:05:17,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:17,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:17,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:17,029 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-01-09 10:05:17,031 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-01-09 10:05:17,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-01-09 10:05:17,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-01-09 10:05:17,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:17,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:17,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 1612 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:05:17,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:05:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11343 proven. 204 refuted. 0 times theorem prover too weak. 12433 trivial. 0 not checked. [2025-01-09 10:05:18,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:05:18,695 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 123 proven. 204 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-01-09 10:05:18,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679033768] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:05:18,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:05:18,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 10:05:18,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738779578] [2025-01-09 10:05:18,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:05:18,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:05:18,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:18,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:05:18,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:05:18,699 INFO L87 Difference]: Start difference. First operand 11399 states and 19004 transitions. Second operand has 8 states, 8 states have (on average 31.75) internal successors, (254), 8 states have internal predecessors, (254), 3 states have call successors, (248), 2 states have call predecessors, (248), 4 states have return successors, (250), 3 states have call predecessors, (250), 3 states have call successors, (250) [2025-01-09 10:05:19,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:19,653 INFO L93 Difference]: Finished difference Result 18107 states and 30125 transitions. [2025-01-09 10:05:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 10:05:19,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 31.75) internal successors, (254), 8 states have internal predecessors, (254), 3 states have call successors, (248), 2 states have call predecessors, (248), 4 states have return successors, (250), 3 states have call predecessors, (250), 3 states have call successors, (250) Word has length 707 [2025-01-09 10:05:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:19,719 INFO L225 Difference]: With dead ends: 18107 [2025-01-09 10:05:19,719 INFO L226 Difference]: Without dead ends: 6711 [2025-01-09 10:05:19,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1428 GetRequests, 1411 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2025-01-09 10:05:19,753 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 756 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:19,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1076 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:05:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6711 states. [2025-01-09 10:05:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6711 to 6583. [2025-01-09 10:05:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6583 states, 5006 states have (on average 1.5605273671594087) internal successors, (7812), 5044 states have internal predecessors, (7812), 1512 states have call successors, (1512), 64 states have call predecessors, (1512), 64 states have return successors, (1512), 1474 states have call predecessors, (1512), 1512 states have call successors, (1512) [2025-01-09 10:05:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6583 states to 6583 states and 10836 transitions. [2025-01-09 10:05:20,186 INFO L78 Accepts]: Start accepts. Automaton has 6583 states and 10836 transitions. Word has length 707 [2025-01-09 10:05:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:20,187 INFO L471 AbstractCegarLoop]: Abstraction has 6583 states and 10836 transitions. [2025-01-09 10:05:20,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 31.75) internal successors, (254), 8 states have internal predecessors, (254), 3 states have call successors, (248), 2 states have call predecessors, (248), 4 states have return successors, (250), 3 states have call predecessors, (250), 3 states have call successors, (250) [2025-01-09 10:05:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 6583 states and 10836 transitions. [2025-01-09 10:05:20,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-01-09 10:05:20,198 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:20,198 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-01-09 10:05:20,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 10:05:20,398 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,SelfDestructingSolverStorable7 [2025-01-09 10:05:20,399 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:20,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:20,400 INFO L85 PathProgramCache]: Analyzing trace with hash 100333809, now seen corresponding path program 1 times [2025-01-09 10:05:20,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:20,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062733011] [2025-01-09 10:05:20,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:20,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:20,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-01-09 10:05:20,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-01-09 10:05:20,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:20,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:21,265 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 264 proven. 63 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-01-09 10:05:21,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062733011] [2025-01-09 10:05:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062733011] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:05:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363592717] [2025-01-09 10:05:21,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:21,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:21,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:21,268 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-01-09 10:05:21,270 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-01-09 10:05:21,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-01-09 10:05:21,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-01-09 10:05:21,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:21,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:21,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:05:21,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:05:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 7677 proven. 63 refuted. 0 times theorem prover too weak. 16240 trivial. 0 not checked. [2025-01-09 10:05:21,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:05:22,403 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 264 proven. 63 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-01-09 10:05:22,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363592717] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:05:22,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:05:22,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 10:05:22,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371393677] [2025-01-09 10:05:22,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:05:22,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 10:05:22,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:22,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 10:05:22,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:05:22,407 INFO L87 Difference]: Start difference. First operand 6583 states and 10836 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-01-09 10:05:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:23,010 INFO L93 Difference]: Finished difference Result 10559 states and 17399 transitions. [2025-01-09 10:05:23,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:05:23,011 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-01-09 10:05:23,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:23,032 INFO L225 Difference]: With dead ends: 10559 [2025-01-09 10:05:23,032 INFO L226 Difference]: Without dead ends: 3979 [2025-01-09 10:05:23,050 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-01-09 10:05:23,051 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 360 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:23,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1079 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:05:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2025-01-09 10:05:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3915. [2025-01-09 10:05:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3915 states, 3102 states have (on average 1.5751128304319795) internal successors, (4886), 3120 states have internal predecessors, (4886), 778 states have call successors, (778), 34 states have call predecessors, (778), 34 states have return successors, (778), 760 states have call predecessors, (778), 778 states have call successors, (778) [2025-01-09 10:05:23,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 6442 transitions. [2025-01-09 10:05:23,259 INFO L78 Accepts]: Start accepts. Automaton has 3915 states and 6442 transitions. Word has length 707 [2025-01-09 10:05:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:23,260 INFO L471 AbstractCegarLoop]: Abstraction has 3915 states and 6442 transitions. [2025-01-09 10:05:23,260 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-01-09 10:05:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 6442 transitions. [2025-01-09 10:05:23,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-01-09 10:05:23,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:23,268 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-01-09 10:05:23,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 10:05:23,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:23,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:23,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:23,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1490124700, now seen corresponding path program 1 times [2025-01-09 10:05:23,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:23,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956842130] [2025-01-09 10:05:23,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:23,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:23,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-01-09 10:05:23,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-01-09 10:05:23,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:23,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:24,057 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 213 proven. 114 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-01-09 10:05:24,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:24,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956842130] [2025-01-09 10:05:24,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956842130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:05:24,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391548148] [2025-01-09 10:05:24,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:24,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:24,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:24,062 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-01-09 10:05:24,064 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-01-09 10:05:24,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-01-09 10:05:24,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-01-09 10:05:24,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:24,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:24,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 10:05:24,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:05:25,213 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11811 proven. 114 refuted. 0 times theorem prover too weak. 12055 trivial. 0 not checked. [2025-01-09 10:05:25,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:05:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 213 proven. 114 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-01-09 10:05:25,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391548148] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:05:25,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:05:25,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-09 10:05:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651714741] [2025-01-09 10:05:25,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:05:25,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:05:25,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:25,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:05:25,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:05:25,716 INFO L87 Difference]: Start difference. First operand 3915 states and 6442 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-01-09 10:05:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:26,412 INFO L93 Difference]: Finished difference Result 7907 states and 12957 transitions. [2025-01-09 10:05:26,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:05:26,413 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-01-09 10:05:26,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:26,429 INFO L225 Difference]: With dead ends: 7907 [2025-01-09 10:05:26,429 INFO L226 Difference]: Without dead ends: 3995 [2025-01-09 10:05:26,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1427 GetRequests, 1413 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:05:26,440 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 558 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:26,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1047 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:05:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2025-01-09 10:05:26,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 3931. [2025-01-09 10:05:26,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3931 states, 3114 states have (on average 1.5664739884393064) internal successors, (4878), 3132 states have internal predecessors, (4878), 778 states have call successors, (778), 38 states have call predecessors, (778), 38 states have return successors, (778), 760 states have call predecessors, (778), 778 states have call successors, (778) [2025-01-09 10:05:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3931 states to 3931 states and 6434 transitions. [2025-01-09 10:05:26,650 INFO L78 Accepts]: Start accepts. Automaton has 3931 states and 6434 transitions. Word has length 709 [2025-01-09 10:05:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:26,651 INFO L471 AbstractCegarLoop]: Abstraction has 3931 states and 6434 transitions. [2025-01-09 10:05:26,651 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-01-09 10:05:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3931 states and 6434 transitions. [2025-01-09 10:05:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-01-09 10:05:26,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:26,660 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-01-09 10:05:26,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 10:05:26,860 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,SelfDestructingSolverStorable9 [2025-01-09 10:05:26,860 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:26,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:26,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1215365086, now seen corresponding path program 1 times [2025-01-09 10:05:26,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:26,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851030242] [2025-01-09 10:05:26,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:26,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:26,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-01-09 10:05:27,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-01-09 10:05:27,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:27,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:05:27,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49097626] [2025-01-09 10:05:27,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:27,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:27,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:27,368 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-01-09 10:05:27,369 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-01-09 10:05:27,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-01-09 10:05:27,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-01-09 10:05:27,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:27,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:27,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 10:05:27,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:05:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:05:28,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:05:28,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851030242] [2025-01-09 10:05:28,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 10:05:28,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49097626] [2025-01-09 10:05:28,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49097626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:28,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:28,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:05:28,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095774155] [2025-01-09 10:05:28,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:28,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:05:28,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:28,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:05:28,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:05:28,356 INFO L87 Difference]: Start difference. First operand 3931 states and 6434 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-01-09 10:05:29,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:29,561 INFO L93 Difference]: Finished difference Result 14115 states and 23017 transitions. [2025-01-09 10:05:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:05:29,561 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-01-09 10:05:29,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:29,591 INFO L225 Difference]: With dead ends: 14115 [2025-01-09 10:05:29,591 INFO L226 Difference]: Without dead ends: 10187 [2025-01-09 10:05:29,602 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-01-09 10:05:29,603 INFO L435 NwaCegarLoop]: 909 mSDtfsCounter, 655 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:29,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 2183 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:05:29,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10187 states. [2025-01-09 10:05:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10187 to 9657. [2025-01-09 10:05:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9657 states, 7532 states have (on average 1.5533722782793415) internal successors, (11700), 7576 states have internal predecessors, (11700), 2018 states have call successors, (2018), 106 states have call predecessors, (2018), 106 states have return successors, (2018), 1974 states have call predecessors, (2018), 2018 states have call successors, (2018) [2025-01-09 10:05:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9657 states to 9657 states and 15736 transitions. [2025-01-09 10:05:30,163 INFO L78 Accepts]: Start accepts. Automaton has 9657 states and 15736 transitions. Word has length 709 [2025-01-09 10:05:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:30,168 INFO L471 AbstractCegarLoop]: Abstraction has 9657 states and 15736 transitions. [2025-01-09 10:05:30,168 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-01-09 10:05:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 9657 states and 15736 transitions. [2025-01-09 10:05:30,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-01-09 10:05:30,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:30,190 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-01-09 10:05:30,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 10:05:30,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:30,392 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:30,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:30,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2080811295, now seen corresponding path program 1 times [2025-01-09 10:05:30,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:30,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888600962] [2025-01-09 10:05:30,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:30,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:30,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-01-09 10:05:30,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-01-09 10:05:30,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:30,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:05:30,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:30,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888600962] [2025-01-09 10:05:30,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888600962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:30,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:30,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:30,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577132837] [2025-01-09 10:05:30,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:30,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:30,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:30,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:30,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:30,831 INFO L87 Difference]: Start difference. First operand 9657 states and 15736 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-01-09 10:05:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:31,626 INFO L93 Difference]: Finished difference Result 25583 states and 41584 transitions. [2025-01-09 10:05:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:31,627 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-01-09 10:05:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:31,686 INFO L225 Difference]: With dead ends: 25583 [2025-01-09 10:05:31,687 INFO L226 Difference]: Without dead ends: 15929 [2025-01-09 10:05:31,708 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-01-09 10:05:31,708 INFO L435 NwaCegarLoop]: 767 mSDtfsCounter, 355 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:31,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1303 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:31,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15929 states. [2025-01-09 10:05:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15929 to 15919. [2025-01-09 10:05:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15919 states, 12190 states have (on average 1.531583264971288) internal successors, (18670), 12258 states have internal predecessors, (18670), 3536 states have call successors, (3536), 192 states have call predecessors, (3536), 192 states have return successors, (3536), 3468 states have call predecessors, (3536), 3536 states have call successors, (3536) [2025-01-09 10:05:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15919 states to 15919 states and 25742 transitions. [2025-01-09 10:05:32,721 INFO L78 Accepts]: Start accepts. Automaton has 15919 states and 25742 transitions. Word has length 710 [2025-01-09 10:05:32,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:32,723 INFO L471 AbstractCegarLoop]: Abstraction has 15919 states and 25742 transitions. [2025-01-09 10:05:32,723 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-01-09 10:05:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 15919 states and 25742 transitions. [2025-01-09 10:05:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-01-09 10:05:32,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:32,739 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-01-09 10:05:32,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:05:32,739 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:32,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash -173981333, now seen corresponding path program 1 times [2025-01-09 10:05:32,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:32,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972956420] [2025-01-09 10:05:32,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:32,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:32,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-01-09 10:05:32,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-01-09 10:05:32,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:32,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:33,209 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:05:33,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:33,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972956420] [2025-01-09 10:05:33,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972956420] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:33,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:33,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:05:33,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18884711] [2025-01-09 10:05:33,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:33,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:05:33,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:33,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:05:33,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:05:33,212 INFO L87 Difference]: Start difference. First operand 15919 states and 25742 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-01-09 10:05:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:34,723 INFO L93 Difference]: Finished difference Result 37155 states and 60247 transitions. [2025-01-09 10:05:34,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:05:34,723 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-01-09 10:05:34,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:34,838 INFO L225 Difference]: With dead ends: 37155 [2025-01-09 10:05:34,838 INFO L226 Difference]: Without dead ends: 27501 [2025-01-09 10:05:34,862 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-01-09 10:05:34,863 INFO L435 NwaCegarLoop]: 931 mSDtfsCounter, 775 mSDsluCounter, 1849 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2780 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:34,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2780 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:05:34,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27501 states. [2025-01-09 10:05:35,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27501 to 14305. [2025-01-09 10:05:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14305 states, 10904 states have (on average 1.5264123257520177) internal successors, (16644), 10960 states have internal predecessors, (16644), 3220 states have call successors, (3220), 180 states have call predecessors, (3220), 180 states have return successors, (3220), 3164 states have call predecessors, (3220), 3220 states have call successors, (3220) [2025-01-09 10:05:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14305 states to 14305 states and 23084 transitions. [2025-01-09 10:05:35,954 INFO L78 Accepts]: Start accepts. Automaton has 14305 states and 23084 transitions. Word has length 710 [2025-01-09 10:05:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:35,955 INFO L471 AbstractCegarLoop]: Abstraction has 14305 states and 23084 transitions. [2025-01-09 10:05:35,955 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-01-09 10:05:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 14305 states and 23084 transitions. [2025-01-09 10:05:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-01-09 10:05:35,965 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:35,965 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-01-09 10:05:35,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:05:35,965 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:35,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:35,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1059987752, now seen corresponding path program 1 times [2025-01-09 10:05:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812876551] [2025-01-09 10:05:35,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:35,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-01-09 10:05:36,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-01-09 10:05:36,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:36,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-01-09 10:05:36,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:05:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812876551] [2025-01-09 10:05:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812876551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:05:36,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:05:36,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:05:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787943596] [2025-01-09 10:05:36,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:05:36,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:05:36,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:05:36,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:05:36,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:05:36,126 INFO L87 Difference]: Start difference. First operand 14305 states and 23084 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-01-09 10:05:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:05:37,894 INFO L93 Difference]: Finished difference Result 41829 states and 67346 transitions. [2025-01-09 10:05:37,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:05:37,895 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-01-09 10:05:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:05:37,994 INFO L225 Difference]: With dead ends: 41829 [2025-01-09 10:05:37,994 INFO L226 Difference]: Without dead ends: 27527 [2025-01-09 10:05:38,028 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-01-09 10:05:38,028 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 501 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:05:38,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 1084 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:05:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27527 states. [2025-01-09 10:05:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27527 to 16061. [2025-01-09 10:05:39,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16061 states, 12660 states have (on average 1.5338072669826224) internal successors, (19418), 12716 states have internal predecessors, (19418), 3220 states have call successors, (3220), 180 states have call predecessors, (3220), 180 states have return successors, (3220), 3164 states have call predecessors, (3220), 3220 states have call successors, (3220) [2025-01-09 10:05:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16061 states to 16061 states and 25858 transitions. [2025-01-09 10:05:39,562 INFO L78 Accepts]: Start accepts. Automaton has 16061 states and 25858 transitions. Word has length 710 [2025-01-09 10:05:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:05:39,563 INFO L471 AbstractCegarLoop]: Abstraction has 16061 states and 25858 transitions. [2025-01-09 10:05:39,563 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-01-09 10:05:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 16061 states and 25858 transitions. [2025-01-09 10:05:39,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-01-09 10:05:39,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:05:39,574 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-01-09 10:05:39,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 10:05:39,575 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:05:39,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:05:39,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1003900136, now seen corresponding path program 1 times [2025-01-09 10:05:39,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:05:39,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711732326] [2025-01-09 10:05:39,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:05:39,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-01-09 10:05:40,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-01-09 10:05:40,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:40,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:05:40,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [865484391] [2025-01-09 10:05:40,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:05:40,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:05:40,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:05:40,088 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:05:40,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 10:05:40,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-01-09 10:05:40,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-01-09 10:05:40,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:05:40,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:05:40,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 10:05:40,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:05:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 13440 proven. 255 refuted. 0 times theorem prover too weak. 10285 trivial. 0 not checked. [2025-01-09 10:05:42,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:06:04,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (mod c_~var_1_66~0 256))) (let ((.cse226 (+ c_~var_1_65~0 1)) (.cse31 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 2)) (.cse13 (mod c_~var_1_73~0 65536)) (.cse15 (* (- 1) .cse14))) (let ((.cse198 (forall ((v_z_24 Int)) (let ((.cse325 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse325 c_~var_1_65~0) .cse31) (not (= (mod .cse325 .cse13) 0)) (< (div .cse325 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse0 (< .cse13 .cse226)) (.cse155 (forall ((v_z_24 Int)) (let ((.cse323 (+ .cse15 v_z_24))) (let ((.cse324 (div .cse323 c_~var_1_65~0))) (or (< 8 v_z_24) (= (mod .cse323 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< .cse324 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse324)))))) (.cse9 (< c_~var_1_65~0 .cse13)) (.cse18 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 1))) (let ((.cse10 (forall ((v_z_24 Int)) (let ((.cse322 (+ .cse15 v_z_24))) (let ((.cse321 (div .cse322 c_~var_1_65~0))) (or (< 8 v_z_24) (< .cse321 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse321) (< (div .cse322 .cse13) .cse18) (not (= (mod .cse322 .cse13) 0))))))) (.cse27 (forall ((v_z_24 Int)) (let ((.cse318 (+ .cse15 v_z_24))) (let ((.cse319 (div .cse318 c_~var_1_65~0)) (.cse320 (div .cse318 .cse13))) (or (< 8 v_z_24) (= (mod .cse318 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< .cse319 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse319) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse320) (< .cse320 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse25 (forall ((v_z_24 Int)) (let ((.cse317 (+ .cse15 v_z_24))) (or (= (mod .cse317 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse317 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse317 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse52 (forall ((v_z_24 Int)) (let ((.cse315 (+ .cse15 v_z_24))) (let ((.cse316 (div .cse315 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse315 .cse13) 0) (< .cse316 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse316) (< (div .cse315 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse74 (or .cse9 (forall ((v_z_24 Int)) (let ((.cse314 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse314 c_~var_1_65~0) 0)) (< (div .cse314 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse314 .cse13) .cse18) (not (= (mod .cse314 .cse13) 0))))))) (.cse75 (or (forall ((v_z_24 Int)) (let ((.cse312 (+ .cse15 v_z_24))) (let ((.cse313 (div .cse312 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse312 c_~var_1_65~0) 0)) (< (div .cse312 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse313) (< .cse313 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9)) (.cse78 (forall ((v_z_24 Int)) (let ((.cse309 (+ .cse15 v_z_24))) (let ((.cse310 (div .cse309 c_~var_1_65~0)) (.cse311 (div .cse309 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse309 c_~var_1_65~0) 0)) (< .cse310 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse310) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse311) (< .cse311 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse81 (forall ((v_z_24 Int)) (let ((.cse307 (+ .cse15 v_z_24))) (let ((.cse308 (div .cse307 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse307 c_~var_1_65~0) 0)) (< .cse308 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse308) (< (div .cse307 .cse13) .cse18) (not (= (mod .cse307 .cse13) 0))))))) (.cse93 (forall ((v_z_24 Int)) (let ((.cse305 (+ .cse15 v_z_24))) (let ((.cse306 (div .cse305 c_~var_1_65~0))) (or (< 8 v_z_24) (= (mod .cse305 .cse13) 0) (< .cse306 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse306) (< (div .cse305 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse103 (forall ((v_z_24 Int)) (let ((.cse304 (+ .cse15 v_z_24))) (or (= (mod .cse304 c_~var_1_65~0) 0) (< 8 v_z_24) (= (mod .cse304 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse304 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse304 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse59 (forall ((v_z_24 Int)) (let ((.cse303 (+ .cse15 v_z_24))) (or (= (mod .cse303 c_~var_1_65~0) 0) (< 8 v_z_24) (= (mod .cse303 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse303 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse24 (forall ((v_z_24 Int)) (let ((.cse302 (+ .cse15 v_z_24))) (or (= (mod .cse302 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse302 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse94 (forall ((v_z_24 Int)) (let ((.cse300 (+ .cse15 v_z_24))) (let ((.cse301 (div .cse300 c_~var_1_65~0))) (or (< 8 v_z_24) (= (mod .cse300 .cse13) 0) (< .cse301 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse301)))))) (.cse58 (forall ((v_z_24 Int)) (let ((.cse299 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse299 c_~var_1_65~0) 0)) (< (div .cse299 c_~var_1_65~0) .cse18) (< v_z_24 0) (not (= (mod .cse299 .cse13) 0)))))) (.cse20 (forall ((v_z_24 Int)) (let ((.cse297 (+ .cse15 v_z_24))) (let ((.cse298 (div .cse297 c_~var_1_65~0))) (or (< 8 v_z_24) (= (mod .cse297 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< .cse298 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse298) (< (div .cse297 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse28 (or .cse0 .cse155)) (.cse51 (forall ((v_z_24 Int)) (let ((.cse294 (+ .cse15 v_z_24))) (let ((.cse295 (div .cse294 c_~var_1_65~0)) (.cse296 (div .cse294 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse294 .cse13) 0) (< .cse295 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse295) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse296) (< .cse296 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse138 (forall ((v_z_24 Int)) (let ((.cse292 (+ .cse15 v_z_24))) (let ((.cse293 (div .cse292 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse292 c_~var_1_65~0) 0)) (< .cse293 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse293) (< (div .cse292 .cse13) .cse18) (not (= (mod .cse292 .cse13) 0))))))) (.cse97 (forall ((v_z_24 Int)) (let ((.cse291 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse291 c_~var_1_65~0) 0)) (< (div .cse291 c_~var_1_65~0) .cse18))))) (.cse106 (forall ((v_z_24 Int)) (let ((.cse290 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< (div .cse290 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse290 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse107 (forall ((v_z_24 Int)) (or (< 8 v_z_24) (< (div (+ .cse15 v_z_24) c_~var_1_65~0) .cse31) (< v_z_24 0)))) (.cse120 (forall ((v_z_24 Int)) (let ((.cse289 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse289 c_~var_1_65~0) 0)) (< (div .cse289 c_~var_1_65~0) .cse18) (< v_z_24 0))))) (.cse156 (forall ((v_z_24 Int)) (let ((.cse288 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse288 c_~var_1_65~0) 0)) (= (mod .cse288 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse288 c_~var_1_65~0) .cse18) (< v_z_24 0))))) (.cse152 (forall ((v_z_24 Int)) (let ((.cse286 (+ .cse15 v_z_24))) (let ((.cse287 (div .cse286 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse286 c_~var_1_65~0) 0)) (= (mod .cse286 .cse13) 0) (< .cse287 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse287) (< (div .cse286 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse5 (forall ((v_z_24 Int)) (let ((.cse285 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse285 c_~var_1_65~0) 0)) (< (div .cse285 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse285 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse46 (forall ((v_z_24 Int)) (let ((.cse284 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse284 c_~var_1_65~0) 0)) (= (mod .cse284 .cse13) 0) (< (div .cse284 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse284 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse6 (forall ((v_z_24 Int)) (let ((.cse283 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse283 c_~var_1_65~0) 0)) (< (div .cse283 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse7 (forall ((v_z_24 Int)) (let ((.cse282 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse282 c_~var_1_65~0) 0)) (< (div .cse282 c_~var_1_65~0) .cse31) (< v_z_24 0) (not (= (mod .cse282 .cse13) 0)))))) (.cse8 (forall ((v_z_24 Int)) (let ((.cse281 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse281 c_~var_1_65~0) 0)) (< (div .cse281 c_~var_1_65~0) .cse31) (< v_z_24 0) (not (= (mod .cse281 .cse13) 0)) (< (div .cse281 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse49 (forall ((v_z_24 Int)) (let ((.cse280 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse280 c_~var_1_65~0) 0)) (= (mod .cse280 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse280 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse153 (forall ((v_z_24 Int)) (let ((.cse278 (+ .cse15 v_z_24))) (let ((.cse279 (div .cse278 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse278 c_~var_1_65~0) 0)) (= (mod .cse278 .cse13) 0) (< .cse279 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse279)))))) (.cse114 (forall ((v_z_24 Int)) (let ((.cse277 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse277 c_~var_1_65~0) 0)) (< (div .cse277 c_~var_1_65~0) .cse31) (< (div .cse277 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse161 (forall ((v_z_24 Int)) (let ((.cse276 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse276 c_~var_1_65~0) 0)) (= (mod .cse276 .cse13) 0) (< (div .cse276 c_~var_1_65~0) .cse31) (< (div .cse276 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse121 (forall ((v_z_24 Int)) (let ((.cse275 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse275 c_~var_1_65~0) 0)) (< (div .cse275 c_~var_1_65~0) .cse31))))) (.cse122 (forall ((v_z_24 Int)) (let ((.cse274 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse274 c_~var_1_65~0) 0)) (< (div .cse274 c_~var_1_65~0) .cse31) (not (= (mod .cse274 .cse13) 0)))))) (.cse169 (forall ((v_z_24 Int)) (let ((.cse273 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse273 c_~var_1_65~0) 0)) (= (mod .cse273 .cse13) 0) (< (div .cse273 c_~var_1_65~0) .cse31))))) (.cse98 (or .cse9 (forall ((v_z_24 Int)) (let ((.cse271 (+ .cse15 v_z_24))) (let ((.cse272 (div .cse271 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse271 c_~var_1_65~0) 0)) (< (div .cse271 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse272) (not (= (mod .cse271 .cse13) 0)) (< .cse272 |c_ULTIMATE.start_step_#t~bitwise5#1|))))))) (.cse99 (forall ((v_z_24 Int)) (let ((.cse268 (+ .cse15 v_z_24))) (let ((.cse269 (div .cse268 c_~var_1_65~0)) (.cse270 (div .cse268 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse268 c_~var_1_65~0) 0)) (< .cse269 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse269) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse270) (not (= (mod .cse268 .cse13) 0)) (< .cse270 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse83 (forall ((v_z_24 Int)) (let ((.cse265 (+ .cse15 v_z_24))) (let ((.cse266 (div .cse265 c_~var_1_65~0)) (.cse267 (div .cse265 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse265 c_~var_1_65~0) 0)) (< .cse266 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse266) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse267) (< .cse267 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse139 (or .cse0 (forall ((v_z_24 Int)) (let ((.cse263 (+ .cse15 v_z_24))) (let ((.cse264 (div .cse263 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse263 c_~var_1_65~0) 0)) (< .cse264 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse264) (not (= (mod .cse263 .cse13) 0)))))))) (.cse119 (forall ((v_z_24 Int)) (let ((.cse260 (+ .cse15 v_z_24))) (let ((.cse261 (div .cse260 c_~var_1_65~0)) (.cse262 (div .cse260 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse260 c_~var_1_65~0) 0)) (= (mod .cse260 .cse13) 0) (< .cse261 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse261) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse262) (< .cse262 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse2 (forall ((v_z_24 Int)) (let ((.cse257 (+ .cse15 v_z_24))) (let ((.cse258 (div .cse257 c_~var_1_65~0)) (.cse259 (div .cse257 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse257 c_~var_1_65~0) 0)) (= (mod .cse257 .cse13) 0) (< .cse258 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse258) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse259) (< .cse259 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse89 (forall ((v_z_24 Int)) (let ((.cse255 (+ .cse15 v_z_24))) (let ((.cse256 (div .cse255 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse255 c_~var_1_65~0) 0)) (= (mod .cse255 .cse13) 0) (< .cse256 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse256) (< (div .cse255 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse91 (forall ((v_z_24 Int)) (let ((.cse254 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse254 .cse13) 0) (< (div .cse254 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse254 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse92 (forall ((v_z_24 Int)) (let ((.cse253 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse253 .cse13) 0) (< (div .cse253 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse141 (forall ((v_z_24 Int)) (let ((.cse252 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse252 c_~var_1_65~0) 0)) (< (div .cse252 c_~var_1_65~0) .cse18) (< v_z_24 0) (< (div .cse252 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse125 (forall ((v_z_24 Int)) (let ((.cse251 (+ .cse15 v_z_24))) (let ((.cse249 (div .cse251 c_~var_1_65~0)) (.cse250 (div .cse251 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse249 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse249) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse250) (< .cse250 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse56 (or (forall ((v_z_24 Int)) (let ((.cse248 (+ .cse15 v_z_24))) (let ((.cse247 (div .cse248 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse247 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse247) (not (= (mod .cse248 .cse13) 0)))))) .cse0)) (.cse130 (or (forall ((v_z_24 Int)) (let ((.cse246 (div (+ .cse15 v_z_24) c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse246 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse246)))) .cse0)) (.cse132 (or (forall ((v_z_24 Int)) (let ((.cse245 (+ .cse15 v_z_24))) (let ((.cse244 (div .cse245 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse244 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse244) (< (div .cse245 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0)) (.cse57 (forall ((v_z_24 Int)) (let ((.cse243 (+ .cse15 v_z_24))) (let ((.cse242 (div .cse243 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse242 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse242) (< (div .cse243 .cse13) .cse18) (not (= (mod .cse243 .cse13) 0))))))) (.cse50 (forall ((v_z_24 Int)) (let ((.cse240 (+ .cse15 v_z_24))) (let ((.cse241 (div .cse240 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse240 .cse13) 0) (< .cse241 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse241)))))) (.cse154 (forall ((v_z_24 Int)) (let ((.cse239 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse239 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse239 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse96 (forall ((v_z_24 Int)) (let ((.cse238 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse238 .cse13) 0) (< (div .cse238 c_~var_1_65~0) .cse31) (< (div .cse238 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse1 (forall ((v_z_24 Int)) (let ((.cse237 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse237 .cse13) 0) (< (div .cse237 c_~var_1_65~0) .cse31))))) (.cse186 (forall ((v_z_24 Int)) (let ((.cse236 (+ .cse15 v_z_24))) (let ((.cse234 (div .cse236 c_~var_1_65~0)) (.cse235 (div .cse236 .cse13))) (or (< 8 v_z_24) (< .cse234 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse234) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse235) (< .cse235 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse11 (or (forall ((v_z_24 Int)) (let ((.cse233 (+ .cse15 v_z_24))) (let ((.cse232 (div .cse233 c_~var_1_65~0))) (or (< 8 v_z_24) (< .cse232 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse232) (not (= (mod .cse233 .cse13) 0)))))) .cse0)) (.cse177 (or (forall ((v_z_24 Int)) (let ((.cse231 (+ .cse15 v_z_24))) (let ((.cse230 (div .cse231 c_~var_1_65~0))) (or (< 8 v_z_24) (< .cse230 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse230) (not (= (mod .cse231 .cse13) 0)) (< (div .cse231 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0)) (.cse23 (forall ((v_z_24 Int)) (let ((.cse229 (+ .cse15 v_z_24))) (or (= (mod .cse229 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse229 c_~var_1_65~0) .cse31) (< v_z_24 0) (not (= (mod .cse229 .cse13) 0)))))) (.cse176 (forall ((v_z_24 Int)) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div (+ .cse15 v_z_24) c_~var_1_65~0) .cse18)))) (.cse133 (forall ((v_z_24 Int)) (let ((.cse228 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse228 c_~var_1_65~0) .cse31) (< (div .cse228 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse134 (forall ((v_z_24 Int)) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div (+ .cse15 v_z_24) c_~var_1_65~0) .cse31)))) (.cse16 (forall ((v_z_24 Int)) (let ((.cse227 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse227 c_~var_1_65~0) .cse31) (not (= (mod .cse227 .cse13) 0)))))) (.cse4 (< 0 .cse226)) (.cse100 (forall ((v_z_24 Int)) (let ((.cse225 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< (div .cse225 c_~var_1_65~0) .cse31) (< v_z_24 0) (not (= (mod .cse225 .cse13) 0)))))) (.cse40 (forall ((v_z_24 Int)) (let ((.cse224 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< (div .cse224 c_~var_1_65~0) .cse31) (< v_z_24 0) (not (= (mod .cse224 .cse13) 0)) (< (div .cse224 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse127 (or .cse9 (forall ((v_z_24 Int)) (let ((.cse222 (+ .cse15 v_z_24))) (let ((.cse223 (div .cse222 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse222 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse223) (not (= (mod .cse222 .cse13) 0)) (< .cse223 |c_ULTIMATE.start_step_#t~bitwise5#1|))))))) (.cse146 (forall ((v_z_24 Int)) (let ((.cse220 (+ .cse15 v_z_24))) (let ((.cse221 (div .cse220 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse220 c_~var_1_65~0) .cse31) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse221) (not (= (mod .cse220 .cse13) 0)) (< .cse221 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse131 (forall ((v_z_24 Int)) (let ((.cse219 (+ .cse15 v_z_24))) (let ((.cse217 (div .cse219 c_~var_1_65~0)) (.cse218 (div .cse219 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse217 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse217) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse218) (not (= (mod .cse219 .cse13) 0)) (< .cse218 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse147 (or .cse0 .cse198)) (.cse47 (forall ((v_z_24 Int)) (let ((.cse216 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse216 c_~var_1_65~0) 0)) (= (mod .cse216 .cse13) 0) (< (div .cse216 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse181 (forall ((v_z_24 Int)) (let ((.cse214 (+ .cse15 v_z_24))) (let ((.cse215 (div .cse214 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse214 c_~var_1_65~0) 0)) (= (mod .cse214 .cse13) 0) (< .cse215 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse215)))))) (.cse38 (forall ((v_z_24 Int)) (let ((.cse212 (+ .cse15 v_z_24))) (let ((.cse213 (div .cse212 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse212 c_~var_1_65~0) 0)) (= (mod .cse212 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< .cse213 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse213) (< (div .cse212 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse55 (forall ((v_z_24 Int)) (let ((.cse210 (+ .cse15 v_z_24))) (let ((.cse211 (div .cse210 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse210 c_~var_1_65~0) 0)) (= (mod .cse210 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< .cse211 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse211)))))) (.cse3 (< c_~var_1_65~0 0)) (.cse178 (forall ((v_z_24 Int)) (let ((.cse209 (+ .cse15 v_z_24))) (let ((.cse207 (div .cse209 c_~var_1_65~0)) (.cse208 (div .cse209 .cse13))) (or (< 8 v_z_24) (< .cse207 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse207) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse208) (not (= (mod .cse209 .cse13) 0)) (< .cse208 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse95 (forall ((v_z_24 Int)) (let ((.cse204 (+ .cse15 v_z_24))) (let ((.cse205 (div .cse204 c_~var_1_65~0)) (.cse206 (div .cse204 .cse13))) (or (< 8 v_z_24) (= (mod .cse204 .cse13) 0) (< .cse205 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse205) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse206) (< .cse206 |c_ULTIMATE.start_step_#t~bitwise5#1|))))))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse4 (and .cse5 .cse6 .cse7 .cse8)) (or .cse9 .cse10) (or (and .cse11 .cse10) .cse3) (or .cse0 .cse7) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse12 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse12 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse12 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse12 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse16 .cse0) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse17 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 0) (< (div .cse17 .cse13) .cse18) (not (= (mod .cse17 .cse13) 0)))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse19 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse19 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse19 .cse13) .cse18) (not (= (mod .cse19 .cse13) 0)))))) (or .cse20 .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse21 (+ .cse15 v_z_24))) (let ((.cse22 (div .cse21 .cse13))) (or (< 8 v_z_24) (< (div .cse21 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse22) (< .cse22 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse4 (and .cse23 .cse24 .cse25)) (or (forall ((v_z_24 Int)) (let ((.cse26 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse26 c_~var_1_65~0) 0)) (< (div .cse26 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse26 .cse13) .cse18)))) .cse9) (or (and .cse27 (or .cse20 .cse0) .cse28) .cse3) (forall ((v_z_24 Int)) (let ((.cse29 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse29 c_~var_1_65~0) 0)) (< (div .cse29 c_~var_1_65~0) .cse18) (< v_z_24 0) (< (div .cse29 .cse13) .cse18) (not (= (mod .cse29 .cse13) 0))))) (forall ((v_z_24 Int)) (let ((.cse30 (+ .cse15 v_z_24))) (let ((.cse32 (div .cse30 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse30 c_~var_1_65~0) .cse31) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse32) (< .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse33 (+ .cse15 v_z_24))) (let ((.cse34 (div .cse33 .cse13))) (or (< 8 v_z_24) (= (mod .cse33 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse34) (< .cse34 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (forall ((v_z_24 Int)) (let ((.cse35 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse35 c_~var_1_65~0) .cse31) (< (div .cse35 .cse13) .cse18) (not (= (mod .cse35 .cse13) 0))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse36 (+ .cse15 v_z_24))) (let ((.cse37 (div .cse36 .cse13))) (or (< 8 v_z_24) (= (mod .cse36 .cse13) 0) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse37) (< .cse37 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse38 .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse39 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse39 c_~var_1_65~0) 0)) (< (div .cse39 .cse13) .cse18))))) (or .cse38 .cse9) (or .cse0 .cse40) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse41 (+ .cse15 v_z_24))) (let ((.cse42 (div .cse41 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse41 c_~var_1_65~0) 0)) (= (mod .cse41 .cse13) 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse42) (< .cse42 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse43 (+ .cse15 v_z_24))) (let ((.cse44 (div .cse43 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse43 c_~var_1_65~0) 0)) (= (mod .cse43 .cse13) 0) (< (div .cse43 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse44) (< .cse44 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse45 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse45 c_~var_1_65~0) 0)) (< v_z_24 0) (< (div .cse45 .cse13) .cse18) (not (= (mod .cse45 .cse13) 0)))))) (or (and .cse46 .cse47) .cse4) (or (forall ((v_z_24 Int)) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div (+ .cse15 v_z_24) .cse13) .cse18))) .cse9) (or (forall ((v_z_24 Int)) (let ((.cse48 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse48 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse48 .cse13) .cse18)))) .cse9) (or .cse4 .cse49) (or (and (or .cse50 .cse0) .cse51 (or .cse52 .cse0)) .cse3) (forall ((v_z_24 Int)) (let ((.cse53 (+ .cse15 v_z_24))) (let ((.cse54 (div .cse53 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse53 c_~var_1_65~0) 0)) (= (mod .cse53 .cse13) 0) (< (div .cse53 c_~var_1_65~0) .cse31) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse54) (< .cse54 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse9 .cse27) (or .cse0 (and (or .cse55 .cse3) .cse49)) (or (and .cse56 .cse57) .cse3) (or .cse4 .cse58) (or .cse4 .cse59) (or .cse20 .cse9) (forall ((v_z_24 Int)) (let ((.cse60 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse60 c_~var_1_65~0) 0)) (< (div .cse60 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse60 .cse13) .cse18) (not (= (mod .cse60 .cse13) 0))))) (forall ((v_z_24 Int)) (let ((.cse61 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse61 c_~var_1_65~0) 0)) (= (mod .cse61 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse61 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse61 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) (or (and (forall ((v_z_24 Int)) (let ((.cse62 (+ .cse15 v_z_24))) (or (= (mod .cse62 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse62 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse62 .cse13) .cse18) (not (= (mod .cse62 .cse13) 0))))) (or (forall ((v_z_24 Int)) (let ((.cse63 (+ .cse15 v_z_24))) (or (= (mod .cse63 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse63 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0)))) .cse0) (forall ((v_z_24 Int)) (let ((.cse64 (+ .cse15 v_z_24))) (let ((.cse65 (div .cse64 .cse13))) (or (= (mod .cse64 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse64 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse65) (< .cse65 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or (forall ((v_z_24 Int)) (let ((.cse66 (+ .cse15 v_z_24))) (or (= (mod .cse66 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse66 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (not (= (mod .cse66 .cse13) 0))))) .cse0) (or (forall ((v_z_24 Int)) (let ((.cse67 (+ .cse15 v_z_24))) (or (= (mod .cse67 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse67 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse67 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) .cse0)) .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse68 (+ .cse15 v_z_24))) (let ((.cse69 (div .cse68 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse68 c_~var_1_65~0) 0)) (= (mod .cse68 .cse13) 0) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse69) (< .cse69 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse70 (+ .cse15 v_z_24))) (let ((.cse71 (div .cse70 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse70 .cse13) 0) (< (div .cse70 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse71) (< .cse71 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse51 .cse3) (or (and (or (forall ((v_z_24 Int)) (let ((.cse72 (+ .cse15 v_z_24))) (let ((.cse73 (div .cse72 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse72 c_~var_1_65~0) 0)) (< .cse73 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse73))))) .cse0) .cse74 .cse75 (or (forall ((v_z_24 Int)) (let ((.cse76 (+ .cse15 v_z_24))) (let ((.cse77 (div .cse76 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse76 c_~var_1_65~0) 0)) (< .cse77 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse77) (not (= (mod .cse76 .cse13) 0)))))) .cse0) .cse78 (or (forall ((v_z_24 Int)) (let ((.cse79 (+ .cse15 v_z_24))) (let ((.cse80 (div .cse79 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse79 c_~var_1_65~0) 0)) (< .cse80 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse80) (< (div .cse79 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0) .cse81) .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse82 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse82 .cse13) .cse18) (not (= (mod .cse82 .cse13) 0)))))) (or .cse0 .cse25) (or .cse9 .cse83) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse84 (+ .cse15 v_z_24))) (let ((.cse85 (div .cse84 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse84 c_~var_1_65~0) 0)) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse85) (< .cse85 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or (forall ((v_z_24 Int)) (let ((.cse86 (div (+ .cse15 v_z_24) .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse86) (< .cse86 |c_ULTIMATE.start_step_#t~bitwise5#1|)))) .cse9) (forall ((v_z_24 Int)) (let ((.cse87 (+ .cse15 v_z_24))) (let ((.cse88 (div .cse87 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse87 c_~var_1_65~0) 0)) (< (div .cse87 c_~var_1_65~0) .cse31) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse88) (< .cse88 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse4 (and .cse5 .cse46 .cse47 .cse6 .cse7 .cse8)) (or .cse0 (and .cse46 (or .cse89 .cse3))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse90 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse90 c_~var_1_65~0) 0)) (< (div .cse90 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse90 .cse13) .cse18) (not (= (mod .cse90 .cse13) 0)))))) (or .cse4 (and .cse91 .cse92)) (or (and (or .cse0 .cse93) (or .cse0 .cse94) .cse95) .cse3) (or .cse0 (and .cse96 (or .cse52 .cse3))) (or .cse0 .cse97) (or .cse96 .cse0) (or (and .cse98 (or .cse9 .cse99)) .cse3) (or .cse0 .cse8) (or (and .cse74 .cse75 (or .cse9 .cse78) (or .cse9 .cse81)) .cse3) (or .cse100 .cse0) (or .cse4 .cse7) (or (and (or .cse93 .cse3) .cse91) .cse0) (or (forall ((v_z_24 Int)) (let ((.cse101 (+ .cse15 v_z_24))) (let ((.cse102 (div .cse101 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse101 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse102) (< .cse102 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9) (or .cse9 .cse103) (forall ((v_z_24 Int)) (let ((.cse104 (+ .cse15 v_z_24))) (let ((.cse105 (div .cse104 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse104 c_~var_1_65~0) 0)) (< (div .cse104 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse105) (< .cse105 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse0 .cse6) (or .cse4 (and .cse100 .cse106 .cse107 .cse40)) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse108 (+ .cse15 v_z_24))) (or (= (mod .cse108 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse108 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse108 .cse13) .cse18))))) (or (forall ((v_z_24 Int)) (let ((.cse109 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse109 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< v_z_24 0) (< (div .cse109 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) .cse9) (forall ((v_z_24 Int)) (let ((.cse110 (+ .cse15 v_z_24))) (let ((.cse111 (div .cse110 .cse13))) (or (< 8 v_z_24) (= (mod .cse110 .cse13) 0) (< (div .cse110 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse111) (< .cse111 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or (and .cse96 .cse1) .cse4) (forall ((v_z_24 Int)) (let ((.cse112 (+ .cse15 v_z_24))) (let ((.cse113 (div .cse112 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse112 c_~var_1_65~0) 0)) (< (div .cse112 c_~var_1_65~0) .cse18) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse113) (< .cse113 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse114 .cse0) (or .cse103 .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse115 (+ .cse15 v_z_24))) (let ((.cse116 (div .cse115 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse115 c_~var_1_65~0) 0)) (= (mod .cse115 .cse13) 0) (< (div .cse115 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse116) (< .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (forall ((v_z_24 Int)) (let ((.cse117 (+ .cse15 v_z_24))) (let ((.cse118 (div .cse117 .cse13))) (or (< 8 v_z_24) (= (mod .cse117 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse117 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse118) (< .cse118 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse9 .cse119) (or .cse120 .cse0) (or .cse4 .cse16) (or .cse100 .cse4) (or .cse4 (and .cse114 .cse121 .cse122)) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse123 (+ .cse15 v_z_24))) (or (= (mod .cse123 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< v_z_24 0) (< (div .cse123 .cse13) .cse18))))) (or .cse0 (and .cse59 (or (forall ((v_z_24 Int)) (let ((.cse124 (+ .cse15 v_z_24))) (or (= (mod .cse124 c_~var_1_65~0) 0) (< 8 v_z_24) (= (mod .cse124 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse124 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0)))) .cse3))) (or .cse125 .cse9) (or (forall ((v_z_24 Int)) (let ((.cse126 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< (div .cse126 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse126 .cse13) .cse18) (not (= (mod .cse126 .cse13) 0))))) .cse9) (or (and .cse125 .cse127 (or (forall ((v_z_24 Int)) (let ((.cse129 (+ .cse15 v_z_24))) (let ((.cse128 (div .cse129 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse128 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse128) (not (= (mod .cse129 .cse13) 0)) (< (div .cse129 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0) .cse56 .cse130 .cse131 .cse132) .cse3) (or .cse2 .cse9) (or .cse107 .cse0) (or .cse4 (and .cse133 .cse134 .cse16)) (or .cse5 .cse0) (forall ((v_z_24 Int)) (let ((.cse135 (+ .cse15 v_z_24))) (or (= (mod .cse135 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse135 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse135 .cse13) .cse18) (not (= (mod .cse135 .cse13) 0))))) (or .cse0 .cse24) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse137 (+ .cse15 v_z_24))) (let ((.cse136 (div .cse137 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse136 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse136) (< (div .cse137 .cse13) .cse18)))))) (or .cse106 .cse0) (or (and .cse138 .cse139) .cse3) (or (and (or .cse94 .cse3) .cse92) .cse0) (or .cse58 .cse0) (or (and .cse100 .cse106 .cse91 .cse107 .cse92 .cse40) .cse4) (or (and .cse20 .cse28) .cse3) (or .cse134 .cse0) (forall ((v_z_24 Int)) (let ((.cse140 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse140 c_~var_1_65~0) .cse18) (< (div .cse140 .cse13) .cse18)))) (or .cse4 (and .cse120 .cse141)) (or .cse9 .cse51) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse142 (+ .cse15 v_z_24))) (let ((.cse143 (div .cse142 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse142 c_~var_1_65~0) 0)) (< .cse143 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse143) (< (div .cse142 .cse13) .cse18)))))) (forall ((v_z_24 Int)) (let ((.cse144 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse144 c_~var_1_65~0) 0)) (< (div .cse144 c_~var_1_65~0) .cse31) (< (div .cse144 .cse13) .cse18) (not (= (mod .cse144 .cse13) 0))))) (forall ((v_z_24 Int)) (let ((.cse145 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse145 c_~var_1_65~0) 0)) (= (mod .cse145 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse145 c_~var_1_65~0) .cse18) (< v_z_24 0) (< (div .cse145 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) (or (and .cse146 .cse147) .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse148 (+ .cse15 v_z_24))) (let ((.cse149 (div .cse148 .cse13))) (or (< 8 v_z_24) (< (div .cse148 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse149) (not (= (mod .cse148 .cse13) 0)) (< .cse149 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse150 (+ .cse15 v_z_24))) (let ((.cse151 (div .cse150 .cse13))) (or (< 8 v_z_24) (= (mod .cse150 .cse13) 0) (< (div .cse150 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse151) (< .cse151 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse0 .cse122) (or .cse138 .cse9) (or .cse121 .cse0) (or .cse4 .cse97) (or (and .cse119 (or .cse152 .cse0) (or .cse153 .cse0)) .cse3) (or (and .cse100 .cse106 .cse91 .cse107 .cse92 .cse154 .cse40) .cse4) (or (and (or .cse155 .cse3) .cse154) .cse0) (or .cse0 .cse156) (forall ((v_z_24 Int)) (let ((.cse157 (+ .cse15 v_z_24))) (let ((.cse158 (div .cse157 .cse13))) (or (< 8 v_z_24) (< (div .cse157 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse158) (< .cse158 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (forall ((v_z_24 Int)) (let ((.cse159 (+ .cse15 v_z_24))) (let ((.cse160 (div .cse159 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse159 c_~var_1_65~0) 0)) (= (mod .cse159 .cse13) 0) (< (div .cse159 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse160) (< .cse160 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse0 .cse154) (or (and .cse120 .cse141 .cse156) .cse4) (or (and (or .cse152 .cse3) .cse161) .cse0) (or .cse133 .cse0) (forall ((v_z_24 Int)) (let ((.cse162 (+ .cse15 v_z_24))) (let ((.cse163 (div .cse162 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse162 .cse13) 0) (< (div .cse162 c_~var_1_65~0) .cse31) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse163) (< .cse163 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse164 (div (+ .cse15 v_z_24) .cse13))) (or (< 8 v_z_24) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse164) (< .cse164 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or (and .cse5 .cse46 .cse47 .cse6 .cse7 (forall ((v_z_24 Int)) (let ((.cse165 (+ .cse15 v_z_24))) (let ((.cse166 (div .cse165 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse165 c_~var_1_65~0) 0)) (= (mod .cse165 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse165 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse166) (< .cse166 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse8 .cse49) .cse4) (forall ((v_z_24 Int)) (let ((.cse167 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< (div .cse167 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse167 .cse13) .cse18) (not (= (mod .cse167 .cse13) 0))))) (forall ((v_z_24 Int)) (let ((.cse168 (+ .cse15 v_z_24))) (or (= (mod .cse168 c_~var_1_65~0) 0) (< 8 v_z_24) (= (mod .cse168 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse168 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse168 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) (or (and (or .cse153 .cse3) .cse169) .cse0) (or .cse4 (and .cse161 .cse169)) (or (and .cse114 .cse161 .cse121 .cse122 .cse169) .cse4) (or (and .cse98 (or (forall ((v_z_24 Int)) (let ((.cse170 (+ .cse15 v_z_24))) (let ((.cse171 (div .cse170 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse170 c_~var_1_65~0) 0)) (< .cse171 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse171) (not (= (mod .cse170 .cse13) 0)) (< (div .cse170 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0) .cse99 (or .cse0 (forall ((v_z_24 Int)) (let ((.cse172 (+ .cse15 v_z_24))) (let ((.cse173 (div .cse172 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse172 c_~var_1_65~0) 0)) (< .cse173 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse173)))))) .cse83 .cse139 (or (forall ((v_z_24 Int)) (let ((.cse174 (+ .cse15 v_z_24))) (let ((.cse175 (div .cse174 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse174 c_~var_1_65~0) 0)) (< .cse175 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse175) (< (div .cse174 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0)) .cse3) (or .cse176 .cse0) (or (and .cse11 .cse177 .cse178) .cse3) (or .cse95 .cse3) (or (forall ((v_z_24 Int)) (let ((.cse179 (+ .cse15 v_z_24))) (let ((.cse180 (div .cse179 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse179 .cse13) 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse180) (< .cse180 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9) (or .cse119 .cse3) (or (and .cse2 (or .cse0 .cse89) (or .cse181 .cse0)) .cse3) (forall ((v_z_24 Int)) (let ((.cse182 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse182 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse182 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse182 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse183 (+ .cse15 v_z_24))) (or (= (mod .cse183 c_~var_1_65~0) 0) (< 8 v_z_24) (= (mod .cse183 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< v_z_24 0) (< (div .cse183 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse91 .cse0) (forall ((v_z_24 Int)) (let ((.cse184 (+ .cse15 v_z_24))) (let ((.cse185 (div .cse184 .cse13))) (or (= (mod .cse184 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse184 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse185) (< .cse185 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse186 .cse9) (or .cse0 .cse92) (or .cse141 .cse0) (or (and .cse125 .cse56 .cse57 .cse130 .cse132) .cse3) (forall ((v_z_24 Int)) (let ((.cse187 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse187 c_~var_1_65~0) 0)) (< (div .cse187 c_~var_1_65~0) .cse18) (< (div .cse187 .cse13) .cse18)))) (or (forall ((v_z_24 Int)) (let ((.cse188 (+ .cse15 v_z_24))) (let ((.cse189 (div .cse188 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse188 c_~var_1_65~0) 0)) (< (div .cse188 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse189) (< .cse189 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9) (or (forall ((v_z_24 Int)) (let ((.cse190 (+ .cse15 v_z_24))) (let ((.cse191 (div .cse190 .cse13))) (or (< 8 v_z_24) (= (mod .cse190 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse190 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse191) (< .cse191 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9) (or .cse9 .cse57) (forall ((v_z_24 Int)) (let ((.cse192 (+ .cse15 v_z_24))) (let ((.cse193 (div .cse192 .cse13))) (or (< 8 v_z_24) (< (div .cse192 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse193) (not (= (mod .cse192 .cse13) 0)) (< .cse193 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or (and (or .cse50 .cse3) .cse1) .cse0) (or .cse4 .cse154) (or .cse4 (and .cse133 .cse134 .cse16 .cse96 .cse1)) (or (and .cse186 (or (forall ((v_z_24 Int)) (let ((.cse195 (+ .cse15 v_z_24))) (let ((.cse194 (div .cse195 c_~var_1_65~0))) (or (< 8 v_z_24) (< .cse194 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse194) (< (div .cse195 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0) (or .cse0 (forall ((v_z_24 Int)) (let ((.cse196 (div (+ .cse15 v_z_24) c_~var_1_65~0))) (or (< 8 v_z_24) (< .cse196 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse196))))) .cse11 .cse177 .cse178) .cse3) (or .cse23 .cse0) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse197 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse197 c_~var_1_65~0) 0)) (= (mod .cse197 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse197 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse197 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse176 .cse4) (or .cse4 (and .cse133 .cse146 .cse134 .cse16 .cse198)) (or .cse4 (and .cse100 .cse40)) (forall ((v_z_24 Int)) (let ((.cse199 (+ .cse15 v_z_24))) (let ((.cse200 (div .cse199 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse199 c_~var_1_65~0) 0)) (< (div .cse199 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse200) (not (= (mod .cse199 .cse13) 0)) (< .cse200 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or (and .cse127 .cse146 (or .cse9 .cse131) .cse147) .cse3) (or (forall ((v_z_24 Int)) (let ((.cse202 (+ .cse15 v_z_24))) (let ((.cse201 (div .cse202 .cse13))) (or (< 8 v_z_24) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse201) (not (= (mod .cse202 .cse13) 0)) (< .cse201 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9) (or (forall ((v_z_24 Int)) (let ((.cse203 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse203 c_~var_1_65~0) 0)) (= (mod .cse203 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< v_z_24 0) (< (div .cse203 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) .cse9) (or .cse0 (and .cse47 (or .cse181 .cse3))) (or (and .cse38 (or .cse55 .cse0)) .cse3) (or .cse9 .cse178) (or .cse9 .cse95)))))) is different from false [2025-01-09 10:06:08,398 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 (mod c_~var_1_66~0 256))) (let ((.cse226 (+ c_~var_1_65~0 1)) (.cse31 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 2)) (.cse13 (mod c_~var_1_73~0 65536)) (.cse15 (* (- 1) .cse14))) (let ((.cse198 (forall ((v_z_24 Int)) (let ((.cse325 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse325 c_~var_1_65~0) .cse31) (not (= (mod .cse325 .cse13) 0)) (< (div .cse325 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse0 (< .cse13 .cse226)) (.cse155 (forall ((v_z_24 Int)) (let ((.cse323 (+ .cse15 v_z_24))) (let ((.cse324 (div .cse323 c_~var_1_65~0))) (or (< 8 v_z_24) (= (mod .cse323 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< .cse324 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse324)))))) (.cse9 (< c_~var_1_65~0 .cse13)) (.cse18 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 1))) (let ((.cse10 (forall ((v_z_24 Int)) (let ((.cse322 (+ .cse15 v_z_24))) (let ((.cse321 (div .cse322 c_~var_1_65~0))) (or (< 8 v_z_24) (< .cse321 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse321) (< (div .cse322 .cse13) .cse18) (not (= (mod .cse322 .cse13) 0))))))) (.cse27 (forall ((v_z_24 Int)) (let ((.cse318 (+ .cse15 v_z_24))) (let ((.cse319 (div .cse318 c_~var_1_65~0)) (.cse320 (div .cse318 .cse13))) (or (< 8 v_z_24) (= (mod .cse318 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< .cse319 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse319) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse320) (< .cse320 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse25 (forall ((v_z_24 Int)) (let ((.cse317 (+ .cse15 v_z_24))) (or (= (mod .cse317 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse317 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse317 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse52 (forall ((v_z_24 Int)) (let ((.cse315 (+ .cse15 v_z_24))) (let ((.cse316 (div .cse315 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse315 .cse13) 0) (< .cse316 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse316) (< (div .cse315 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse74 (or .cse9 (forall ((v_z_24 Int)) (let ((.cse314 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse314 c_~var_1_65~0) 0)) (< (div .cse314 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse314 .cse13) .cse18) (not (= (mod .cse314 .cse13) 0))))))) (.cse75 (or (forall ((v_z_24 Int)) (let ((.cse312 (+ .cse15 v_z_24))) (let ((.cse313 (div .cse312 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse312 c_~var_1_65~0) 0)) (< (div .cse312 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse313) (< .cse313 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9)) (.cse78 (forall ((v_z_24 Int)) (let ((.cse309 (+ .cse15 v_z_24))) (let ((.cse310 (div .cse309 c_~var_1_65~0)) (.cse311 (div .cse309 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse309 c_~var_1_65~0) 0)) (< .cse310 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse310) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse311) (< .cse311 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse81 (forall ((v_z_24 Int)) (let ((.cse307 (+ .cse15 v_z_24))) (let ((.cse308 (div .cse307 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse307 c_~var_1_65~0) 0)) (< .cse308 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse308) (< (div .cse307 .cse13) .cse18) (not (= (mod .cse307 .cse13) 0))))))) (.cse93 (forall ((v_z_24 Int)) (let ((.cse305 (+ .cse15 v_z_24))) (let ((.cse306 (div .cse305 c_~var_1_65~0))) (or (< 8 v_z_24) (= (mod .cse305 .cse13) 0) (< .cse306 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse306) (< (div .cse305 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse103 (forall ((v_z_24 Int)) (let ((.cse304 (+ .cse15 v_z_24))) (or (= (mod .cse304 c_~var_1_65~0) 0) (< 8 v_z_24) (= (mod .cse304 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse304 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse304 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse59 (forall ((v_z_24 Int)) (let ((.cse303 (+ .cse15 v_z_24))) (or (= (mod .cse303 c_~var_1_65~0) 0) (< 8 v_z_24) (= (mod .cse303 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse303 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse24 (forall ((v_z_24 Int)) (let ((.cse302 (+ .cse15 v_z_24))) (or (= (mod .cse302 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse302 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse94 (forall ((v_z_24 Int)) (let ((.cse300 (+ .cse15 v_z_24))) (let ((.cse301 (div .cse300 c_~var_1_65~0))) (or (< 8 v_z_24) (= (mod .cse300 .cse13) 0) (< .cse301 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse301)))))) (.cse58 (forall ((v_z_24 Int)) (let ((.cse299 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse299 c_~var_1_65~0) 0)) (< (div .cse299 c_~var_1_65~0) .cse18) (< v_z_24 0) (not (= (mod .cse299 .cse13) 0)))))) (.cse20 (forall ((v_z_24 Int)) (let ((.cse297 (+ .cse15 v_z_24))) (let ((.cse298 (div .cse297 c_~var_1_65~0))) (or (< 8 v_z_24) (= (mod .cse297 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< .cse298 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse298) (< (div .cse297 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse28 (or .cse0 .cse155)) (.cse51 (forall ((v_z_24 Int)) (let ((.cse294 (+ .cse15 v_z_24))) (let ((.cse295 (div .cse294 c_~var_1_65~0)) (.cse296 (div .cse294 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse294 .cse13) 0) (< .cse295 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse295) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse296) (< .cse296 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse138 (forall ((v_z_24 Int)) (let ((.cse292 (+ .cse15 v_z_24))) (let ((.cse293 (div .cse292 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse292 c_~var_1_65~0) 0)) (< .cse293 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse293) (< (div .cse292 .cse13) .cse18) (not (= (mod .cse292 .cse13) 0))))))) (.cse97 (forall ((v_z_24 Int)) (let ((.cse291 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse291 c_~var_1_65~0) 0)) (< (div .cse291 c_~var_1_65~0) .cse18))))) (.cse106 (forall ((v_z_24 Int)) (let ((.cse290 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< (div .cse290 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse290 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse107 (forall ((v_z_24 Int)) (or (< 8 v_z_24) (< (div (+ .cse15 v_z_24) c_~var_1_65~0) .cse31) (< v_z_24 0)))) (.cse120 (forall ((v_z_24 Int)) (let ((.cse289 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse289 c_~var_1_65~0) 0)) (< (div .cse289 c_~var_1_65~0) .cse18) (< v_z_24 0))))) (.cse156 (forall ((v_z_24 Int)) (let ((.cse288 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse288 c_~var_1_65~0) 0)) (= (mod .cse288 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse288 c_~var_1_65~0) .cse18) (< v_z_24 0))))) (.cse152 (forall ((v_z_24 Int)) (let ((.cse286 (+ .cse15 v_z_24))) (let ((.cse287 (div .cse286 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse286 c_~var_1_65~0) 0)) (= (mod .cse286 .cse13) 0) (< .cse287 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse287) (< (div .cse286 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse5 (forall ((v_z_24 Int)) (let ((.cse285 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse285 c_~var_1_65~0) 0)) (< (div .cse285 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse285 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse46 (forall ((v_z_24 Int)) (let ((.cse284 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse284 c_~var_1_65~0) 0)) (= (mod .cse284 .cse13) 0) (< (div .cse284 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse284 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse6 (forall ((v_z_24 Int)) (let ((.cse283 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse283 c_~var_1_65~0) 0)) (< (div .cse283 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse7 (forall ((v_z_24 Int)) (let ((.cse282 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse282 c_~var_1_65~0) 0)) (< (div .cse282 c_~var_1_65~0) .cse31) (< v_z_24 0) (not (= (mod .cse282 .cse13) 0)))))) (.cse8 (forall ((v_z_24 Int)) (let ((.cse281 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse281 c_~var_1_65~0) 0)) (< (div .cse281 c_~var_1_65~0) .cse31) (< v_z_24 0) (not (= (mod .cse281 .cse13) 0)) (< (div .cse281 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse49 (forall ((v_z_24 Int)) (let ((.cse280 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse280 c_~var_1_65~0) 0)) (= (mod .cse280 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse280 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse153 (forall ((v_z_24 Int)) (let ((.cse278 (+ .cse15 v_z_24))) (let ((.cse279 (div .cse278 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse278 c_~var_1_65~0) 0)) (= (mod .cse278 .cse13) 0) (< .cse279 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse279)))))) (.cse114 (forall ((v_z_24 Int)) (let ((.cse277 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse277 c_~var_1_65~0) 0)) (< (div .cse277 c_~var_1_65~0) .cse31) (< (div .cse277 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse161 (forall ((v_z_24 Int)) (let ((.cse276 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse276 c_~var_1_65~0) 0)) (= (mod .cse276 .cse13) 0) (< (div .cse276 c_~var_1_65~0) .cse31) (< (div .cse276 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse121 (forall ((v_z_24 Int)) (let ((.cse275 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse275 c_~var_1_65~0) 0)) (< (div .cse275 c_~var_1_65~0) .cse31))))) (.cse122 (forall ((v_z_24 Int)) (let ((.cse274 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse274 c_~var_1_65~0) 0)) (< (div .cse274 c_~var_1_65~0) .cse31) (not (= (mod .cse274 .cse13) 0)))))) (.cse169 (forall ((v_z_24 Int)) (let ((.cse273 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse273 c_~var_1_65~0) 0)) (= (mod .cse273 .cse13) 0) (< (div .cse273 c_~var_1_65~0) .cse31))))) (.cse98 (or .cse9 (forall ((v_z_24 Int)) (let ((.cse271 (+ .cse15 v_z_24))) (let ((.cse272 (div .cse271 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse271 c_~var_1_65~0) 0)) (< (div .cse271 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse272) (not (= (mod .cse271 .cse13) 0)) (< .cse272 |c_ULTIMATE.start_step_#t~bitwise5#1|))))))) (.cse99 (forall ((v_z_24 Int)) (let ((.cse268 (+ .cse15 v_z_24))) (let ((.cse269 (div .cse268 c_~var_1_65~0)) (.cse270 (div .cse268 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse268 c_~var_1_65~0) 0)) (< .cse269 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse269) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse270) (not (= (mod .cse268 .cse13) 0)) (< .cse270 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse83 (forall ((v_z_24 Int)) (let ((.cse265 (+ .cse15 v_z_24))) (let ((.cse266 (div .cse265 c_~var_1_65~0)) (.cse267 (div .cse265 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse265 c_~var_1_65~0) 0)) (< .cse266 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse266) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse267) (< .cse267 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse139 (or .cse0 (forall ((v_z_24 Int)) (let ((.cse263 (+ .cse15 v_z_24))) (let ((.cse264 (div .cse263 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse263 c_~var_1_65~0) 0)) (< .cse264 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse264) (not (= (mod .cse263 .cse13) 0)))))))) (.cse119 (forall ((v_z_24 Int)) (let ((.cse260 (+ .cse15 v_z_24))) (let ((.cse261 (div .cse260 c_~var_1_65~0)) (.cse262 (div .cse260 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse260 c_~var_1_65~0) 0)) (= (mod .cse260 .cse13) 0) (< .cse261 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse261) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse262) (< .cse262 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse2 (forall ((v_z_24 Int)) (let ((.cse257 (+ .cse15 v_z_24))) (let ((.cse258 (div .cse257 c_~var_1_65~0)) (.cse259 (div .cse257 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse257 c_~var_1_65~0) 0)) (= (mod .cse257 .cse13) 0) (< .cse258 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse258) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse259) (< .cse259 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse89 (forall ((v_z_24 Int)) (let ((.cse255 (+ .cse15 v_z_24))) (let ((.cse256 (div .cse255 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse255 c_~var_1_65~0) 0)) (= (mod .cse255 .cse13) 0) (< .cse256 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse256) (< (div .cse255 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse91 (forall ((v_z_24 Int)) (let ((.cse254 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse254 .cse13) 0) (< (div .cse254 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse254 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse92 (forall ((v_z_24 Int)) (let ((.cse253 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse253 .cse13) 0) (< (div .cse253 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse141 (forall ((v_z_24 Int)) (let ((.cse252 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse252 c_~var_1_65~0) 0)) (< (div .cse252 c_~var_1_65~0) .cse18) (< v_z_24 0) (< (div .cse252 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse125 (forall ((v_z_24 Int)) (let ((.cse251 (+ .cse15 v_z_24))) (let ((.cse249 (div .cse251 c_~var_1_65~0)) (.cse250 (div .cse251 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse249 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse249) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse250) (< .cse250 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse56 (or (forall ((v_z_24 Int)) (let ((.cse248 (+ .cse15 v_z_24))) (let ((.cse247 (div .cse248 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse247 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse247) (not (= (mod .cse248 .cse13) 0)))))) .cse0)) (.cse130 (or (forall ((v_z_24 Int)) (let ((.cse246 (div (+ .cse15 v_z_24) c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse246 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse246)))) .cse0)) (.cse132 (or (forall ((v_z_24 Int)) (let ((.cse245 (+ .cse15 v_z_24))) (let ((.cse244 (div .cse245 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse244 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse244) (< (div .cse245 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0)) (.cse57 (forall ((v_z_24 Int)) (let ((.cse243 (+ .cse15 v_z_24))) (let ((.cse242 (div .cse243 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse242 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse242) (< (div .cse243 .cse13) .cse18) (not (= (mod .cse243 .cse13) 0))))))) (.cse50 (forall ((v_z_24 Int)) (let ((.cse240 (+ .cse15 v_z_24))) (let ((.cse241 (div .cse240 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse240 .cse13) 0) (< .cse241 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse241)))))) (.cse154 (forall ((v_z_24 Int)) (let ((.cse239 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse239 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse239 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse96 (forall ((v_z_24 Int)) (let ((.cse238 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse238 .cse13) 0) (< (div .cse238 c_~var_1_65~0) .cse31) (< (div .cse238 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse1 (forall ((v_z_24 Int)) (let ((.cse237 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse237 .cse13) 0) (< (div .cse237 c_~var_1_65~0) .cse31))))) (.cse186 (forall ((v_z_24 Int)) (let ((.cse236 (+ .cse15 v_z_24))) (let ((.cse234 (div .cse236 c_~var_1_65~0)) (.cse235 (div .cse236 .cse13))) (or (< 8 v_z_24) (< .cse234 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse234) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse235) (< .cse235 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse11 (or (forall ((v_z_24 Int)) (let ((.cse233 (+ .cse15 v_z_24))) (let ((.cse232 (div .cse233 c_~var_1_65~0))) (or (< 8 v_z_24) (< .cse232 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse232) (not (= (mod .cse233 .cse13) 0)))))) .cse0)) (.cse177 (or (forall ((v_z_24 Int)) (let ((.cse231 (+ .cse15 v_z_24))) (let ((.cse230 (div .cse231 c_~var_1_65~0))) (or (< 8 v_z_24) (< .cse230 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse230) (not (= (mod .cse231 .cse13) 0)) (< (div .cse231 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0)) (.cse23 (forall ((v_z_24 Int)) (let ((.cse229 (+ .cse15 v_z_24))) (or (= (mod .cse229 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse229 c_~var_1_65~0) .cse31) (< v_z_24 0) (not (= (mod .cse229 .cse13) 0)))))) (.cse176 (forall ((v_z_24 Int)) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div (+ .cse15 v_z_24) c_~var_1_65~0) .cse18)))) (.cse133 (forall ((v_z_24 Int)) (let ((.cse228 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse228 c_~var_1_65~0) .cse31) (< (div .cse228 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse134 (forall ((v_z_24 Int)) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div (+ .cse15 v_z_24) c_~var_1_65~0) .cse31)))) (.cse16 (forall ((v_z_24 Int)) (let ((.cse227 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse227 c_~var_1_65~0) .cse31) (not (= (mod .cse227 .cse13) 0)))))) (.cse4 (< 0 .cse226)) (.cse100 (forall ((v_z_24 Int)) (let ((.cse225 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< (div .cse225 c_~var_1_65~0) .cse31) (< v_z_24 0) (not (= (mod .cse225 .cse13) 0)))))) (.cse40 (forall ((v_z_24 Int)) (let ((.cse224 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< (div .cse224 c_~var_1_65~0) .cse31) (< v_z_24 0) (not (= (mod .cse224 .cse13) 0)) (< (div .cse224 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (.cse127 (or .cse9 (forall ((v_z_24 Int)) (let ((.cse222 (+ .cse15 v_z_24))) (let ((.cse223 (div .cse222 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse222 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse223) (not (= (mod .cse222 .cse13) 0)) (< .cse223 |c_ULTIMATE.start_step_#t~bitwise5#1|))))))) (.cse146 (forall ((v_z_24 Int)) (let ((.cse220 (+ .cse15 v_z_24))) (let ((.cse221 (div .cse220 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse220 c_~var_1_65~0) .cse31) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse221) (not (= (mod .cse220 .cse13) 0)) (< .cse221 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse131 (forall ((v_z_24 Int)) (let ((.cse219 (+ .cse15 v_z_24))) (let ((.cse217 (div .cse219 c_~var_1_65~0)) (.cse218 (div .cse219 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse217 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse217) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse218) (not (= (mod .cse219 .cse13) 0)) (< .cse218 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse147 (or .cse0 .cse198)) (.cse47 (forall ((v_z_24 Int)) (let ((.cse216 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse216 c_~var_1_65~0) 0)) (= (mod .cse216 .cse13) 0) (< (div .cse216 c_~var_1_65~0) .cse31) (< v_z_24 0))))) (.cse181 (forall ((v_z_24 Int)) (let ((.cse214 (+ .cse15 v_z_24))) (let ((.cse215 (div .cse214 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse214 c_~var_1_65~0) 0)) (= (mod .cse214 .cse13) 0) (< .cse215 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse215)))))) (.cse38 (forall ((v_z_24 Int)) (let ((.cse212 (+ .cse15 v_z_24))) (let ((.cse213 (div .cse212 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse212 c_~var_1_65~0) 0)) (= (mod .cse212 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< .cse213 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse213) (< (div .cse212 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse55 (forall ((v_z_24 Int)) (let ((.cse210 (+ .cse15 v_z_24))) (let ((.cse211 (div .cse210 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse210 c_~var_1_65~0) 0)) (= (mod .cse210 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< .cse211 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse211)))))) (.cse3 (< c_~var_1_65~0 0)) (.cse178 (forall ((v_z_24 Int)) (let ((.cse209 (+ .cse15 v_z_24))) (let ((.cse207 (div .cse209 c_~var_1_65~0)) (.cse208 (div .cse209 .cse13))) (or (< 8 v_z_24) (< .cse207 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse207) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse208) (not (= (mod .cse209 .cse13) 0)) (< .cse208 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (.cse95 (forall ((v_z_24 Int)) (let ((.cse204 (+ .cse15 v_z_24))) (let ((.cse205 (div .cse204 c_~var_1_65~0)) (.cse206 (div .cse204 .cse13))) (or (< 8 v_z_24) (= (mod .cse204 .cse13) 0) (< .cse205 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse205) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse206) (< .cse206 |c_ULTIMATE.start_step_#t~bitwise5#1|))))))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse4 (and .cse5 .cse6 .cse7 .cse8)) (or .cse9 .cse10) (or (and .cse11 .cse10) .cse3) (or .cse0 .cse7) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse12 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse12 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse12 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse12 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse16 .cse0) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse17 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 0) (< (div .cse17 .cse13) .cse18) (not (= (mod .cse17 .cse13) 0)))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse19 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse19 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse19 .cse13) .cse18) (not (= (mod .cse19 .cse13) 0)))))) (or .cse20 .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse21 (+ .cse15 v_z_24))) (let ((.cse22 (div .cse21 .cse13))) (or (< 8 v_z_24) (< (div .cse21 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse22) (< .cse22 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse4 (and .cse23 .cse24 .cse25)) (or (forall ((v_z_24 Int)) (let ((.cse26 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse26 c_~var_1_65~0) 0)) (< (div .cse26 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse26 .cse13) .cse18)))) .cse9) (or (and .cse27 (or .cse20 .cse0) .cse28) .cse3) (forall ((v_z_24 Int)) (let ((.cse29 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse29 c_~var_1_65~0) 0)) (< (div .cse29 c_~var_1_65~0) .cse18) (< v_z_24 0) (< (div .cse29 .cse13) .cse18) (not (= (mod .cse29 .cse13) 0))))) (forall ((v_z_24 Int)) (let ((.cse30 (+ .cse15 v_z_24))) (let ((.cse32 (div .cse30 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse30 c_~var_1_65~0) .cse31) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse32) (< .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse33 (+ .cse15 v_z_24))) (let ((.cse34 (div .cse33 .cse13))) (or (< 8 v_z_24) (= (mod .cse33 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse34) (< .cse34 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (forall ((v_z_24 Int)) (let ((.cse35 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse35 c_~var_1_65~0) .cse31) (< (div .cse35 .cse13) .cse18) (not (= (mod .cse35 .cse13) 0))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse36 (+ .cse15 v_z_24))) (let ((.cse37 (div .cse36 .cse13))) (or (< 8 v_z_24) (= (mod .cse36 .cse13) 0) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse37) (< .cse37 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse38 .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse39 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse39 c_~var_1_65~0) 0)) (< (div .cse39 .cse13) .cse18))))) (or .cse38 .cse9) (or .cse0 .cse40) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse41 (+ .cse15 v_z_24))) (let ((.cse42 (div .cse41 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse41 c_~var_1_65~0) 0)) (= (mod .cse41 .cse13) 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse42) (< .cse42 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse43 (+ .cse15 v_z_24))) (let ((.cse44 (div .cse43 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse43 c_~var_1_65~0) 0)) (= (mod .cse43 .cse13) 0) (< (div .cse43 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse44) (< .cse44 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse45 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse45 c_~var_1_65~0) 0)) (< v_z_24 0) (< (div .cse45 .cse13) .cse18) (not (= (mod .cse45 .cse13) 0)))))) (or (and .cse46 .cse47) .cse4) (or (forall ((v_z_24 Int)) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div (+ .cse15 v_z_24) .cse13) .cse18))) .cse9) (or (forall ((v_z_24 Int)) (let ((.cse48 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse48 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse48 .cse13) .cse18)))) .cse9) (or .cse4 .cse49) (or (and (or .cse50 .cse0) .cse51 (or .cse52 .cse0)) .cse3) (forall ((v_z_24 Int)) (let ((.cse53 (+ .cse15 v_z_24))) (let ((.cse54 (div .cse53 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse53 c_~var_1_65~0) 0)) (= (mod .cse53 .cse13) 0) (< (div .cse53 c_~var_1_65~0) .cse31) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse54) (< .cse54 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse9 .cse27) (or .cse0 (and (or .cse55 .cse3) .cse49)) (or (and .cse56 .cse57) .cse3) (or .cse4 .cse58) (or .cse4 .cse59) (or .cse20 .cse9) (forall ((v_z_24 Int)) (let ((.cse60 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse60 c_~var_1_65~0) 0)) (< (div .cse60 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse60 .cse13) .cse18) (not (= (mod .cse60 .cse13) 0))))) (forall ((v_z_24 Int)) (let ((.cse61 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse61 c_~var_1_65~0) 0)) (= (mod .cse61 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse61 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse61 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) (or (and (forall ((v_z_24 Int)) (let ((.cse62 (+ .cse15 v_z_24))) (or (= (mod .cse62 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse62 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse62 .cse13) .cse18) (not (= (mod .cse62 .cse13) 0))))) (or (forall ((v_z_24 Int)) (let ((.cse63 (+ .cse15 v_z_24))) (or (= (mod .cse63 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse63 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0)))) .cse0) (forall ((v_z_24 Int)) (let ((.cse64 (+ .cse15 v_z_24))) (let ((.cse65 (div .cse64 .cse13))) (or (= (mod .cse64 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse64 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse65) (< .cse65 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or (forall ((v_z_24 Int)) (let ((.cse66 (+ .cse15 v_z_24))) (or (= (mod .cse66 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse66 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (not (= (mod .cse66 .cse13) 0))))) .cse0) (or (forall ((v_z_24 Int)) (let ((.cse67 (+ .cse15 v_z_24))) (or (= (mod .cse67 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse67 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse67 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) .cse0)) .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse68 (+ .cse15 v_z_24))) (let ((.cse69 (div .cse68 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse68 c_~var_1_65~0) 0)) (= (mod .cse68 .cse13) 0) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse69) (< .cse69 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse70 (+ .cse15 v_z_24))) (let ((.cse71 (div .cse70 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse70 .cse13) 0) (< (div .cse70 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse71) (< .cse71 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse51 .cse3) (or (and (or (forall ((v_z_24 Int)) (let ((.cse72 (+ .cse15 v_z_24))) (let ((.cse73 (div .cse72 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse72 c_~var_1_65~0) 0)) (< .cse73 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse73))))) .cse0) .cse74 .cse75 (or (forall ((v_z_24 Int)) (let ((.cse76 (+ .cse15 v_z_24))) (let ((.cse77 (div .cse76 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse76 c_~var_1_65~0) 0)) (< .cse77 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse77) (not (= (mod .cse76 .cse13) 0)))))) .cse0) .cse78 (or (forall ((v_z_24 Int)) (let ((.cse79 (+ .cse15 v_z_24))) (let ((.cse80 (div .cse79 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse79 c_~var_1_65~0) 0)) (< .cse80 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse80) (< (div .cse79 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0) .cse81) .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse82 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse82 .cse13) .cse18) (not (= (mod .cse82 .cse13) 0)))))) (or .cse0 .cse25) (or .cse9 .cse83) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse84 (+ .cse15 v_z_24))) (let ((.cse85 (div .cse84 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse84 c_~var_1_65~0) 0)) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse85) (< .cse85 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or (forall ((v_z_24 Int)) (let ((.cse86 (div (+ .cse15 v_z_24) .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse86) (< .cse86 |c_ULTIMATE.start_step_#t~bitwise5#1|)))) .cse9) (forall ((v_z_24 Int)) (let ((.cse87 (+ .cse15 v_z_24))) (let ((.cse88 (div .cse87 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse87 c_~var_1_65~0) 0)) (< (div .cse87 c_~var_1_65~0) .cse31) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse88) (< .cse88 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse4 (and .cse5 .cse46 .cse47 .cse6 .cse7 .cse8)) (or .cse0 (and .cse46 (or .cse89 .cse3))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse90 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse90 c_~var_1_65~0) 0)) (< (div .cse90 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse90 .cse13) .cse18) (not (= (mod .cse90 .cse13) 0)))))) (or .cse4 (and .cse91 .cse92)) (or (and (or .cse0 .cse93) (or .cse0 .cse94) .cse95) .cse3) (or .cse0 (and .cse96 (or .cse52 .cse3))) (or .cse0 .cse97) (or .cse96 .cse0) (or (and .cse98 (or .cse9 .cse99)) .cse3) (or .cse0 .cse8) (or (and .cse74 .cse75 (or .cse9 .cse78) (or .cse9 .cse81)) .cse3) (or .cse100 .cse0) (or .cse4 .cse7) (or (and (or .cse93 .cse3) .cse91) .cse0) (or (forall ((v_z_24 Int)) (let ((.cse101 (+ .cse15 v_z_24))) (let ((.cse102 (div .cse101 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse101 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse102) (< .cse102 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9) (or .cse9 .cse103) (forall ((v_z_24 Int)) (let ((.cse104 (+ .cse15 v_z_24))) (let ((.cse105 (div .cse104 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse104 c_~var_1_65~0) 0)) (< (div .cse104 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse105) (< .cse105 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse0 .cse6) (or .cse4 (and .cse100 .cse106 .cse107 .cse40)) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse108 (+ .cse15 v_z_24))) (or (= (mod .cse108 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse108 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse108 .cse13) .cse18))))) (or (forall ((v_z_24 Int)) (let ((.cse109 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse109 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< v_z_24 0) (< (div .cse109 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) .cse9) (forall ((v_z_24 Int)) (let ((.cse110 (+ .cse15 v_z_24))) (let ((.cse111 (div .cse110 .cse13))) (or (< 8 v_z_24) (= (mod .cse110 .cse13) 0) (< (div .cse110 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse111) (< .cse111 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or (and .cse96 .cse1) .cse4) (forall ((v_z_24 Int)) (let ((.cse112 (+ .cse15 v_z_24))) (let ((.cse113 (div .cse112 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse112 c_~var_1_65~0) 0)) (< (div .cse112 c_~var_1_65~0) .cse18) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse113) (< .cse113 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse114 .cse0) (or .cse103 .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse115 (+ .cse15 v_z_24))) (let ((.cse116 (div .cse115 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse115 c_~var_1_65~0) 0)) (= (mod .cse115 .cse13) 0) (< (div .cse115 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse116) (< .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (forall ((v_z_24 Int)) (let ((.cse117 (+ .cse15 v_z_24))) (let ((.cse118 (div .cse117 .cse13))) (or (< 8 v_z_24) (= (mod .cse117 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse117 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse118) (< .cse118 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse9 .cse119) (or .cse120 .cse0) (or .cse4 .cse16) (or .cse100 .cse4) (or .cse4 (and .cse114 .cse121 .cse122)) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse123 (+ .cse15 v_z_24))) (or (= (mod .cse123 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< v_z_24 0) (< (div .cse123 .cse13) .cse18))))) (or .cse0 (and .cse59 (or (forall ((v_z_24 Int)) (let ((.cse124 (+ .cse15 v_z_24))) (or (= (mod .cse124 c_~var_1_65~0) 0) (< 8 v_z_24) (= (mod .cse124 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse124 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0)))) .cse3))) (or .cse125 .cse9) (or (forall ((v_z_24 Int)) (let ((.cse126 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< (div .cse126 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse126 .cse13) .cse18) (not (= (mod .cse126 .cse13) 0))))) .cse9) (or (and .cse125 .cse127 (or (forall ((v_z_24 Int)) (let ((.cse129 (+ .cse15 v_z_24))) (let ((.cse128 (div .cse129 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse128 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse128) (not (= (mod .cse129 .cse13) 0)) (< (div .cse129 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0) .cse56 .cse130 .cse131 .cse132) .cse3) (or .cse2 .cse9) (or .cse107 .cse0) (or .cse4 (and .cse133 .cse134 .cse16)) (or .cse5 .cse0) (forall ((v_z_24 Int)) (let ((.cse135 (+ .cse15 v_z_24))) (or (= (mod .cse135 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse135 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse135 .cse13) .cse18) (not (= (mod .cse135 .cse13) 0))))) (or .cse0 .cse24) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse137 (+ .cse15 v_z_24))) (let ((.cse136 (div .cse137 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< .cse136 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse136) (< (div .cse137 .cse13) .cse18)))))) (or .cse106 .cse0) (or (and .cse138 .cse139) .cse3) (or (and (or .cse94 .cse3) .cse92) .cse0) (or .cse58 .cse0) (or (and .cse100 .cse106 .cse91 .cse107 .cse92 .cse40) .cse4) (or (and .cse20 .cse28) .cse3) (or .cse134 .cse0) (forall ((v_z_24 Int)) (let ((.cse140 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (< (div .cse140 c_~var_1_65~0) .cse18) (< (div .cse140 .cse13) .cse18)))) (or .cse4 (and .cse120 .cse141)) (or .cse9 .cse51) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse142 (+ .cse15 v_z_24))) (let ((.cse143 (div .cse142 c_~var_1_65~0))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse142 c_~var_1_65~0) 0)) (< .cse143 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse143) (< (div .cse142 .cse13) .cse18)))))) (forall ((v_z_24 Int)) (let ((.cse144 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse144 c_~var_1_65~0) 0)) (< (div .cse144 c_~var_1_65~0) .cse31) (< (div .cse144 .cse13) .cse18) (not (= (mod .cse144 .cse13) 0))))) (forall ((v_z_24 Int)) (let ((.cse145 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse145 c_~var_1_65~0) 0)) (= (mod .cse145 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse145 c_~var_1_65~0) .cse18) (< v_z_24 0) (< (div .cse145 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) (or (and .cse146 .cse147) .cse3) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse148 (+ .cse15 v_z_24))) (let ((.cse149 (div .cse148 .cse13))) (or (< 8 v_z_24) (< (div .cse148 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse149) (not (= (mod .cse148 .cse13) 0)) (< .cse149 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse150 (+ .cse15 v_z_24))) (let ((.cse151 (div .cse150 .cse13))) (or (< 8 v_z_24) (= (mod .cse150 .cse13) 0) (< (div .cse150 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse151) (< .cse151 |c_ULTIMATE.start_step_#t~bitwise5#1|)))))) (or .cse0 .cse122) (or .cse138 .cse9) (or .cse121 .cse0) (or .cse4 .cse97) (or (and .cse119 (or .cse152 .cse0) (or .cse153 .cse0)) .cse3) (or (and .cse100 .cse106 .cse91 .cse107 .cse92 .cse154 .cse40) .cse4) (or (and (or .cse155 .cse3) .cse154) .cse0) (or .cse0 .cse156) (forall ((v_z_24 Int)) (let ((.cse157 (+ .cse15 v_z_24))) (let ((.cse158 (div .cse157 .cse13))) (or (< 8 v_z_24) (< (div .cse157 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse158) (< .cse158 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (forall ((v_z_24 Int)) (let ((.cse159 (+ .cse15 v_z_24))) (let ((.cse160 (div .cse159 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse159 c_~var_1_65~0) 0)) (= (mod .cse159 .cse13) 0) (< (div .cse159 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse160) (< .cse160 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse0 .cse154) (or (and .cse120 .cse141 .cse156) .cse4) (or (and (or .cse152 .cse3) .cse161) .cse0) (or .cse133 .cse0) (forall ((v_z_24 Int)) (let ((.cse162 (+ .cse15 v_z_24))) (let ((.cse163 (div .cse162 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse162 .cse13) 0) (< (div .cse162 c_~var_1_65~0) .cse31) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse163) (< .cse163 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse164 (div (+ .cse15 v_z_24) .cse13))) (or (< 8 v_z_24) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse164) (< .cse164 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or (and .cse5 .cse46 .cse47 .cse6 .cse7 (forall ((v_z_24 Int)) (let ((.cse165 (+ .cse15 v_z_24))) (let ((.cse166 (div .cse165 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse165 c_~var_1_65~0) 0)) (= (mod .cse165 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse165 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse166) (< .cse166 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse8 .cse49) .cse4) (forall ((v_z_24 Int)) (let ((.cse167 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< (div .cse167 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse167 .cse13) .cse18) (not (= (mod .cse167 .cse13) 0))))) (forall ((v_z_24 Int)) (let ((.cse168 (+ .cse15 v_z_24))) (or (= (mod .cse168 c_~var_1_65~0) 0) (< 8 v_z_24) (= (mod .cse168 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse168 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse168 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) (or (and (or .cse153 .cse3) .cse169) .cse0) (or .cse4 (and .cse161 .cse169)) (or (and .cse114 .cse161 .cse121 .cse122 .cse169) .cse4) (or (and .cse98 (or (forall ((v_z_24 Int)) (let ((.cse170 (+ .cse15 v_z_24))) (let ((.cse171 (div .cse170 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse170 c_~var_1_65~0) 0)) (< .cse171 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse171) (not (= (mod .cse170 .cse13) 0)) (< (div .cse170 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0) .cse99 (or .cse0 (forall ((v_z_24 Int)) (let ((.cse172 (+ .cse15 v_z_24))) (let ((.cse173 (div .cse172 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse172 c_~var_1_65~0) 0)) (< .cse173 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse173)))))) .cse83 .cse139 (or (forall ((v_z_24 Int)) (let ((.cse174 (+ .cse15 v_z_24))) (let ((.cse175 (div .cse174 c_~var_1_65~0))) (or (< 8 v_z_24) (not (= (mod .cse174 c_~var_1_65~0) 0)) (< .cse175 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse175) (< (div .cse174 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0)) .cse3) (or .cse176 .cse0) (or (and .cse11 .cse177 .cse178) .cse3) (or .cse95 .cse3) (or (forall ((v_z_24 Int)) (let ((.cse179 (+ .cse15 v_z_24))) (let ((.cse180 (div .cse179 .cse13))) (or (< 8 v_z_24) (< v_z_24 .cse14) (= (mod .cse179 .cse13) 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse180) (< .cse180 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9) (or .cse119 .cse3) (or (and .cse2 (or .cse0 .cse89) (or .cse181 .cse0)) .cse3) (forall ((v_z_24 Int)) (let ((.cse182 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (= (mod .cse182 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse182 c_~var_1_65~0) .cse31) (< v_z_24 0) (< (div .cse182 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse183 (+ .cse15 v_z_24))) (or (= (mod .cse183 c_~var_1_65~0) 0) (< 8 v_z_24) (= (mod .cse183 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< v_z_24 0) (< (div .cse183 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse91 .cse0) (forall ((v_z_24 Int)) (let ((.cse184 (+ .cse15 v_z_24))) (let ((.cse185 (div .cse184 .cse13))) (or (= (mod .cse184 c_~var_1_65~0) 0) (< 8 v_z_24) (< .cse14 (+ v_z_24 1)) (< (div .cse184 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse185) (< .cse185 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse186 .cse9) (or .cse0 .cse92) (or .cse141 .cse0) (or (and .cse125 .cse56 .cse57 .cse130 .cse132) .cse3) (forall ((v_z_24 Int)) (let ((.cse187 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (< v_z_24 .cse14) (not (= (mod .cse187 c_~var_1_65~0) 0)) (< (div .cse187 c_~var_1_65~0) .cse18) (< (div .cse187 .cse13) .cse18)))) (or (forall ((v_z_24 Int)) (let ((.cse188 (+ .cse15 v_z_24))) (let ((.cse189 (div .cse188 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse188 c_~var_1_65~0) 0)) (< (div .cse188 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse189) (< .cse189 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9) (or (forall ((v_z_24 Int)) (let ((.cse190 (+ .cse15 v_z_24))) (let ((.cse191 (div .cse190 .cse13))) (or (< 8 v_z_24) (= (mod .cse190 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse190 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse191) (< .cse191 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9) (or .cse9 .cse57) (forall ((v_z_24 Int)) (let ((.cse192 (+ .cse15 v_z_24))) (let ((.cse193 (div .cse192 .cse13))) (or (< 8 v_z_24) (< (div .cse192 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse193) (not (= (mod .cse192 .cse13) 0)) (< .cse193 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or (and (or .cse50 .cse3) .cse1) .cse0) (or .cse4 .cse154) (or .cse4 (and .cse133 .cse134 .cse16 .cse96 .cse1)) (or (and .cse186 (or (forall ((v_z_24 Int)) (let ((.cse195 (+ .cse15 v_z_24))) (let ((.cse194 (div .cse195 c_~var_1_65~0))) (or (< 8 v_z_24) (< .cse194 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse194) (< (div .cse195 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse0) (or .cse0 (forall ((v_z_24 Int)) (let ((.cse196 (div (+ .cse15 v_z_24) c_~var_1_65~0))) (or (< 8 v_z_24) (< .cse196 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse196))))) .cse11 .cse177 .cse178) .cse3) (or .cse23 .cse0) (or .cse9 (forall ((v_z_24 Int)) (let ((.cse197 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse197 c_~var_1_65~0) 0)) (= (mod .cse197 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< (div .cse197 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_24 0) (< (div .cse197 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or .cse176 .cse4) (or .cse4 (and .cse133 .cse146 .cse134 .cse16 .cse198)) (or .cse4 (and .cse100 .cse40)) (forall ((v_z_24 Int)) (let ((.cse199 (+ .cse15 v_z_24))) (let ((.cse200 (div .cse199 .cse13))) (or (< 8 v_z_24) (not (= (mod .cse199 c_~var_1_65~0) 0)) (< (div .cse199 c_~var_1_65~0) .cse31) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse200) (not (= (mod .cse199 .cse13) 0)) (< .cse200 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) (or (and .cse127 .cse146 (or .cse9 .cse131) .cse147) .cse3) (or (forall ((v_z_24 Int)) (let ((.cse202 (+ .cse15 v_z_24))) (let ((.cse201 (div .cse202 .cse13))) (or (< 8 v_z_24) (< v_z_24 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse201) (not (= (mod .cse202 .cse13) 0)) (< .cse201 |c_ULTIMATE.start_step_#t~bitwise5#1|))))) .cse9) (or (forall ((v_z_24 Int)) (let ((.cse203 (+ .cse15 v_z_24))) (or (< 8 v_z_24) (not (= (mod .cse203 c_~var_1_65~0) 0)) (= (mod .cse203 .cse13) 0) (< .cse14 (+ v_z_24 1)) (< v_z_24 0) (< (div .cse203 .cse13) |c_ULTIMATE.start_step_#t~bitwise5#1|)))) .cse9) (or .cse0 (and .cse47 (or .cse181 .cse3))) (or (and .cse38 (or .cse55 .cse0)) .cse3) (or .cse9 .cse178) (or .cse9 .cse95)))))) is different from true