./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 707a62cdbfecf08d6cd7391f672114e8110bcee31b0927d7d5b0c17b9e69700b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:08:13,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:08:13,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:08:13,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:08:13,250 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:08:13,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:08:13,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:08:13,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:08:13,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:08:13,271 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:08:13,271 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:08:13,271 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:08:13,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:08:13,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:08:13,271 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:08:13,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:08:13,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:08:13,272 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:08:13,272 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:08:13,272 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:08:13,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:08:13,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:08:13,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:08:13,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:08:13,272 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:08:13,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:08:13,273 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:13,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:08:13,273 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 707a62cdbfecf08d6cd7391f672114e8110bcee31b0927d7d5b0c17b9e69700b [2025-03-03 20:08:13,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:08:13,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:08:13,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:08:13,526 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:08:13,526 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:08:13,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2025-03-03 20:08:14,667 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb021e22a/40377bd621274726b829c8c271e15124/FLAGaea1d22fe [2025-03-03 20:08:14,947 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:08:14,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2025-03-03 20:08:14,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb021e22a/40377bd621274726b829c8c271e15124/FLAGaea1d22fe [2025-03-03 20:08:15,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb021e22a/40377bd621274726b829c8c271e15124 [2025-03-03 20:08:15,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:08:15,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:08:15,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:15,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:08:15,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:08:15,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b353e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15, skipping insertion in model container [2025-03-03 20:08:15,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:08:15,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i[916,929] [2025-03-03 20:08:15,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:15,538 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:08:15,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i[916,929] [2025-03-03 20:08:15,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:15,630 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:08:15,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15 WrapperNode [2025-03-03 20:08:15,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:15,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:15,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:08:15,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:08:15,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,716 INFO L138 Inliner]: procedures = 26, calls = 123, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 803 [2025-03-03 20:08:15,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:15,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:08:15,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:08:15,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:08:15,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,734 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,773 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:08:15,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:08:15,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:08:15,832 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:08:15,832 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:08:15,833 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (1/1) ... [2025-03-03 20:08:15,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:15,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:15,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:08:15,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:08:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:08:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:08:15,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:08:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:08:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:08:15,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:08:15,992 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:08:15,993 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:08:16,760 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: havoc property_#t~bitwise75#1; [2025-03-03 20:08:16,931 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-03 20:08:16,931 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:08:16,962 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:08:16,965 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:08:16,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:16 BoogieIcfgContainer [2025-03-03 20:08:16,966 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:08:16,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:08:16,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:08:16,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:08:16,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:08:15" (1/3) ... [2025-03-03 20:08:16,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285c2cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:16, skipping insertion in model container [2025-03-03 20:08:16,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:15" (2/3) ... [2025-03-03 20:08:16,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285c2cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:16, skipping insertion in model container [2025-03-03 20:08:16,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:16" (3/3) ... [2025-03-03 20:08:16,976 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2025-03-03 20:08:16,989 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:08:16,992 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-03-03 20:08:17,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:08:17,063 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;@4aa61cca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:08:17,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:08:17,068 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-03-03 20:08:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-03-03 20:08:17,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:17,105 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-03-03 20:08:17,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:17,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:17,111 INFO L85 PathProgramCache]: Analyzing trace with hash -94509886, now seen corresponding path program 1 times [2025-03-03 20:08:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:17,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911046980] [2025-03-03 20:08:17,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:17,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:17,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-03-03 20:08:17,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-03-03 20:08:17,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:17,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:17,817 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:17,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:17,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911046980] [2025-03-03 20:08:17,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911046980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:17,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:17,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:08:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931840140] [2025-03-03 20:08:17,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:17,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:08:17,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:17,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:08:17,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:08:17,843 INFO L87 Difference]: Start difference. First operand has 333 states, 220 states have (on average 1.5681818181818181) internal successors, (345), 221 states have internal predecessors, (345), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:17,911 INFO L93 Difference]: Finished difference Result 660 states and 1235 transitions. [2025-03-03 20:08:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:08:17,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 705 [2025-03-03 20:08:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:17,921 INFO L225 Difference]: With dead ends: 660 [2025-03-03 20:08:17,921 INFO L226 Difference]: Without dead ends: 330 [2025-03-03 20:08:17,925 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:08:17,927 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:17,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 550 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:17,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-03 20:08:17,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-03 20:08:17,993 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-03-03 20:08:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 558 transitions. [2025-03-03 20:08:18,005 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 558 transitions. Word has length 705 [2025-03-03 20:08:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:18,009 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 558 transitions. [2025-03-03 20:08:18,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 79.0) internal successors, (158), 2 states have internal predecessors, (158), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 558 transitions. [2025-03-03 20:08:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-03 20:08:18,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:18,022 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-03-03 20:08:18,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 20:08:18,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:18,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:18,024 INFO L85 PathProgramCache]: Analyzing trace with hash -773794870, now seen corresponding path program 1 times [2025-03-03 20:08:18,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:18,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431042418] [2025-03-03 20:08:18,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:18,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-03 20:08:18,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-03 20:08:18,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:18,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:18,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:18,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431042418] [2025-03-03 20:08:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431042418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:18,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:18,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318950747] [2025-03-03 20:08:18,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:18,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:18,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:18,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:18,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:18,719 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-03-03 20:08:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:18,819 INFO L93 Difference]: Finished difference Result 849 states and 1441 transitions. [2025-03-03 20:08:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:18,822 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-03-03 20:08:18,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:18,830 INFO L225 Difference]: With dead ends: 849 [2025-03-03 20:08:18,830 INFO L226 Difference]: Without dead ends: 522 [2025-03-03 20:08:18,832 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-03-03 20:08:18,832 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 319 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:18,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1082 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-03 20:08:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 519. [2025-03-03 20:08:18,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 370 states have (on average 1.5972972972972972) internal successors, (591), 371 states have internal predecessors, (591), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 145 states have call predecessors, (146), 146 states have call successors, (146) [2025-03-03 20:08:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 883 transitions. [2025-03-03 20:08:18,907 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 883 transitions. Word has length 706 [2025-03-03 20:08:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:18,908 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 883 transitions. [2025-03-03 20:08:18,908 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-03-03 20:08:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 883 transitions. [2025-03-03 20:08:18,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-03 20:08:18,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:18,923 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-03-03 20:08:18,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:08:18,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:18,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:18,926 INFO L85 PathProgramCache]: Analyzing trace with hash -235785300, now seen corresponding path program 1 times [2025-03-03 20:08:18,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:18,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401651885] [2025-03-03 20:08:18,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:18,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:18,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-03 20:08:19,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-03 20:08:19,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:19,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-03-03 20:08:19,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401651885] [2025-03-03 20:08:19,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401651885] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462626333] [2025-03-03 20:08:19,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:19,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:19,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:19,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:19,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:08:19,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-03 20:08:20,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-03 20:08:20,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:20,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:20,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 20:08:20,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:20,144 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:08:20,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462626333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:20,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:08:20,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 20:08:20,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132630247] [2025-03-03 20:08:20,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:20,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:20,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:20,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:20,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:08:20,148 INFO L87 Difference]: Start difference. First operand 519 states and 883 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:20,239 INFO L93 Difference]: Finished difference Result 1377 states and 2347 transitions. [2025-03-03 20:08:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:20,240 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-03-03 20:08:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:20,246 INFO L225 Difference]: With dead ends: 1377 [2025-03-03 20:08:20,246 INFO L226 Difference]: Without dead ends: 861 [2025-03-03 20:08:20,248 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-03-03 20:08:20,249 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 281 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:20,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1225 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:20,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-03 20:08:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 857. [2025-03-03 20:08:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 640 states have (on average 1.621875) internal successors, (1038), 643 states have internal predecessors, (1038), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 209 states have call predecessors, (212), 212 states have call successors, (212) [2025-03-03 20:08:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1462 transitions. [2025-03-03 20:08:20,294 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1462 transitions. Word has length 706 [2025-03-03 20:08:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:20,295 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1462 transitions. [2025-03-03 20:08:20,295 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-03-03 20:08:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1462 transitions. [2025-03-03 20:08:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-03 20:08:20,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:20,300 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-03-03 20:08:20,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 20:08:20,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:20,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:20,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:20,506 INFO L85 PathProgramCache]: Analyzing trace with hash 718443595, now seen corresponding path program 1 times [2025-03-03 20:08:20,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:20,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511393040] [2025-03-03 20:08:20,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:20,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:20,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-03 20:08:20,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-03 20:08:20,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:20,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:21,071 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-03-03 20:08:21,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:21,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511393040] [2025-03-03 20:08:21,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511393040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:21,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696296703] [2025-03-03 20:08:21,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:21,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:21,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:21,074 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:21,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:08:21,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-03 20:08:21,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-03 20:08:21,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:21,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:21,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 20:08:21,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:21,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:08:21,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696296703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:21,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:08:21,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-03 20:08:21,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860796794] [2025-03-03 20:08:21,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:21,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:21,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:21,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:21,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:08:21,483 INFO L87 Difference]: Start difference. First operand 857 states and 1462 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:21,654 INFO L93 Difference]: Finished difference Result 2581 states and 4404 transitions. [2025-03-03 20:08:21,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:08:21,655 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-03-03 20:08:21,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:21,664 INFO L225 Difference]: With dead ends: 2581 [2025-03-03 20:08:21,664 INFO L226 Difference]: Without dead ends: 1727 [2025-03-03 20:08:21,667 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-03-03 20:08:21,667 INFO L435 NwaCegarLoop]: 997 mSDtfsCounter, 535 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2510 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:21,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2510 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2025-03-03 20:08:21,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1126. [2025-03-03 20:08:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 909 states have (on average 1.6567656765676568) internal successors, (1506), 912 states have internal predecessors, (1506), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 209 states have call predecessors, (212), 212 states have call successors, (212) [2025-03-03 20:08:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1930 transitions. [2025-03-03 20:08:21,745 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1930 transitions. Word has length 706 [2025-03-03 20:08:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:21,746 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1930 transitions. [2025-03-03 20:08:21,747 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-03-03 20:08:21,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1930 transitions. [2025-03-03 20:08:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-03 20:08:21,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:21,751 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-03-03 20:08:21,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:08:21,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 20:08:21,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:21,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:21,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1886639850, now seen corresponding path program 1 times [2025-03-03 20:08:21,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:21,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305537733] [2025-03-03 20:08:21,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:21,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:21,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-03 20:08:22,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-03 20:08:22,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:22,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:22,316 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:22,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:22,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305537733] [2025-03-03 20:08:22,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305537733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:22,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:22,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:22,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001452792] [2025-03-03 20:08:22,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:22,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:22,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:22,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:22,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:22,320 INFO L87 Difference]: Start difference. First operand 1126 states and 1930 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:22,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:22,417 INFO L93 Difference]: Finished difference Result 2900 states and 4953 transitions. [2025-03-03 20:08:22,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:22,418 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-03-03 20:08:22,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:22,429 INFO L225 Difference]: With dead ends: 2900 [2025-03-03 20:08:22,430 INFO L226 Difference]: Without dead ends: 1777 [2025-03-03 20:08:22,434 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-03-03 20:08:22,435 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 347 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:22,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1124 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-03-03 20:08:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1774. [2025-03-03 20:08:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1774 states, 1363 states have (on average 1.6228906823184153) internal successors, (2212), 1370 states have internal predecessors, (2212), 402 states have call successors, (402), 8 states have call predecessors, (402), 8 states have return successors, (402), 395 states have call predecessors, (402), 402 states have call successors, (402) [2025-03-03 20:08:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 3016 transitions. [2025-03-03 20:08:22,524 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 3016 transitions. Word has length 706 [2025-03-03 20:08:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:22,525 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 3016 transitions. [2025-03-03 20:08:22,525 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-03-03 20:08:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 3016 transitions. [2025-03-03 20:08:22,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-03 20:08:22,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:22,531 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-03-03 20:08:22,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:08:22,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:22,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:22,532 INFO L85 PathProgramCache]: Analyzing trace with hash -437387989, now seen corresponding path program 1 times [2025-03-03 20:08:22,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:22,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700155457] [2025-03-03 20:08:22,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:22,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:22,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-03 20:08:22,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-03 20:08:22,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:22,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:22,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:22,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700155457] [2025-03-03 20:08:22,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700155457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:22,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:22,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:22,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247223134] [2025-03-03 20:08:22,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:22,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:22,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:22,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:22,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:22,760 INFO L87 Difference]: Start difference. First operand 1774 states and 3016 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:22,855 INFO L93 Difference]: Finished difference Result 3552 states and 6034 transitions. [2025-03-03 20:08:22,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:22,855 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-03-03 20:08:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:22,864 INFO L225 Difference]: With dead ends: 3552 [2025-03-03 20:08:22,865 INFO L226 Difference]: Without dead ends: 1781 [2025-03-03 20:08:22,868 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-03-03 20:08:22,869 INFO L435 NwaCegarLoop]: 807 mSDtfsCounter, 327 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:22,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1344 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-03-03 20:08:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1350. [2025-03-03 20:08:22,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1132 states have (on average 1.6793286219081272) internal successors, (1901), 1135 states have internal predecessors, (1901), 212 states have call successors, (212), 5 states have call predecessors, (212), 5 states have return successors, (212), 209 states have call predecessors, (212), 212 states have call successors, (212) [2025-03-03 20:08:22,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2325 transitions. [2025-03-03 20:08:22,947 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2325 transitions. Word has length 706 [2025-03-03 20:08:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:22,948 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 2325 transitions. [2025-03-03 20:08:22,948 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-03-03 20:08:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2325 transitions. [2025-03-03 20:08:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-03 20:08:22,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:22,957 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-03-03 20:08:22,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:08:22,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:22,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1281859860, now seen corresponding path program 1 times [2025-03-03 20:08:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:22,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543793891] [2025-03-03 20:08:22,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:22,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:22,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-03 20:08:23,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-03 20:08:23,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:23,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:23,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:23,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543793891] [2025-03-03 20:08:23,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543793891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:23,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:23,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:23,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229900885] [2025-03-03 20:08:23,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:23,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:23,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:23,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:23,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:23,325 INFO L87 Difference]: Start difference. First operand 1350 states and 2325 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:23,689 INFO L93 Difference]: Finished difference Result 3689 states and 6334 transitions. [2025-03-03 20:08:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:08:23,690 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-03-03 20:08:23,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:23,700 INFO L225 Difference]: With dead ends: 3689 [2025-03-03 20:08:23,700 INFO L226 Difference]: Without dead ends: 2342 [2025-03-03 20:08:23,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:23,703 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 662 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 2002 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:23,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 2002 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:08:23,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2025-03-03 20:08:23,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2332. [2025-03-03 20:08:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2332 states, 1948 states have (on average 1.673511293634497) internal successors, (3260), 1957 states have internal predecessors, (3260), 370 states have call successors, (370), 13 states have call predecessors, (370), 13 states have return successors, (370), 361 states have call predecessors, (370), 370 states have call successors, (370) [2025-03-03 20:08:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 4000 transitions. [2025-03-03 20:08:23,792 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 4000 transitions. Word has length 706 [2025-03-03 20:08:23,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:23,793 INFO L471 AbstractCegarLoop]: Abstraction has 2332 states and 4000 transitions. [2025-03-03 20:08:23,793 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-03-03 20:08:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 4000 transitions. [2025-03-03 20:08:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-03-03 20:08:23,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:23,800 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-03-03 20:08:23,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:08:23,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:23,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:23,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1560393394, now seen corresponding path program 1 times [2025-03-03 20:08:23,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:23,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131514178] [2025-03-03 20:08:23,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:23,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-03 20:08:23,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-03 20:08:23,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:23,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:24,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:24,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131514178] [2025-03-03 20:08:24,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131514178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:24,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:24,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:24,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621449160] [2025-03-03 20:08:24,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:24,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:24,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:24,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:24,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:24,344 INFO L87 Difference]: Start difference. First operand 2332 states and 4000 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:24,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:24,936 INFO L93 Difference]: Finished difference Result 11362 states and 19488 transitions. [2025-03-03 20:08:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:08:24,937 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-03-03 20:08:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:24,981 INFO L225 Difference]: With dead ends: 11362 [2025-03-03 20:08:24,982 INFO L226 Difference]: Without dead ends: 9033 [2025-03-03 20:08:24,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:24,990 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 1361 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:24,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 1928 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:08:24,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9033 states. [2025-03-03 20:08:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9033 to 9025. [2025-03-03 20:08:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9025 states, 7604 states have (on average 1.6604418726985797) internal successors, (12626), 7642 states have internal predecessors, (12626), 1370 states have call successors, (1370), 50 states have call predecessors, (1370), 50 states have return successors, (1370), 1332 states have call predecessors, (1370), 1370 states have call successors, (1370) [2025-03-03 20:08:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9025 states to 9025 states and 15366 transitions. [2025-03-03 20:08:25,430 INFO L78 Accepts]: Start accepts. Automaton has 9025 states and 15366 transitions. Word has length 707 [2025-03-03 20:08:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:25,431 INFO L471 AbstractCegarLoop]: Abstraction has 9025 states and 15366 transitions. [2025-03-03 20:08:25,431 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-03-03 20:08:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 9025 states and 15366 transitions. [2025-03-03 20:08:25,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-03-03 20:08:25,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:25,445 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-03-03 20:08:25,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:08:25,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:25,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:25,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1230627633, now seen corresponding path program 1 times [2025-03-03 20:08:25,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513423135] [2025-03-03 20:08:25,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:25,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:25,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-03 20:08:25,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-03 20:08:25,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:25,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 117 proven. 210 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-03-03 20:08:26,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:26,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513423135] [2025-03-03 20:08:26,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513423135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:26,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579807652] [2025-03-03 20:08:26,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:26,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:26,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:26,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:26,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 20:08:26,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-03 20:08:26,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-03 20:08:26,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:26,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:26,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:08:26,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11107 proven. 210 refuted. 0 times theorem prover too weak. 12663 trivial. 0 not checked. [2025-03-03 20:08:27,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:08:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 117 proven. 210 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-03-03 20:08:27,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579807652] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:08:27,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:08:27,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 20:08:27,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657757008] [2025-03-03 20:08:27,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:08:27,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:08:27,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:27,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:08:27,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:08:27,949 INFO L87 Difference]: Start difference. First operand 9025 states and 15366 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2025-03-03 20:08:28,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:28,809 INFO L93 Difference]: Finished difference Result 18171 states and 30849 transitions. [2025-03-03 20:08:28,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:08:28,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) Word has length 707 [2025-03-03 20:08:28,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:28,862 INFO L225 Difference]: With dead ends: 18171 [2025-03-03 20:08:28,863 INFO L226 Difference]: Without dead ends: 9149 [2025-03-03 20:08:28,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1421 GetRequests, 1411 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:08:28,889 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 779 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:28,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 1066 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:08:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9149 states. [2025-03-03 20:08:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9149 to 9041. [2025-03-03 20:08:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9041 states, 7616 states have (on average 1.633140756302521) internal successors, (12438), 7654 states have internal predecessors, (12438), 1370 states have call successors, (1370), 54 states have call predecessors, (1370), 54 states have return successors, (1370), 1332 states have call predecessors, (1370), 1370 states have call successors, (1370) [2025-03-03 20:08:29,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9041 states to 9041 states and 15178 transitions. [2025-03-03 20:08:29,354 INFO L78 Accepts]: Start accepts. Automaton has 9041 states and 15178 transitions. Word has length 707 [2025-03-03 20:08:29,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:29,357 INFO L471 AbstractCegarLoop]: Abstraction has 9041 states and 15178 transitions. [2025-03-03 20:08:29,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2025-03-03 20:08:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 9041 states and 15178 transitions. [2025-03-03 20:08:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-03-03 20:08:29,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:29,371 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-03-03 20:08:29,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 20:08:29,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:29,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:29,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:29,575 INFO L85 PathProgramCache]: Analyzing trace with hash -952394931, now seen corresponding path program 1 times [2025-03-03 20:08:29,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:29,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485532567] [2025-03-03 20:08:29,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:29,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:29,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-03 20:08:29,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-03 20:08:29,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:29,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 264 proven. 63 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-03-03 20:08:30,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485532567] [2025-03-03 20:08:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485532567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:30,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61997090] [2025-03-03 20:08:30,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:30,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:30,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:30,252 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:30,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 20:08:30,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-03 20:08:30,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-03 20:08:30,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:30,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:30,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:08:30,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 7677 proven. 63 refuted. 0 times theorem prover too weak. 16240 trivial. 0 not checked. [2025-03-03 20:08:30,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:08:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 264 proven. 63 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-03-03 20:08:31,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61997090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:08:31,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:08:31,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 20:08:31,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146902170] [2025-03-03 20:08:31,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:08:31,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:08:31,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:31,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:08:31,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:08:31,224 INFO L87 Difference]: Start difference. First operand 9041 states and 15178 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) [2025-03-03 20:08:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:31,879 INFO L93 Difference]: Finished difference Result 16535 states and 27563 transitions. [2025-03-03 20:08:31,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:08:31,880 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-03-03 20:08:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:31,908 INFO L225 Difference]: With dead ends: 16535 [2025-03-03 20:08:31,908 INFO L226 Difference]: Without dead ends: 7497 [2025-03-03 20:08:31,927 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-03-03 20:08:31,927 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 362 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:31,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1057 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:08:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7497 states. [2025-03-03 20:08:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7497 to 7389. [2025-03-03 20:08:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7389 states, 5962 states have (on average 1.5934250251593425) internal successors, (9500), 6000 states have internal predecessors, (9500), 1370 states have call successors, (1370), 56 states have call predecessors, (1370), 56 states have return successors, (1370), 1332 states have call predecessors, (1370), 1370 states have call successors, (1370) [2025-03-03 20:08:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 12240 transitions. [2025-03-03 20:08:32,235 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 12240 transitions. Word has length 707 [2025-03-03 20:08:32,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:32,237 INFO L471 AbstractCegarLoop]: Abstraction has 7389 states and 12240 transitions. [2025-03-03 20:08:32,238 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-03-03 20:08:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 12240 transitions. [2025-03-03 20:08:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-03 20:08:32,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:32,247 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-03-03 20:08:32,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 20:08:32,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:32,448 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:32,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:32,449 INFO L85 PathProgramCache]: Analyzing trace with hash 472648617, now seen corresponding path program 1 times [2025-03-03 20:08:32,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:32,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148967153] [2025-03-03 20:08:32,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:32,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:32,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-03 20:08:32,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-03 20:08:32,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:32,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 213 proven. 114 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-03-03 20:08:33,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:33,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148967153] [2025-03-03 20:08:33,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148967153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:33,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703292594] [2025-03-03 20:08:33,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:33,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:33,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:33,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:33,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 20:08:33,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-03 20:08:33,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-03 20:08:33,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:33,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:33,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 20:08:33,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11811 proven. 114 refuted. 0 times theorem prover too weak. 12055 trivial. 0 not checked. [2025-03-03 20:08:34,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:08:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 213 proven. 114 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2025-03-03 20:08:34,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703292594] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:08:34,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:08:34,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-03 20:08:34,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16425300] [2025-03-03 20:08:34,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:08:34,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:08:34,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:34,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:08:34,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:08:34,756 INFO L87 Difference]: Start difference. First operand 7389 states and 12240 transitions. Second operand has 11 states, 11 states have (on average 30.454545454545453) internal successors, (335), 11 states have internal predecessors, (335), 6 states have call successors, (186), 3 states have call predecessors, (186), 5 states have return successors, (187), 6 states have call predecessors, (187), 6 states have call successors, (187) [2025-03-03 20:08:35,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:35,511 INFO L93 Difference]: Finished difference Result 14899 states and 24597 transitions. [2025-03-03 20:08:35,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:08:35,512 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-03-03 20:08:35,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:35,540 INFO L225 Difference]: With dead ends: 14899 [2025-03-03 20:08:35,540 INFO L226 Difference]: Without dead ends: 7513 [2025-03-03 20:08:35,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1427 GetRequests, 1413 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-03 20:08:35,559 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 317 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:35,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1030 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:08:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2025-03-03 20:08:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 7405. [2025-03-03 20:08:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7405 states, 5974 states have (on average 1.585537328423167) internal successors, (9472), 6012 states have internal predecessors, (9472), 1370 states have call successors, (1370), 60 states have call predecessors, (1370), 60 states have return successors, (1370), 1332 states have call predecessors, (1370), 1370 states have call successors, (1370) [2025-03-03 20:08:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7405 states to 7405 states and 12212 transitions. [2025-03-03 20:08:35,964 INFO L78 Accepts]: Start accepts. Automaton has 7405 states and 12212 transitions. Word has length 709 [2025-03-03 20:08:35,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:35,965 INFO L471 AbstractCegarLoop]: Abstraction has 7405 states and 12212 transitions. [2025-03-03 20:08:35,965 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-03-03 20:08:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 7405 states and 12212 transitions. [2025-03-03 20:08:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-03 20:08:35,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:35,975 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-03-03 20:08:35,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 20:08:36,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 20:08:36,180 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:36,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:36,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1537455224, now seen corresponding path program 1 times [2025-03-03 20:08:36,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:36,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513778844] [2025-03-03 20:08:36,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:36,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:36,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-03 20:08:36,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-03 20:08:36,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:36,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:08:36,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836080335] [2025-03-03 20:08:36,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:36,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:36,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:36,629 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:36,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 20:08:36,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-03 20:08:37,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-03 20:08:37,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:37,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:37,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 20:08:37,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:37,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:08:37,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:37,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513778844] [2025-03-03 20:08:37,662 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 20:08:37,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836080335] [2025-03-03 20:08:37,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836080335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:37,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:37,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:37,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840630380] [2025-03-03 20:08:37,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:37,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:08:37,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:37,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:08:37,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:37,665 INFO L87 Difference]: Start difference. First operand 7405 states and 12212 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:38,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:38,871 INFO L93 Difference]: Finished difference Result 26495 states and 43575 transitions. [2025-03-03 20:08:38,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:08:38,872 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-03-03 20:08:38,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:38,935 INFO L225 Difference]: With dead ends: 26495 [2025-03-03 20:08:38,936 INFO L226 Difference]: Without dead ends: 19093 [2025-03-03 20:08:38,955 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-03-03 20:08:38,956 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 720 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:38,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 2163 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:08:38,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19093 states. [2025-03-03 20:08:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19093 to 17959. [2025-03-03 20:08:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17959 states, 14364 states have (on average 1.5789473684210527) internal successors, (22680), 14456 states have internal predecessors, (22680), 3434 states have call successors, (3434), 160 states have call predecessors, (3434), 160 states have return successors, (3434), 3342 states have call predecessors, (3434), 3434 states have call successors, (3434) [2025-03-03 20:08:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17959 states to 17959 states and 29548 transitions. [2025-03-03 20:08:40,056 INFO L78 Accepts]: Start accepts. Automaton has 17959 states and 29548 transitions. Word has length 709 [2025-03-03 20:08:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:40,057 INFO L471 AbstractCegarLoop]: Abstraction has 17959 states and 29548 transitions. [2025-03-03 20:08:40,057 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-03-03 20:08:40,058 INFO L276 IsEmpty]: Start isEmpty. Operand 17959 states and 29548 transitions. [2025-03-03 20:08:40,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:08:40,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:40,132 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-03-03 20:08:40,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 20:08:40,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:40,333 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:40,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:40,334 INFO L85 PathProgramCache]: Analyzing trace with hash 245495853, now seen corresponding path program 1 times [2025-03-03 20:08:40,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:40,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278763163] [2025-03-03 20:08:40,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:40,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:40,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:08:40,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:08:40,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:40,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:40,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278763163] [2025-03-03 20:08:40,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278763163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:40,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:40,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529218541] [2025-03-03 20:08:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:40,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:40,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:40,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:40,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:40,757 INFO L87 Difference]: Start difference. First operand 17959 states and 29548 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:41,897 INFO L93 Difference]: Finished difference Result 47139 states and 77394 transitions. [2025-03-03 20:08:41,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:41,898 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-03-03 20:08:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:42,005 INFO L225 Difference]: With dead ends: 47139 [2025-03-03 20:08:42,006 INFO L226 Difference]: Without dead ends: 29183 [2025-03-03 20:08:42,096 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-03-03 20:08:42,098 INFO L435 NwaCegarLoop]: 755 mSDtfsCounter, 357 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:42,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1285 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29183 states. [2025-03-03 20:08:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29183 to 29173. [2025-03-03 20:08:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29173 states, 23024 states have (on average 1.5601111883252259) internal successors, (35920), 23168 states have internal predecessors, (35920), 5868 states have call successors, (5868), 280 states have call predecessors, (5868), 280 states have return successors, (5868), 5724 states have call predecessors, (5868), 5868 states have call successors, (5868) [2025-03-03 20:08:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29173 states to 29173 states and 47656 transitions. [2025-03-03 20:08:44,085 INFO L78 Accepts]: Start accepts. Automaton has 29173 states and 47656 transitions. Word has length 710 [2025-03-03 20:08:44,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:44,086 INFO L471 AbstractCegarLoop]: Abstraction has 29173 states and 47656 transitions. [2025-03-03 20:08:44,086 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-03-03 20:08:44,086 INFO L276 IsEmpty]: Start isEmpty. Operand 29173 states and 47656 transitions. [2025-03-03 20:08:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:08:44,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:44,107 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-03-03 20:08:44,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:08:44,107 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:44,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:44,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1555048857, now seen corresponding path program 1 times [2025-03-03 20:08:44,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:44,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456802570] [2025-03-03 20:08:44,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:44,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:44,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:08:44,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:08:44,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:44,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-03 20:08:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456802570] [2025-03-03 20:08:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456802570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:44,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:44,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:08:44,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556572016] [2025-03-03 20:08:44,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:44,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:08:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:44,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:08:44,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:08:44,465 INFO L87 Difference]: Start difference. First operand 29173 states and 47656 transitions. Second operand has 6 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2025-03-03 20:08:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:46,852 INFO L93 Difference]: Finished difference Result 70289 states and 115055 transitions. [2025-03-03 20:08:46,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:08:46,854 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-03-03 20:08:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:47,073 INFO L225 Difference]: With dead ends: 70289 [2025-03-03 20:08:47,074 INFO L226 Difference]: Without dead ends: 52333 [2025-03-03 20:08:47,122 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-03-03 20:08:47,123 INFO L435 NwaCegarLoop]: 923 mSDtfsCounter, 781 mSDsluCounter, 1836 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:47,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 2759 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:08:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52333 states. [2025-03-03 20:08:49,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52333 to 25945. [2025-03-03 20:08:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25945 states, 20452 states have (on average 1.5558380598474477) internal successors, (31820), 20572 states have internal predecessors, (31820), 5236 states have call successors, (5236), 256 states have call predecessors, (5236), 256 states have return successors, (5236), 5116 states have call predecessors, (5236), 5236 states have call successors, (5236) [2025-03-03 20:08:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25945 states to 25945 states and 42292 transitions. [2025-03-03 20:08:49,294 INFO L78 Accepts]: Start accepts. Automaton has 25945 states and 42292 transitions. Word has length 710 [2025-03-03 20:08:49,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:49,295 INFO L471 AbstractCegarLoop]: Abstraction has 25945 states and 42292 transitions. [2025-03-03 20:08:49,295 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-03-03 20:08:49,295 INFO L276 IsEmpty]: Start isEmpty. Operand 25945 states and 42292 transitions. [2025-03-03 20:08:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-03 20:08:49,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:49,311 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-03-03 20:08:49,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:08:49,311 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:49,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:49,311 INFO L85 PathProgramCache]: Analyzing trace with hash 605067787, now seen corresponding path program 1 times [2025-03-03 20:08:49,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:49,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647908214] [2025-03-03 20:08:49,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:49,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:49,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:08:50,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:08:50,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:50,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:08:50,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2113142659] [2025-03-03 20:08:50,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:50,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:50,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:50,554 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:08:50,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 20:08:50,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-03 20:08:50,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-03 20:08:50,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:50,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:50,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-03 20:08:50,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 13440 proven. 255 refuted. 0 times theorem prover too weak. 10285 trivial. 0 not checked. [2025-03-03 20:08:53,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:09:05,942 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_66~0 256))) (let ((.cse175 (+ c_~var_1_65~0 1)) (.cse36 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 2)) (.cse5 (mod c_~var_1_73~0 65536)) (.cse15 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 1)) (.cse6 (* (- 1) .cse3))) (let ((.cse11 (forall ((v_z_3 Int)) (let ((.cse217 (+ .cse6 v_z_3))) (let ((.cse218 (div .cse217 c_~var_1_65~0))) (or (< (div .cse217 .cse5) .cse15) (< v_z_3 0) (= .cse218 .cse15) (< 8 v_z_3) (< .cse218 .cse15)))))) (.cse1 (forall ((v_z_3 Int)) (let ((.cse216 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse216 .cse5) 0) (< (div .cse216 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15)))) (.cse48 (forall ((v_z_3 Int)) (let ((.cse215 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse215 .cse5) 0) (< (div .cse215 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse215 c_~var_1_65~0) .cse15))))) (.cse16 (forall ((v_z_3 Int)) (let ((.cse214 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse214 c_~var_1_65~0))) (< v_z_3 0) (< 8 v_z_3) (< (div .cse214 c_~var_1_65~0) .cse15))))) (.cse29 (forall ((v_z_3 Int)) (let ((.cse213 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse213 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse213 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse213 c_~var_1_65~0) .cse15))))) (.cse56 (forall ((v_z_3 Int)) (let ((.cse211 (+ .cse6 v_z_3))) (let ((.cse212 (div .cse211 c_~var_1_65~0))) (or (not (= 0 (mod .cse211 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse211 .cse5) 0) (< v_z_3 0) (= .cse212 .cse15) (< 8 v_z_3) (< .cse212 .cse15)))))) (.cse99 (forall ((v_z_3 Int)) (let ((.cse209 (+ .cse6 v_z_3))) (let ((.cse210 (div .cse209 c_~var_1_65~0))) (or (not (= 0 (mod .cse209 c_~var_1_65~0))) (< (div .cse209 .cse5) .cse15) (= (mod .cse209 .cse5) 0) (< v_z_3 0) (= .cse210 .cse15) (< 8 v_z_3) (< .cse210 .cse15)))))) (.cse23 (forall ((v_z_3 Int)) (let ((.cse207 (+ .cse6 v_z_3))) (let ((.cse208 (div .cse207 c_~var_1_65~0))) (or (not (= 0 (mod .cse207 c_~var_1_65~0))) (= (mod .cse207 .cse5) 0) (< v_z_3 0) (= .cse208 .cse15) (< 8 v_z_3) (< .cse208 .cse15)))))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse206 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse206 c_~var_1_65~0))) (not (= (mod .cse206 .cse5) 0)) (< (div .cse206 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse205 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse205 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse205 c_~var_1_65~0)))))) (.cse74 (forall ((v_z_3 Int)) (let ((.cse204 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (not (= (mod .cse204 .cse5) 0)) (< (div .cse204 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse204 c_~var_1_65~0)))))) (.cse61 (forall ((v_z_3 Int)) (let ((.cse203 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse203 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse203 .cse5) 0) (< (div .cse203 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse94 (forall ((v_z_3 Int)) (let ((.cse202 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse202 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse202 .cse5) 0) (< (div .cse202 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) (.cse97 (forall ((v_z_3 Int)) (let ((.cse200 (+ .cse6 v_z_3))) (let ((.cse201 (div .cse200 .cse5))) (or (not (= 0 (mod .cse200 c_~var_1_65~0))) (< .cse201 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse201) (< 8 v_z_3)))))) (.cse120 (forall ((v_z_3 Int)) (let ((.cse198 (+ .cse6 v_z_3))) (let ((.cse199 (div .cse198 .cse5))) (or (not (= 0 (mod .cse198 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse198 .cse5) 0) (< .cse199 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse199) (< 8 v_z_3) (< (div .cse198 c_~var_1_65~0) .cse15)))))) (.cse90 (forall ((v_z_3 Int)) (let ((.cse196 (+ .cse6 v_z_3))) (let ((.cse197 (div .cse196 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse196 .cse5) 0) (= .cse197 .cse15) (< 8 v_z_3) (< .cse197 .cse15)))))) (.cse26 (forall ((v_z_3 Int)) (let ((.cse194 (+ .cse6 v_z_3))) (let ((.cse195 (div .cse194 c_~var_1_65~0))) (or (= (mod .cse194 .cse5) 0) (< v_z_3 0) (= .cse195 .cse15) (< 8 v_z_3) (< .cse195 .cse15)))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse192 (+ .cse6 v_z_3))) (let ((.cse193 (div .cse192 c_~var_1_65~0))) (or (< (div .cse192 .cse5) .cse15) (= (mod .cse192 .cse5) 0) (< v_z_3 0) (= .cse193 .cse15) (< 8 v_z_3) (< .cse193 .cse15)))))) (.cse54 (forall ((v_z_3 Int)) (let ((.cse191 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse191 .cse5) 0) (< (div .cse191 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse191 c_~var_1_65~0)))))) (.cse133 (forall ((v_z_3 Int)) (let ((.cse189 (+ .cse6 v_z_3))) (let ((.cse190 (div .cse189 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse189 .cse5) 0) (< (div .cse189 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse190 .cse15) (< 8 v_z_3) (< .cse190 .cse15)))))) (.cse27 (forall ((v_z_3 Int)) (let ((.cse187 (+ .cse6 v_z_3))) (let ((.cse188 (div .cse187 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse187 .cse5) 0) (< v_z_3 0) (= .cse188 .cse15) (< 8 v_z_3) (< .cse188 .cse15)))))) (.cse79 (forall ((v_z_3 Int)) (let ((.cse186 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse186 c_~var_1_65~0))) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse186 c_~var_1_65~0) .cse15))))) (.cse10 (forall ((v_z_3 Int)) (let ((.cse185 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< v_z_3 0) (= .cse185 .cse15) (< 8 v_z_3) (< .cse185 .cse15))))) (.cse107 (forall ((v_z_3 Int)) (let ((.cse184 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse184 c_~var_1_65~0))) (not (= (mod .cse184 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse184 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse108 (forall ((v_z_3 Int)) (let ((.cse183 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse183 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse183 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse89 (forall ((v_z_3 Int)) (let ((.cse181 (+ .cse6 v_z_3))) (let ((.cse182 (div .cse181 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse181 .cse5) 0) (< .cse182 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse182) (< 8 v_z_3) (< (div .cse181 c_~var_1_65~0) .cse15)))))) (.cse98 (forall ((v_z_3 Int)) (let ((.cse180 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse180 c_~var_1_65~0))) (not (= (mod .cse180 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse180 c_~var_1_65~0) .cse15))))) (.cse30 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (.cse34 (forall ((v_z_3 Int)) (let ((.cse179 (+ .cse6 v_z_3))) (or (not (= (mod .cse179 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse179 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse21 (< c_~var_1_65~0 .cse5)) (.cse37 (forall ((v_z_3 Int)) (let ((.cse178 (+ .cse6 v_z_3))) (or (< (div .cse178 .cse5) .cse15) (not (= (mod .cse178 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse178 c_~var_1_65~0) .cse15))))) (.cse159 (forall ((v_z_3 Int)) (let ((.cse177 (+ .cse6 v_z_3))) (or (not (= (mod .cse177 .cse5) 0)) (< (div .cse177 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse0 (< .cse5 .cse175)) (.cse49 (forall ((v_z_3 Int)) (let ((.cse176 (+ .cse6 v_z_3))) (or (< (div .cse176 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse176 .cse5) 0) (< 8 v_z_3) (< (div .cse176 c_~var_1_65~0) .cse15))))) (.cse7 (< c_~var_1_65~0 0)) (.cse9 (< 0 .cse175)) (.cse8 (forall ((v_z_3 Int)) (let ((.cse173 (+ .cse6 v_z_3))) (let ((.cse174 (div .cse173 c_~var_1_65~0))) (or (not (= 0 (mod .cse173 c_~var_1_65~0))) (< v_z_3 0) (= .cse174 .cse15) (< 8 v_z_3) (< .cse174 .cse15)))))) (.cse102 (forall ((v_z_3 Int)) (let ((.cse171 (+ .cse6 v_z_3))) (let ((.cse172 (div .cse171 c_~var_1_65~0))) (or (not (= 0 (mod .cse171 c_~var_1_65~0))) (< (div .cse171 .cse5) .cse15) (< v_z_3 0) (= .cse172 .cse15) (< 8 v_z_3) (< .cse172 .cse15))))))) (and (or .cse0 (and .cse1 (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse6 v_z_3))) (let ((.cse2 (div .cse4 c_~var_1_65~0))) (or (< .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse4 .cse5) 0) (= .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse0 .cse8) (or .cse9 (and .cse10 .cse11)) (forall ((v_z_3 Int)) (let ((.cse12 (+ .cse6 v_z_3))) (let ((.cse13 (div .cse12 .cse5)) (.cse14 (div .cse12 c_~var_1_65~0))) (or (= (mod .cse12 .cse5) 0) (< .cse13 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse13) (= .cse14 .cse15) (< 8 v_z_3) (< .cse14 .cse15))))) (or .cse0 .cse16) (forall ((v_z_3 Int)) (let ((.cse17 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse17 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse17 .cse5) 0) (< (div .cse17 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse17 c_~var_1_65~0) .cse15)))) (or .cse18 .cse9) (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse6 v_z_3))) (let ((.cse20 (div .cse19 c_~var_1_65~0))) (or (not (= (mod .cse19 .cse5) 0)) (< v_z_3 0) (= .cse20 .cse15) (< 8 v_z_3) (< .cse20 .cse15))))) .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse22 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse22 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse22 c_~var_1_65~0)))))) (or .cse23 .cse0) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse6 v_z_3))) (let ((.cse25 (div .cse24 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse24 .cse5) .cse15) (= (mod .cse24 .cse5) 0) (< v_z_3 0) (= .cse25 .cse15) (< 8 v_z_3) (< .cse25 .cse15))))) .cse10 .cse26 .cse27 .cse28 .cse11)) (or .cse1 .cse9) (or (and .cse29 .cse16) .cse9) (or (and .cse30 (or (forall ((v_z_3 Int)) (let ((.cse31 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3)))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse6 v_z_3))) (let ((.cse32 (div .cse33 c_~var_1_65~0))) (or (< .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse33 .cse5) 0)) (< v_z_3 .cse3) (= .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse34) .cse0) (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (< (div .cse35 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse35 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or .cse37 .cse7) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse38 (+ .cse6 v_z_3))) (let ((.cse39 (div .cse38 c_~var_1_65~0))) (or (not (= 0 (mod .cse38 c_~var_1_65~0))) (< (div .cse38 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse39 .cse15) (< 8 v_z_3) (< .cse39 .cse15)))))) (forall ((v_z_3 Int)) (let ((.cse40 (+ .cse6 v_z_3))) (let ((.cse41 (div .cse40 .cse5)) (.cse42 (div .cse40 c_~var_1_65~0))) (or (not (= 0 (mod .cse40 c_~var_1_65~0))) (< .cse41 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse41) (= .cse42 .cse15) (< 8 v_z_3) (< .cse42 .cse15))))) (or .cse9 .cse43) (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse44 c_~var_1_65~0))) (< (div .cse44 .cse5) .cse15) (not (= (mod .cse44 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 c_~var_1_65~0) .cse15)))) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse6 v_z_3))) (let ((.cse46 (div .cse45 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse45 .cse5) 0) (< (div .cse45 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse46 .cse15) (< 8 v_z_3) (< .cse46 .cse15))))) (or (and (or .cse0 (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse47 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse47 c_~var_1_65~0) .cse15))))) .cse48) .cse7) (or (and .cse49 (or .cse0 (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse50 .cse5) 0) (< 8 v_z_3) (< (div .cse50 c_~var_1_65~0) .cse15)))))) .cse7) (or .cse18 .cse0) (or .cse21 .cse48) (forall ((v_z_3 Int)) (let ((.cse51 (+ .cse6 v_z_3))) (let ((.cse52 (div .cse51 .cse5)) (.cse53 (div .cse51 c_~var_1_65~0))) (or (not (= 0 (mod .cse51 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse51 .cse5) 0) (< .cse52 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse52) (= .cse53 .cse15) (< 8 v_z_3) (< .cse53 .cse15))))) (or (and .cse54 (or (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse6 v_z_3))) (or (< (div .cse55 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse55 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse55 c_~var_1_65~0))))) .cse7)) .cse0) (or .cse56 .cse0) (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse6 v_z_3))) (let ((.cse58 (div .cse57 .cse5)) (.cse59 (div .cse57 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse57 .cse5) 0) (< .cse58 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse58) (= .cse59 .cse15) (< 8 v_z_3) (< .cse59 .cse15))))) (or (and (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse60 c_~var_1_65~0))) (< (div .cse60 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse60 .cse5) 0) (< (div .cse60 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse61) .cse9) (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse6 v_z_3))) (let ((.cse63 (div .cse62 c_~var_1_65~0))) (or (not (= 0 (mod .cse62 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse62 .cse5) 0) (< (div .cse62 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse63 .cse15) (< 8 v_z_3) (< .cse63 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse6 v_z_3))) (let ((.cse65 (div .cse64 c_~var_1_65~0))) (or (not (= 0 (mod .cse64 c_~var_1_65~0))) (< (div .cse64 .cse5) .cse15) (not (= (mod .cse64 .cse5) 0)) (< v_z_3 0) (= .cse65 .cse15) (< 8 v_z_3) (< .cse65 .cse15))))) (or .cse9 .cse16) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse6 v_z_3))) (let ((.cse67 (div .cse66 .cse5))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse66 .cse5) 0) (< .cse67 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse67) (< 8 v_z_3)))))) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse6 v_z_3))) (let ((.cse69 (div .cse68 c_~var_1_65~0))) (or (< (div .cse68 .cse5) .cse15) (not (= (mod .cse68 .cse5) 0)) (< v_z_3 0) (= .cse69 .cse15) (< 8 v_z_3) (< .cse69 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse6 v_z_3))) (or (< (div .cse70 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse70 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse6 v_z_3))) (or (< (div .cse71 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse71 .cse5) 0) (< (div .cse71 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or (and .cse72 (or (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse6 v_z_3))) (or (< (div .cse73 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (not (= (mod .cse73 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse73 c_~var_1_65~0))))) .cse7) .cse74 (or (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse6 v_z_3))) (or (< (div .cse75 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse75 c_~var_1_65~0))))) .cse7)) .cse0) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse6 v_z_3))) (let ((.cse76 (div .cse78 .cse5)) (.cse77 (div .cse78 c_~var_1_65~0))) (or (< .cse76 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse76) (= .cse77 .cse15) (< 8 v_z_3) (< .cse77 .cse15))))) (or .cse29 .cse0) (or .cse79 .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse6 v_z_3))) (let ((.cse81 (div .cse80 .cse5))) (or (not (= 0 (mod .cse80 c_~var_1_65~0))) (= (mod .cse80 .cse5) 0) (< .cse81 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse81) (< 8 v_z_3) (< (div .cse80 c_~var_1_65~0) .cse15)))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse6 v_z_3))) (let ((.cse83 (div .cse82 .cse5))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (< .cse83 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse83) (< 8 v_z_3) (< (div .cse82 c_~var_1_65~0) .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse6 v_z_3))) (or (< (div .cse84 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< (div .cse84 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse85 c_~var_1_65~0))) (< (div .cse85 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3)))) .cse21) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse6 v_z_3))) (or (< (div .cse86 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse86 .cse5) 0) (< 8 v_z_3))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse6 v_z_3))) (let ((.cse87 (div .cse88 .cse5))) (or (< .cse87 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse87) (< 8 v_z_3) (< (div .cse88 c_~var_1_65~0) .cse15)))))) (or .cse21 .cse89) (or .cse56 .cse9) (or .cse0 .cse26) (or .cse90 .cse0) (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse6 v_z_3))) (let ((.cse92 (div .cse91 .cse5)) (.cse93 (div .cse91 c_~var_1_65~0))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (= (mod .cse91 .cse5) 0) (< .cse92 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse92) (= .cse93 .cse15) (< 8 v_z_3) (< .cse93 .cse15))))) (or .cse21 (and .cse94 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse6 v_z_3))) (let ((.cse96 (div .cse95 .cse5))) (or (not (= 0 (mod .cse95 c_~var_1_65~0))) (= (mod .cse95 .cse5) 0) (< .cse96 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse96) (< 8 v_z_3))))) .cse97)) (or .cse9 .cse98) (or (and .cse99 .cse23) .cse9) (or (and (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse6 v_z_3))) (let ((.cse101 (div .cse100 c_~var_1_65~0))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (< (div .cse100 .cse5) .cse15) (= (mod .cse100 .cse5) 0) (< v_z_3 0) (= .cse101 .cse15) (< 8 v_z_3) (< .cse101 .cse15))))) .cse56 .cse99 .cse23 .cse8 .cse102) .cse9) (or (and .cse43 (or (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse6 v_z_3))) (let ((.cse104 (div .cse103 c_~var_1_65~0))) (or (not (= 0 (mod .cse103 c_~var_1_65~0))) (< .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse103 .cse5) 0)) (= .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse6 v_z_3))) (let ((.cse106 (div .cse105 c_~var_1_65~0))) (or (not (= 0 (mod .cse105 c_~var_1_65~0))) (< .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse105 .cse5) 0)) (< v_z_3 .cse3) (= .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse107 .cse108 (or (forall ((v_z_3 Int)) (let ((.cse109 (+ .cse6 v_z_3))) (let ((.cse110 (div .cse109 c_~var_1_65~0))) (or (not (= 0 (mod .cse109 c_~var_1_65~0))) (< .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7)) .cse0) (or (and .cse72 (forall ((v_z_3 Int)) (let ((.cse112 (+ .cse6 v_z_3))) (let ((.cse111 (div .cse112 .cse5))) (or (< .cse3 (+ v_z_3 1)) (< .cse111 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse112 c_~var_1_65~0) .cse36) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse111) (< 8 v_z_3) (= 0 (mod .cse112 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse113 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse113 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse113 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse113 c_~var_1_65~0))))) .cse74 (forall ((v_z_3 Int)) (let ((.cse114 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse114 .cse5) .cse15) (not (= (mod .cse114 .cse5) 0)) (< (div .cse114 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse114 c_~var_1_65~0)))))) .cse9) (or .cse0 (and .cse61 (or (forall ((v_z_3 Int)) (let ((.cse115 (+ .cse6 v_z_3))) (let ((.cse116 (div .cse115 c_~var_1_65~0))) (or (not (= 0 (mod .cse115 c_~var_1_65~0))) (< .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse115 .cse5) 0) (= .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse21 (and .cse94 .cse97)) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse117 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse117 c_~var_1_65~0))) (< (div .cse117 .cse5) .cse15) (not (= (mod .cse117 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3))))) (or (forall ((v_z_3 Int)) (or (< (div (+ .cse6 v_z_3) .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3))) .cse21) (or (forall ((v_z_3 Int)) (let ((.cse118 (+ .cse6 v_z_3))) (let ((.cse119 (div .cse118 c_~var_1_65~0))) (or (not (= 0 (mod .cse118 c_~var_1_65~0))) (not (= (mod .cse118 .cse5) 0)) (< v_z_3 0) (= .cse119 .cse15) (< 8 v_z_3) (< .cse119 .cse15))))) .cse0) (or .cse21 .cse120) (or .cse21 (and (forall ((v_z_3 Int)) (let ((.cse121 (+ .cse6 v_z_3))) (let ((.cse122 (div .cse121 .cse5))) (or (= (mod .cse121 .cse5) 0) (< .cse122 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse122) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse123 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse123 .cse5) 0) (< (div .cse123 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse124 (div (+ .cse6 v_z_3) .cse5))) (or (< .cse124 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse124) (< 8 v_z_3)))))) (or .cse120 .cse7) (or .cse9 (and .cse90 (forall ((v_z_3 Int)) (let ((.cse125 (+ .cse6 v_z_3))) (let ((.cse126 (div .cse125 c_~var_1_65~0))) (or (< (div .cse125 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse125 .cse5) 0) (= .cse126 .cse15) (< 8 v_z_3) (< .cse126 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse127 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse127 .cse5) .cse15) (< (div .cse127 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse127 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse128 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse128 .cse5) 0) (< (div .cse128 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse128 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse128 c_~var_1_65~0))))) (or (and .cse26 .cse28) .cse9) (or .cse0 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse129 (+ .cse6 v_z_3))) (let ((.cse130 (div .cse129 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse129 .cse5) 0) (< .cse130 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse130) (< 8 v_z_3)))))) (or (forall ((v_z_3 Int)) (let ((.cse131 (+ .cse6 v_z_3))) (let ((.cse132 (div .cse131 c_~var_1_65~0))) (or (not (= 0 (mod .cse131 c_~var_1_65~0))) (= (mod .cse131 .cse5) 0) (< (div .cse131 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse132 .cse15) (< 8 v_z_3) (< .cse132 .cse15))))) .cse0) (or .cse54 .cse9) (or .cse133 .cse0) (or (and .cse133 (or (forall ((v_z_3 Int)) (let ((.cse134 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse134 .cse5) 0) (< (div .cse134 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse134 c_~var_1_65~0) .cse15)))) .cse7)) .cse0) (or .cse9 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse135 (+ .cse6 v_z_3))) (let ((.cse136 (div .cse135 .cse5))) (or (= (mod .cse135 .cse5) 0) (< .cse136 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse136) (< 8 v_z_3) (< (div .cse135 c_~var_1_65~0) .cse15)))))) (or .cse9 .cse79) (or .cse10 .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse137 (+ .cse6 v_z_3))) (or (not (= (mod .cse137 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse137 c_~var_1_65~0) .cse15)))) .cse0) .cse37) .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< v_z_3 0) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15))) .cse0) (forall ((v_z_3 Int)) (let ((.cse138 (+ .cse6 v_z_3))) (or (< (div .cse138 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse138 c_~var_1_65~0) .cse15))))) .cse7) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse139 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse139 .cse5) 0) (< (div .cse139 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse139 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse140 (+ .cse6 v_z_3))) (or (< (div .cse140 .cse5) .cse15) (not (= (mod .cse140 .cse5) 0)) (< (div .cse140 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse141 (+ .cse6 v_z_3))) (let ((.cse142 (div .cse141 .cse5))) (or (not (= 0 (mod .cse141 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse141 .cse5) 0) (< .cse142 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse141 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse142) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse143 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse143 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse143 .cse5) 0) (< (div .cse143 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse143 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) .cse9) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse144 (+ .cse6 v_z_3))) (let ((.cse145 (div .cse144 c_~var_1_65~0))) (or (< (div .cse144 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse145 .cse15) (< 8 v_z_3) (< .cse145 .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse146 (+ .cse6 v_z_3))) (or (< (div .cse146 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse146 .cse5) 0) (< (div .cse146 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse146 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse147 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse147 c_~var_1_65~0))) (< (div .cse147 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse147 c_~var_1_65~0) .cse15)))) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse148 (+ .cse6 v_z_3))) (let ((.cse149 (div .cse148 .cse5))) (or (not (= 0 (mod .cse148 c_~var_1_65~0))) (< v_z_3 .cse3) (< .cse149 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse148 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse149) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse150 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse150 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse150 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse150 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse107 .cse108 (forall ((v_z_3 Int)) (let ((.cse151 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse151 c_~var_1_65~0))) (< (div .cse151 .cse5) .cse15) (not (= (mod .cse151 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse151 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse89 .cse7) (or (forall ((v_z_3 Int)) (let ((.cse152 (+ .cse6 v_z_3))) (or (< (div .cse152 .cse5) .cse15) (not (= (mod .cse152 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3)))) .cse21) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse153 (+ .cse6 v_z_3))) (let ((.cse154 (div .cse153 c_~var_1_65~0))) (or (= (mod .cse153 .cse5) 0) (< (div .cse153 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse154 .cse15) (< 8 v_z_3) (< .cse154 .cse15)))))) (or .cse0 (and (or (forall ((v_z_3 Int)) (let ((.cse155 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse155 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse155 .cse5) 0) (< (div .cse155 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse155 c_~var_1_65~0) .cse15)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse156 (+ .cse6 v_z_3))) (let ((.cse157 (div .cse156 c_~var_1_65~0))) (or (not (= 0 (mod .cse156 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse156 .cse5) 0) (< (div .cse156 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse157 .cse15) (< 8 v_z_3) (< .cse157 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse158 (+ .cse6 v_z_3))) (or (< (div .cse158 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse158 c_~var_1_65~0) .cse15)))) (or .cse159 .cse9) (forall ((v_z_3 Int)) (let ((.cse160 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse160 c_~var_1_65~0))) (< (div .cse160 .cse5) .cse15) (not (= (mod .cse160 .cse5) 0)) (< (div .cse160 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or .cse98 .cse0) (or .cse9 (and .cse30 (forall ((v_z_3 Int)) (let ((.cse161 (+ .cse6 v_z_3))) (or (< (div .cse161 .cse5) .cse15) (not (= (mod .cse161 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse161 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse163 (+ .cse6 v_z_3))) (let ((.cse162 (div .cse163 .cse5))) (or (< v_z_3 .cse3) (< .cse162 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse163 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse162) (< 8 v_z_3))))) .cse34 (forall ((v_z_3 Int)) (let ((.cse164 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (< (div .cse164 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse164 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse21 .cse37) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse165 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse165 .cse5) 0) (< (div .cse165 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse165 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse166 (+ .cse6 v_z_3))) (let ((.cse167 (div .cse166 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse166 .cse5) 0) (< .cse167 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse166 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse167) (< 8 v_z_3))))))) (or (and .cse159 (or (forall ((v_z_3 Int)) (let ((.cse169 (+ .cse6 v_z_3))) (let ((.cse168 (div .cse169 c_~var_1_65~0))) (or (< .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse169 .cse5) 0)) (= .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or .cse49 .cse7) (or .cse9 (and .cse8 .cse102)) (forall ((v_z_3 Int)) (let ((.cse170 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse170 c_~var_1_65~0))) (< (div .cse170 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse170 c_~var_1_65~0) .cse15)))))))) is different from false [2025-03-03 20:09:09,979 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_66~0 256))) (let ((.cse175 (+ c_~var_1_65~0 1)) (.cse36 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 2)) (.cse5 (mod c_~var_1_73~0 65536)) (.cse15 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 1)) (.cse6 (* (- 1) .cse3))) (let ((.cse11 (forall ((v_z_3 Int)) (let ((.cse217 (+ .cse6 v_z_3))) (let ((.cse218 (div .cse217 c_~var_1_65~0))) (or (< (div .cse217 .cse5) .cse15) (< v_z_3 0) (= .cse218 .cse15) (< 8 v_z_3) (< .cse218 .cse15)))))) (.cse1 (forall ((v_z_3 Int)) (let ((.cse216 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse216 .cse5) 0) (< (div .cse216 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15)))) (.cse48 (forall ((v_z_3 Int)) (let ((.cse215 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse215 .cse5) 0) (< (div .cse215 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse215 c_~var_1_65~0) .cse15))))) (.cse16 (forall ((v_z_3 Int)) (let ((.cse214 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse214 c_~var_1_65~0))) (< v_z_3 0) (< 8 v_z_3) (< (div .cse214 c_~var_1_65~0) .cse15))))) (.cse29 (forall ((v_z_3 Int)) (let ((.cse213 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse213 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse213 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse213 c_~var_1_65~0) .cse15))))) (.cse56 (forall ((v_z_3 Int)) (let ((.cse211 (+ .cse6 v_z_3))) (let ((.cse212 (div .cse211 c_~var_1_65~0))) (or (not (= 0 (mod .cse211 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse211 .cse5) 0) (< v_z_3 0) (= .cse212 .cse15) (< 8 v_z_3) (< .cse212 .cse15)))))) (.cse99 (forall ((v_z_3 Int)) (let ((.cse209 (+ .cse6 v_z_3))) (let ((.cse210 (div .cse209 c_~var_1_65~0))) (or (not (= 0 (mod .cse209 c_~var_1_65~0))) (< (div .cse209 .cse5) .cse15) (= (mod .cse209 .cse5) 0) (< v_z_3 0) (= .cse210 .cse15) (< 8 v_z_3) (< .cse210 .cse15)))))) (.cse23 (forall ((v_z_3 Int)) (let ((.cse207 (+ .cse6 v_z_3))) (let ((.cse208 (div .cse207 c_~var_1_65~0))) (or (not (= 0 (mod .cse207 c_~var_1_65~0))) (= (mod .cse207 .cse5) 0) (< v_z_3 0) (= .cse208 .cse15) (< 8 v_z_3) (< .cse208 .cse15)))))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse206 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse206 c_~var_1_65~0))) (not (= (mod .cse206 .cse5) 0)) (< (div .cse206 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse205 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse205 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse205 c_~var_1_65~0)))))) (.cse74 (forall ((v_z_3 Int)) (let ((.cse204 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (not (= (mod .cse204 .cse5) 0)) (< (div .cse204 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse204 c_~var_1_65~0)))))) (.cse61 (forall ((v_z_3 Int)) (let ((.cse203 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse203 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse203 .cse5) 0) (< (div .cse203 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse94 (forall ((v_z_3 Int)) (let ((.cse202 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse202 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse202 .cse5) 0) (< (div .cse202 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) (.cse97 (forall ((v_z_3 Int)) (let ((.cse200 (+ .cse6 v_z_3))) (let ((.cse201 (div .cse200 .cse5))) (or (not (= 0 (mod .cse200 c_~var_1_65~0))) (< .cse201 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse201) (< 8 v_z_3)))))) (.cse120 (forall ((v_z_3 Int)) (let ((.cse198 (+ .cse6 v_z_3))) (let ((.cse199 (div .cse198 .cse5))) (or (not (= 0 (mod .cse198 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse198 .cse5) 0) (< .cse199 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse199) (< 8 v_z_3) (< (div .cse198 c_~var_1_65~0) .cse15)))))) (.cse90 (forall ((v_z_3 Int)) (let ((.cse196 (+ .cse6 v_z_3))) (let ((.cse197 (div .cse196 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse196 .cse5) 0) (= .cse197 .cse15) (< 8 v_z_3) (< .cse197 .cse15)))))) (.cse26 (forall ((v_z_3 Int)) (let ((.cse194 (+ .cse6 v_z_3))) (let ((.cse195 (div .cse194 c_~var_1_65~0))) (or (= (mod .cse194 .cse5) 0) (< v_z_3 0) (= .cse195 .cse15) (< 8 v_z_3) (< .cse195 .cse15)))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse192 (+ .cse6 v_z_3))) (let ((.cse193 (div .cse192 c_~var_1_65~0))) (or (< (div .cse192 .cse5) .cse15) (= (mod .cse192 .cse5) 0) (< v_z_3 0) (= .cse193 .cse15) (< 8 v_z_3) (< .cse193 .cse15)))))) (.cse54 (forall ((v_z_3 Int)) (let ((.cse191 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse191 .cse5) 0) (< (div .cse191 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse191 c_~var_1_65~0)))))) (.cse133 (forall ((v_z_3 Int)) (let ((.cse189 (+ .cse6 v_z_3))) (let ((.cse190 (div .cse189 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse189 .cse5) 0) (< (div .cse189 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse190 .cse15) (< 8 v_z_3) (< .cse190 .cse15)))))) (.cse27 (forall ((v_z_3 Int)) (let ((.cse187 (+ .cse6 v_z_3))) (let ((.cse188 (div .cse187 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse187 .cse5) 0) (< v_z_3 0) (= .cse188 .cse15) (< 8 v_z_3) (< .cse188 .cse15)))))) (.cse79 (forall ((v_z_3 Int)) (let ((.cse186 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse186 c_~var_1_65~0))) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse186 c_~var_1_65~0) .cse15))))) (.cse10 (forall ((v_z_3 Int)) (let ((.cse185 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< v_z_3 0) (= .cse185 .cse15) (< 8 v_z_3) (< .cse185 .cse15))))) (.cse107 (forall ((v_z_3 Int)) (let ((.cse184 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse184 c_~var_1_65~0))) (not (= (mod .cse184 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse184 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse108 (forall ((v_z_3 Int)) (let ((.cse183 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse183 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse183 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse89 (forall ((v_z_3 Int)) (let ((.cse181 (+ .cse6 v_z_3))) (let ((.cse182 (div .cse181 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse181 .cse5) 0) (< .cse182 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse182) (< 8 v_z_3) (< (div .cse181 c_~var_1_65~0) .cse15)))))) (.cse98 (forall ((v_z_3 Int)) (let ((.cse180 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse180 c_~var_1_65~0))) (not (= (mod .cse180 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse180 c_~var_1_65~0) .cse15))))) (.cse30 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (.cse34 (forall ((v_z_3 Int)) (let ((.cse179 (+ .cse6 v_z_3))) (or (not (= (mod .cse179 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse179 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse21 (< c_~var_1_65~0 .cse5)) (.cse37 (forall ((v_z_3 Int)) (let ((.cse178 (+ .cse6 v_z_3))) (or (< (div .cse178 .cse5) .cse15) (not (= (mod .cse178 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse178 c_~var_1_65~0) .cse15))))) (.cse159 (forall ((v_z_3 Int)) (let ((.cse177 (+ .cse6 v_z_3))) (or (not (= (mod .cse177 .cse5) 0)) (< (div .cse177 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse0 (< .cse5 .cse175)) (.cse49 (forall ((v_z_3 Int)) (let ((.cse176 (+ .cse6 v_z_3))) (or (< (div .cse176 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse176 .cse5) 0) (< 8 v_z_3) (< (div .cse176 c_~var_1_65~0) .cse15))))) (.cse7 (< c_~var_1_65~0 0)) (.cse9 (< 0 .cse175)) (.cse8 (forall ((v_z_3 Int)) (let ((.cse173 (+ .cse6 v_z_3))) (let ((.cse174 (div .cse173 c_~var_1_65~0))) (or (not (= 0 (mod .cse173 c_~var_1_65~0))) (< v_z_3 0) (= .cse174 .cse15) (< 8 v_z_3) (< .cse174 .cse15)))))) (.cse102 (forall ((v_z_3 Int)) (let ((.cse171 (+ .cse6 v_z_3))) (let ((.cse172 (div .cse171 c_~var_1_65~0))) (or (not (= 0 (mod .cse171 c_~var_1_65~0))) (< (div .cse171 .cse5) .cse15) (< v_z_3 0) (= .cse172 .cse15) (< 8 v_z_3) (< .cse172 .cse15))))))) (and (or .cse0 (and .cse1 (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse6 v_z_3))) (let ((.cse2 (div .cse4 c_~var_1_65~0))) (or (< .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse4 .cse5) 0) (= .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse0 .cse8) (or .cse9 (and .cse10 .cse11)) (forall ((v_z_3 Int)) (let ((.cse12 (+ .cse6 v_z_3))) (let ((.cse13 (div .cse12 .cse5)) (.cse14 (div .cse12 c_~var_1_65~0))) (or (= (mod .cse12 .cse5) 0) (< .cse13 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse13) (= .cse14 .cse15) (< 8 v_z_3) (< .cse14 .cse15))))) (or .cse0 .cse16) (forall ((v_z_3 Int)) (let ((.cse17 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse17 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse17 .cse5) 0) (< (div .cse17 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse17 c_~var_1_65~0) .cse15)))) (or .cse18 .cse9) (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse6 v_z_3))) (let ((.cse20 (div .cse19 c_~var_1_65~0))) (or (not (= (mod .cse19 .cse5) 0)) (< v_z_3 0) (= .cse20 .cse15) (< 8 v_z_3) (< .cse20 .cse15))))) .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse22 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse22 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse22 c_~var_1_65~0)))))) (or .cse23 .cse0) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse6 v_z_3))) (let ((.cse25 (div .cse24 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse24 .cse5) .cse15) (= (mod .cse24 .cse5) 0) (< v_z_3 0) (= .cse25 .cse15) (< 8 v_z_3) (< .cse25 .cse15))))) .cse10 .cse26 .cse27 .cse28 .cse11)) (or .cse1 .cse9) (or (and .cse29 .cse16) .cse9) (or (and .cse30 (or (forall ((v_z_3 Int)) (let ((.cse31 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3)))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse6 v_z_3))) (let ((.cse32 (div .cse33 c_~var_1_65~0))) (or (< .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse33 .cse5) 0)) (< v_z_3 .cse3) (= .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse34) .cse0) (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (< (div .cse35 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse35 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or .cse37 .cse7) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse38 (+ .cse6 v_z_3))) (let ((.cse39 (div .cse38 c_~var_1_65~0))) (or (not (= 0 (mod .cse38 c_~var_1_65~0))) (< (div .cse38 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse39 .cse15) (< 8 v_z_3) (< .cse39 .cse15)))))) (forall ((v_z_3 Int)) (let ((.cse40 (+ .cse6 v_z_3))) (let ((.cse41 (div .cse40 .cse5)) (.cse42 (div .cse40 c_~var_1_65~0))) (or (not (= 0 (mod .cse40 c_~var_1_65~0))) (< .cse41 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse41) (= .cse42 .cse15) (< 8 v_z_3) (< .cse42 .cse15))))) (or .cse9 .cse43) (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse44 c_~var_1_65~0))) (< (div .cse44 .cse5) .cse15) (not (= (mod .cse44 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 c_~var_1_65~0) .cse15)))) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse6 v_z_3))) (let ((.cse46 (div .cse45 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse45 .cse5) 0) (< (div .cse45 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse46 .cse15) (< 8 v_z_3) (< .cse46 .cse15))))) (or (and (or .cse0 (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse47 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse47 c_~var_1_65~0) .cse15))))) .cse48) .cse7) (or (and .cse49 (or .cse0 (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse50 .cse5) 0) (< 8 v_z_3) (< (div .cse50 c_~var_1_65~0) .cse15)))))) .cse7) (or .cse18 .cse0) (or .cse21 .cse48) (forall ((v_z_3 Int)) (let ((.cse51 (+ .cse6 v_z_3))) (let ((.cse52 (div .cse51 .cse5)) (.cse53 (div .cse51 c_~var_1_65~0))) (or (not (= 0 (mod .cse51 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse51 .cse5) 0) (< .cse52 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse52) (= .cse53 .cse15) (< 8 v_z_3) (< .cse53 .cse15))))) (or (and .cse54 (or (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse6 v_z_3))) (or (< (div .cse55 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse55 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse55 c_~var_1_65~0))))) .cse7)) .cse0) (or .cse56 .cse0) (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse6 v_z_3))) (let ((.cse58 (div .cse57 .cse5)) (.cse59 (div .cse57 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse57 .cse5) 0) (< .cse58 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse58) (= .cse59 .cse15) (< 8 v_z_3) (< .cse59 .cse15))))) (or (and (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse60 c_~var_1_65~0))) (< (div .cse60 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse60 .cse5) 0) (< (div .cse60 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse61) .cse9) (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse6 v_z_3))) (let ((.cse63 (div .cse62 c_~var_1_65~0))) (or (not (= 0 (mod .cse62 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse62 .cse5) 0) (< (div .cse62 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse63 .cse15) (< 8 v_z_3) (< .cse63 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse6 v_z_3))) (let ((.cse65 (div .cse64 c_~var_1_65~0))) (or (not (= 0 (mod .cse64 c_~var_1_65~0))) (< (div .cse64 .cse5) .cse15) (not (= (mod .cse64 .cse5) 0)) (< v_z_3 0) (= .cse65 .cse15) (< 8 v_z_3) (< .cse65 .cse15))))) (or .cse9 .cse16) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse6 v_z_3))) (let ((.cse67 (div .cse66 .cse5))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse66 .cse5) 0) (< .cse67 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse67) (< 8 v_z_3)))))) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse6 v_z_3))) (let ((.cse69 (div .cse68 c_~var_1_65~0))) (or (< (div .cse68 .cse5) .cse15) (not (= (mod .cse68 .cse5) 0)) (< v_z_3 0) (= .cse69 .cse15) (< 8 v_z_3) (< .cse69 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse6 v_z_3))) (or (< (div .cse70 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse70 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse6 v_z_3))) (or (< (div .cse71 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse71 .cse5) 0) (< (div .cse71 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or (and .cse72 (or (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse6 v_z_3))) (or (< (div .cse73 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (not (= (mod .cse73 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse73 c_~var_1_65~0))))) .cse7) .cse74 (or (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse6 v_z_3))) (or (< (div .cse75 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse75 c_~var_1_65~0))))) .cse7)) .cse0) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse6 v_z_3))) (let ((.cse76 (div .cse78 .cse5)) (.cse77 (div .cse78 c_~var_1_65~0))) (or (< .cse76 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse76) (= .cse77 .cse15) (< 8 v_z_3) (< .cse77 .cse15))))) (or .cse29 .cse0) (or .cse79 .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse6 v_z_3))) (let ((.cse81 (div .cse80 .cse5))) (or (not (= 0 (mod .cse80 c_~var_1_65~0))) (= (mod .cse80 .cse5) 0) (< .cse81 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse81) (< 8 v_z_3) (< (div .cse80 c_~var_1_65~0) .cse15)))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse6 v_z_3))) (let ((.cse83 (div .cse82 .cse5))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (< .cse83 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse83) (< 8 v_z_3) (< (div .cse82 c_~var_1_65~0) .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse6 v_z_3))) (or (< (div .cse84 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< (div .cse84 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse85 c_~var_1_65~0))) (< (div .cse85 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3)))) .cse21) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse6 v_z_3))) (or (< (div .cse86 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse86 .cse5) 0) (< 8 v_z_3))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse6 v_z_3))) (let ((.cse87 (div .cse88 .cse5))) (or (< .cse87 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse87) (< 8 v_z_3) (< (div .cse88 c_~var_1_65~0) .cse15)))))) (or .cse21 .cse89) (or .cse56 .cse9) (or .cse0 .cse26) (or .cse90 .cse0) (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse6 v_z_3))) (let ((.cse92 (div .cse91 .cse5)) (.cse93 (div .cse91 c_~var_1_65~0))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (= (mod .cse91 .cse5) 0) (< .cse92 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse92) (= .cse93 .cse15) (< 8 v_z_3) (< .cse93 .cse15))))) (or .cse21 (and .cse94 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse6 v_z_3))) (let ((.cse96 (div .cse95 .cse5))) (or (not (= 0 (mod .cse95 c_~var_1_65~0))) (= (mod .cse95 .cse5) 0) (< .cse96 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse96) (< 8 v_z_3))))) .cse97)) (or .cse9 .cse98) (or (and .cse99 .cse23) .cse9) (or (and (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse6 v_z_3))) (let ((.cse101 (div .cse100 c_~var_1_65~0))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (< (div .cse100 .cse5) .cse15) (= (mod .cse100 .cse5) 0) (< v_z_3 0) (= .cse101 .cse15) (< 8 v_z_3) (< .cse101 .cse15))))) .cse56 .cse99 .cse23 .cse8 .cse102) .cse9) (or (and .cse43 (or (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse6 v_z_3))) (let ((.cse104 (div .cse103 c_~var_1_65~0))) (or (not (= 0 (mod .cse103 c_~var_1_65~0))) (< .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse103 .cse5) 0)) (= .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse6 v_z_3))) (let ((.cse106 (div .cse105 c_~var_1_65~0))) (or (not (= 0 (mod .cse105 c_~var_1_65~0))) (< .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse105 .cse5) 0)) (< v_z_3 .cse3) (= .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse107 .cse108 (or (forall ((v_z_3 Int)) (let ((.cse109 (+ .cse6 v_z_3))) (let ((.cse110 (div .cse109 c_~var_1_65~0))) (or (not (= 0 (mod .cse109 c_~var_1_65~0))) (< .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7)) .cse0) (or (and .cse72 (forall ((v_z_3 Int)) (let ((.cse112 (+ .cse6 v_z_3))) (let ((.cse111 (div .cse112 .cse5))) (or (< .cse3 (+ v_z_3 1)) (< .cse111 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse112 c_~var_1_65~0) .cse36) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse111) (< 8 v_z_3) (= 0 (mod .cse112 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse113 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse113 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse113 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse113 c_~var_1_65~0))))) .cse74 (forall ((v_z_3 Int)) (let ((.cse114 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse114 .cse5) .cse15) (not (= (mod .cse114 .cse5) 0)) (< (div .cse114 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse114 c_~var_1_65~0)))))) .cse9) (or .cse0 (and .cse61 (or (forall ((v_z_3 Int)) (let ((.cse115 (+ .cse6 v_z_3))) (let ((.cse116 (div .cse115 c_~var_1_65~0))) (or (not (= 0 (mod .cse115 c_~var_1_65~0))) (< .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse115 .cse5) 0) (= .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse21 (and .cse94 .cse97)) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse117 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse117 c_~var_1_65~0))) (< (div .cse117 .cse5) .cse15) (not (= (mod .cse117 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3))))) (or (forall ((v_z_3 Int)) (or (< (div (+ .cse6 v_z_3) .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3))) .cse21) (or (forall ((v_z_3 Int)) (let ((.cse118 (+ .cse6 v_z_3))) (let ((.cse119 (div .cse118 c_~var_1_65~0))) (or (not (= 0 (mod .cse118 c_~var_1_65~0))) (not (= (mod .cse118 .cse5) 0)) (< v_z_3 0) (= .cse119 .cse15) (< 8 v_z_3) (< .cse119 .cse15))))) .cse0) (or .cse21 .cse120) (or .cse21 (and (forall ((v_z_3 Int)) (let ((.cse121 (+ .cse6 v_z_3))) (let ((.cse122 (div .cse121 .cse5))) (or (= (mod .cse121 .cse5) 0) (< .cse122 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse122) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse123 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse123 .cse5) 0) (< (div .cse123 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse124 (div (+ .cse6 v_z_3) .cse5))) (or (< .cse124 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse124) (< 8 v_z_3)))))) (or .cse120 .cse7) (or .cse9 (and .cse90 (forall ((v_z_3 Int)) (let ((.cse125 (+ .cse6 v_z_3))) (let ((.cse126 (div .cse125 c_~var_1_65~0))) (or (< (div .cse125 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse125 .cse5) 0) (= .cse126 .cse15) (< 8 v_z_3) (< .cse126 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse127 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse127 .cse5) .cse15) (< (div .cse127 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse127 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse128 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse128 .cse5) 0) (< (div .cse128 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse128 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse128 c_~var_1_65~0))))) (or (and .cse26 .cse28) .cse9) (or .cse0 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse129 (+ .cse6 v_z_3))) (let ((.cse130 (div .cse129 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse129 .cse5) 0) (< .cse130 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse130) (< 8 v_z_3)))))) (or (forall ((v_z_3 Int)) (let ((.cse131 (+ .cse6 v_z_3))) (let ((.cse132 (div .cse131 c_~var_1_65~0))) (or (not (= 0 (mod .cse131 c_~var_1_65~0))) (= (mod .cse131 .cse5) 0) (< (div .cse131 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse132 .cse15) (< 8 v_z_3) (< .cse132 .cse15))))) .cse0) (or .cse54 .cse9) (or .cse133 .cse0) (or (and .cse133 (or (forall ((v_z_3 Int)) (let ((.cse134 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse134 .cse5) 0) (< (div .cse134 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse134 c_~var_1_65~0) .cse15)))) .cse7)) .cse0) (or .cse9 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse135 (+ .cse6 v_z_3))) (let ((.cse136 (div .cse135 .cse5))) (or (= (mod .cse135 .cse5) 0) (< .cse136 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse136) (< 8 v_z_3) (< (div .cse135 c_~var_1_65~0) .cse15)))))) (or .cse9 .cse79) (or .cse10 .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse137 (+ .cse6 v_z_3))) (or (not (= (mod .cse137 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse137 c_~var_1_65~0) .cse15)))) .cse0) .cse37) .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< v_z_3 0) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15))) .cse0) (forall ((v_z_3 Int)) (let ((.cse138 (+ .cse6 v_z_3))) (or (< (div .cse138 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse138 c_~var_1_65~0) .cse15))))) .cse7) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse139 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse139 .cse5) 0) (< (div .cse139 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse139 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse140 (+ .cse6 v_z_3))) (or (< (div .cse140 .cse5) .cse15) (not (= (mod .cse140 .cse5) 0)) (< (div .cse140 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse141 (+ .cse6 v_z_3))) (let ((.cse142 (div .cse141 .cse5))) (or (not (= 0 (mod .cse141 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse141 .cse5) 0) (< .cse142 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse141 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse142) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse143 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse143 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse143 .cse5) 0) (< (div .cse143 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse143 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) .cse9) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse144 (+ .cse6 v_z_3))) (let ((.cse145 (div .cse144 c_~var_1_65~0))) (or (< (div .cse144 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse145 .cse15) (< 8 v_z_3) (< .cse145 .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse146 (+ .cse6 v_z_3))) (or (< (div .cse146 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse146 .cse5) 0) (< (div .cse146 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse146 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse147 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse147 c_~var_1_65~0))) (< (div .cse147 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse147 c_~var_1_65~0) .cse15)))) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse148 (+ .cse6 v_z_3))) (let ((.cse149 (div .cse148 .cse5))) (or (not (= 0 (mod .cse148 c_~var_1_65~0))) (< v_z_3 .cse3) (< .cse149 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse148 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse149) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse150 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse150 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse150 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse150 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse107 .cse108 (forall ((v_z_3 Int)) (let ((.cse151 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse151 c_~var_1_65~0))) (< (div .cse151 .cse5) .cse15) (not (= (mod .cse151 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse151 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse89 .cse7) (or (forall ((v_z_3 Int)) (let ((.cse152 (+ .cse6 v_z_3))) (or (< (div .cse152 .cse5) .cse15) (not (= (mod .cse152 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3)))) .cse21) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse153 (+ .cse6 v_z_3))) (let ((.cse154 (div .cse153 c_~var_1_65~0))) (or (= (mod .cse153 .cse5) 0) (< (div .cse153 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse154 .cse15) (< 8 v_z_3) (< .cse154 .cse15)))))) (or .cse0 (and (or (forall ((v_z_3 Int)) (let ((.cse155 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse155 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse155 .cse5) 0) (< (div .cse155 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse155 c_~var_1_65~0) .cse15)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse156 (+ .cse6 v_z_3))) (let ((.cse157 (div .cse156 c_~var_1_65~0))) (or (not (= 0 (mod .cse156 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse156 .cse5) 0) (< (div .cse156 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse157 .cse15) (< 8 v_z_3) (< .cse157 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse158 (+ .cse6 v_z_3))) (or (< (div .cse158 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse158 c_~var_1_65~0) .cse15)))) (or .cse159 .cse9) (forall ((v_z_3 Int)) (let ((.cse160 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse160 c_~var_1_65~0))) (< (div .cse160 .cse5) .cse15) (not (= (mod .cse160 .cse5) 0)) (< (div .cse160 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or .cse98 .cse0) (or .cse9 (and .cse30 (forall ((v_z_3 Int)) (let ((.cse161 (+ .cse6 v_z_3))) (or (< (div .cse161 .cse5) .cse15) (not (= (mod .cse161 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse161 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse163 (+ .cse6 v_z_3))) (let ((.cse162 (div .cse163 .cse5))) (or (< v_z_3 .cse3) (< .cse162 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse163 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse162) (< 8 v_z_3))))) .cse34 (forall ((v_z_3 Int)) (let ((.cse164 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (< (div .cse164 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse164 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse21 .cse37) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse165 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse165 .cse5) 0) (< (div .cse165 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse165 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse166 (+ .cse6 v_z_3))) (let ((.cse167 (div .cse166 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse166 .cse5) 0) (< .cse167 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse166 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse167) (< 8 v_z_3))))))) (or (and .cse159 (or (forall ((v_z_3 Int)) (let ((.cse169 (+ .cse6 v_z_3))) (let ((.cse168 (div .cse169 c_~var_1_65~0))) (or (< .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse169 .cse5) 0)) (= .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or .cse49 .cse7) (or .cse9 (and .cse8 .cse102)) (forall ((v_z_3 Int)) (let ((.cse170 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse170 c_~var_1_65~0))) (< (div .cse170 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse170 c_~var_1_65~0) .cse15)))))))) is different from true