./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 e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-e2fb8be-m [2025-03-08 11:19:22,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:19:22,185 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:19:22,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:19:22,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:19:22,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:19:22,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:19:22,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:19:22,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:19:22,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:19:22,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:19:22,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:19:22,209 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:19:22,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:19:22,209 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:19:22,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:19:22,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:19:22,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:19:22,210 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-08 11:19:22,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:19:22,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:19:22,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:19:22,455 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:19:22,456 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:19:22,457 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-08 11:19:23,543 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0055800/63fd6de2f75d42c89c54b91b53828fb4/FLAGcdd8beacf [2025-03-08 11:19:23,830 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:19:23,830 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-08 11:19:23,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0055800/63fd6de2f75d42c89c54b91b53828fb4/FLAGcdd8beacf [2025-03-08 11:19:23,858 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0055800/63fd6de2f75d42c89c54b91b53828fb4 [2025-03-08 11:19:23,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:19:23,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:19:23,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:19:23,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:19:23,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:19:23,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:19:23" (1/1) ... [2025-03-08 11:19:23,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1fc666 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:23, skipping insertion in model container [2025-03-08 11:19:23,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:19:23" (1/1) ... [2025-03-08 11:19:23,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:19:24,007 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-08 11:19:24,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:19:24,126 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:19:24,133 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-08 11:19:24,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:19:24,222 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:19:24,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24 WrapperNode [2025-03-08 11:19:24,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:19:24,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:19:24,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:19:24,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:19:24,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,327 INFO L138 Inliner]: procedures = 26, calls = 123, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 803 [2025-03-08 11:19:24,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:19:24,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:19:24,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:19:24,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:19:24,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,380 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:19:24,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:19:24,439 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:19:24,439 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:19:24,439 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:19:24,440 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (1/1) ... [2025-03-08 11:19:24,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:19:24,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:24,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:19:24,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:19:24,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:19:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:19:24,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:19:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:19:24,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:19:24,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:19:24,601 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:19:24,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:19:25,335 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: havoc property_#t~bitwise75#1; [2025-03-08 11:19:25,481 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-08 11:19:25,481 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:19:25,502 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:19:25,502 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:19:25,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:19:25 BoogieIcfgContainer [2025-03-08 11:19:25,503 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:19:25,504 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:19:25,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:19:25,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:19:25,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:19:23" (1/3) ... [2025-03-08 11:19:25,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720268fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:19:25, skipping insertion in model container [2025-03-08 11:19:25,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:19:24" (2/3) ... [2025-03-08 11:19:25,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@720268fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:19:25, skipping insertion in model container [2025-03-08 11:19:25,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:19:25" (3/3) ... [2025-03-08 11:19:25,510 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2025-03-08 11:19:25,519 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:19:25,523 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-08 11:19:25,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:19:25,584 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;@55716c55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:19:25,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:19:25,591 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-08 11:19:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-03-08 11:19:25,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:25,631 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-08 11:19:25,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:25,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:25,637 INFO L85 PathProgramCache]: Analyzing trace with hash -94509886, now seen corresponding path program 1 times [2025-03-08 11:19:25,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:25,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116350635] [2025-03-08 11:19:25,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:25,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:25,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-03-08 11:19:25,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-03-08 11:19:25,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:25,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:26,312 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-08 11:19:26,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:26,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116350635] [2025-03-08 11:19:26,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116350635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:26,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:26,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:19:26,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472354037] [2025-03-08 11:19:26,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:26,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:19:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:26,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:19:26,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:19:26,337 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-08 11:19:26,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:26,418 INFO L93 Difference]: Finished difference Result 660 states and 1235 transitions. [2025-03-08 11:19:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:19:26,420 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-08 11:19:26,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:26,430 INFO L225 Difference]: With dead ends: 660 [2025-03-08 11:19:26,430 INFO L226 Difference]: Without dead ends: 330 [2025-03-08 11:19:26,434 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-08 11:19:26,435 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-08 11:19:26,436 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-08 11:19:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-08 11:19:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-08 11:19:26,503 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-08 11:19:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 558 transitions. [2025-03-08 11:19:26,515 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 558 transitions. Word has length 705 [2025-03-08 11:19:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:26,519 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 558 transitions. [2025-03-08 11:19:26,520 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-08 11:19:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 558 transitions. [2025-03-08 11:19:26,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-08 11:19:26,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:26,532 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-08 11:19:26,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 11:19:26,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:26,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:26,535 INFO L85 PathProgramCache]: Analyzing trace with hash -773794870, now seen corresponding path program 1 times [2025-03-08 11:19:26,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:26,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265764922] [2025-03-08 11:19:26,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:26,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:26,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-08 11:19:26,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-08 11:19:26,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:26,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:27,095 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-08 11:19:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265764922] [2025-03-08 11:19:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265764922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:27,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:27,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:19:27,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016863835] [2025-03-08 11:19:27,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:27,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:19:27,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:27,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:19:27,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:19:27,102 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-08 11:19:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:27,214 INFO L93 Difference]: Finished difference Result 849 states and 1441 transitions. [2025-03-08 11:19:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:19:27,216 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-08 11:19:27,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:27,223 INFO L225 Difference]: With dead ends: 849 [2025-03-08 11:19:27,223 INFO L226 Difference]: Without dead ends: 522 [2025-03-08 11:19:27,225 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-08 11:19:27,226 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 319 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:27,226 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.1s Time] [2025-03-08 11:19:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-03-08 11:19:27,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 519. [2025-03-08 11:19:27,284 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-08 11:19:27,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 883 transitions. [2025-03-08 11:19:27,287 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 883 transitions. Word has length 706 [2025-03-08 11:19:27,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:27,288 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 883 transitions. [2025-03-08 11:19:27,289 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-08 11:19:27,289 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 883 transitions. [2025-03-08 11:19:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-08 11:19:27,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:27,302 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-08 11:19:27,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:19:27,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:27,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:27,303 INFO L85 PathProgramCache]: Analyzing trace with hash -235785300, now seen corresponding path program 1 times [2025-03-08 11:19:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:27,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746932443] [2025-03-08 11:19:27,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:27,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-08 11:19:27,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-08 11:19:27,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:27,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:27,867 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-08 11:19:27,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:27,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746932443] [2025-03-08 11:19:27,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746932443] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:19:27,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116694843] [2025-03-08 11:19:27,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:27,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:27,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:27,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:19:27,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:19:28,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-08 11:19:28,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-08 11:19:28,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:28,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:28,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 11:19:28,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:28,350 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-08 11:19:28,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:19:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116694843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:28,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:19:28,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 11:19:28,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355627746] [2025-03-08 11:19:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:28,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:19:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:28,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:19:28,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:19:28,354 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-08 11:19:28,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:28,456 INFO L93 Difference]: Finished difference Result 1377 states and 2347 transitions. [2025-03-08 11:19:28,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:19:28,457 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-08 11:19:28,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:28,466 INFO L225 Difference]: With dead ends: 1377 [2025-03-08 11:19:28,467 INFO L226 Difference]: Without dead ends: 861 [2025-03-08 11:19:28,468 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-08 11:19:28,470 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-08 11:19:28,470 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-08 11:19:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-08 11:19:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 857. [2025-03-08 11:19:28,534 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-08 11:19:28,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1462 transitions. [2025-03-08 11:19:28,538 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1462 transitions. Word has length 706 [2025-03-08 11:19:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:28,539 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1462 transitions. [2025-03-08 11:19:28,540 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-08 11:19:28,540 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1462 transitions. [2025-03-08 11:19:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-08 11:19:28,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:28,545 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-08 11:19:28,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 11:19:28,750 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-08 11:19:28,750 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:28,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:28,751 INFO L85 PathProgramCache]: Analyzing trace with hash 718443595, now seen corresponding path program 1 times [2025-03-08 11:19:28,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:28,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587379944] [2025-03-08 11:19:28,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:28,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:28,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-08 11:19:28,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-08 11:19:28,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:28,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:29,174 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-08 11:19:29,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:29,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587379944] [2025-03-08 11:19:29,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587379944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:19:29,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432929206] [2025-03-08 11:19:29,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:29,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:29,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:29,177 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:19:29,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:19:29,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-08 11:19:29,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-08 11:19:29,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:29,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:29,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 11:19:29,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:29,573 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-08 11:19:29,574 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:19:29,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432929206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:29,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:19:29,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 11:19:29,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96304691] [2025-03-08 11:19:29,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:29,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:19:29,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:29,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:19:29,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 11:19:29,577 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-08 11:19:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:29,734 INFO L93 Difference]: Finished difference Result 2581 states and 4404 transitions. [2025-03-08 11:19:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:19:29,734 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-08 11:19:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:29,746 INFO L225 Difference]: With dead ends: 2581 [2025-03-08 11:19:29,746 INFO L226 Difference]: Without dead ends: 1727 [2025-03-08 11:19:29,748 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-08 11:19:29,749 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-08 11:19:29,750 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-08 11:19:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2025-03-08 11:19:29,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1126. [2025-03-08 11:19:29,829 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-08 11:19:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1930 transitions. [2025-03-08 11:19:29,838 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1930 transitions. Word has length 706 [2025-03-08 11:19:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:29,839 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1930 transitions. [2025-03-08 11:19:29,840 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-08 11:19:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1930 transitions. [2025-03-08 11:19:29,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-08 11:19:29,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:29,850 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-08 11:19:29,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:19:30,050 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-08 11:19:30,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:30,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1886639850, now seen corresponding path program 1 times [2025-03-08 11:19:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:30,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518436663] [2025-03-08 11:19:30,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:30,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:30,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-08 11:19:30,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-08 11:19:30,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:30,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:30,252 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-08 11:19:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518436663] [2025-03-08 11:19:30,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518436663] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:30,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:30,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:19:30,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704658078] [2025-03-08 11:19:30,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:30,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:19:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:30,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:19:30,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:19:30,254 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-08 11:19:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:30,345 INFO L93 Difference]: Finished difference Result 2900 states and 4953 transitions. [2025-03-08 11:19:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:19:30,346 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-08 11:19:30,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:30,355 INFO L225 Difference]: With dead ends: 2900 [2025-03-08 11:19:30,355 INFO L226 Difference]: Without dead ends: 1777 [2025-03-08 11:19:30,360 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-08 11:19:30,360 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-08 11:19:30,361 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-08 11:19:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-03-08 11:19:30,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1774. [2025-03-08 11:19:30,435 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-08 11:19:30,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 3016 transitions. [2025-03-08 11:19:30,443 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 3016 transitions. Word has length 706 [2025-03-08 11:19:30,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:30,445 INFO L471 AbstractCegarLoop]: Abstraction has 1774 states and 3016 transitions. [2025-03-08 11:19:30,445 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-08 11:19:30,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 3016 transitions. [2025-03-08 11:19:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-08 11:19:30,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:30,452 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-08 11:19:30,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:19:30,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:30,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:30,452 INFO L85 PathProgramCache]: Analyzing trace with hash -437387989, now seen corresponding path program 1 times [2025-03-08 11:19:30,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:30,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013676085] [2025-03-08 11:19:30,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:30,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:30,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-08 11:19:30,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-08 11:19:30,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:30,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2025-03-08 11:19:30,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:30,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013676085] [2025-03-08 11:19:30,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013676085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:30,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:30,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:19:30,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868931638] [2025-03-08 11:19:30,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:30,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:19:30,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:30,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:19:30,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:19:30,639 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-08 11:19:30,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:30,736 INFO L93 Difference]: Finished difference Result 3552 states and 6034 transitions. [2025-03-08 11:19:30,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:19:30,736 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-08 11:19:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:30,747 INFO L225 Difference]: With dead ends: 3552 [2025-03-08 11:19:30,747 INFO L226 Difference]: Without dead ends: 1781 [2025-03-08 11:19:30,751 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-08 11:19:30,752 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-08 11:19:30,752 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-08 11:19:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2025-03-08 11:19:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1350. [2025-03-08 11:19:30,825 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-08 11:19:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2325 transitions. [2025-03-08 11:19:30,832 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2325 transitions. Word has length 706 [2025-03-08 11:19:30,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:30,833 INFO L471 AbstractCegarLoop]: Abstraction has 1350 states and 2325 transitions. [2025-03-08 11:19:30,833 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-08 11:19:30,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2325 transitions. [2025-03-08 11:19:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-08 11:19:30,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:30,838 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-08 11:19:30,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:19:30,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:30,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1281859860, now seen corresponding path program 1 times [2025-03-08 11:19:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:30,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815504562] [2025-03-08 11:19:30,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:30,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:30,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-08 11:19:30,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-08 11:19:30,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:30,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:31,163 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-08 11:19:31,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:31,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815504562] [2025-03-08 11:19:31,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815504562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:31,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:31,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:19:31,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696158110] [2025-03-08 11:19:31,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:31,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:19:31,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:31,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:19:31,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:19:31,166 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-08 11:19:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:31,510 INFO L93 Difference]: Finished difference Result 3689 states and 6334 transitions. [2025-03-08 11:19:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:19:31,510 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-08 11:19:31,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:31,520 INFO L225 Difference]: With dead ends: 3689 [2025-03-08 11:19:31,520 INFO L226 Difference]: Without dead ends: 2342 [2025-03-08 11:19:31,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:19:31,523 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-08 11:19:31,524 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-08 11:19:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2025-03-08 11:19:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2332. [2025-03-08 11:19:31,593 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-08 11:19:31,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 4000 transitions. [2025-03-08 11:19:31,601 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 4000 transitions. Word has length 706 [2025-03-08 11:19:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:31,601 INFO L471 AbstractCegarLoop]: Abstraction has 2332 states and 4000 transitions. [2025-03-08 11:19:31,602 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-08 11:19:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 4000 transitions. [2025-03-08 11:19:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-03-08 11:19:31,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:31,608 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-08 11:19:31,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:19:31,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:31,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:31,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1560393394, now seen corresponding path program 1 times [2025-03-08 11:19:31,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:31,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2651175] [2025-03-08 11:19:31,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:31,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:31,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-08 11:19:31,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-08 11:19:31,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:31,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:32,167 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-08 11:19:32,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:32,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2651175] [2025-03-08 11:19:32,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2651175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:32,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:32,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:19:32,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218787051] [2025-03-08 11:19:32,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:32,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:19:32,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:32,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:19:32,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:19:32,170 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-08 11:19:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:32,671 INFO L93 Difference]: Finished difference Result 11362 states and 19488 transitions. [2025-03-08 11:19:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:19:32,672 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-08 11:19:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:32,708 INFO L225 Difference]: With dead ends: 11362 [2025-03-08 11:19:32,708 INFO L226 Difference]: Without dead ends: 9033 [2025-03-08 11:19:32,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:19:32,716 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-08 11:19:32,717 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-08 11:19:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9033 states. [2025-03-08 11:19:33,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9033 to 9025. [2025-03-08 11:19:33,083 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-08 11:19:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9025 states to 9025 states and 15366 transitions. [2025-03-08 11:19:33,113 INFO L78 Accepts]: Start accepts. Automaton has 9025 states and 15366 transitions. Word has length 707 [2025-03-08 11:19:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:33,114 INFO L471 AbstractCegarLoop]: Abstraction has 9025 states and 15366 transitions. [2025-03-08 11:19:33,115 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-08 11:19:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 9025 states and 15366 transitions. [2025-03-08 11:19:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-03-08 11:19:33,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:33,126 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-08 11:19:33,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:19:33,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:33,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1230627633, now seen corresponding path program 1 times [2025-03-08 11:19:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:33,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374849622] [2025-03-08 11:19:33,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:33,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-08 11:19:33,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-08 11:19:33,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:33,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:33,883 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-08 11:19:33,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:33,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374849622] [2025-03-08 11:19:33,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374849622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:19:33,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837748863] [2025-03-08 11:19:33,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:33,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:33,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:33,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:19:33,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 11:19:34,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-08 11:19:34,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-08 11:19:34,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:34,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:34,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:19:34,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:34,900 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-08 11:19:34,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:19:35,487 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-08 11:19:35,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837748863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:19:35,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:19:35,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 11:19:35,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683343922] [2025-03-08 11:19:35,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:19:35,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:19:35,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:35,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:19:35,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:19:35,492 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-08 11:19:36,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:36,292 INFO L93 Difference]: Finished difference Result 18171 states and 30849 transitions. [2025-03-08 11:19:36,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 11:19:36,292 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-08 11:19:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:36,335 INFO L225 Difference]: With dead ends: 18171 [2025-03-08 11:19:36,335 INFO L226 Difference]: Without dead ends: 9149 [2025-03-08 11:19:36,356 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-08 11:19:36,357 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-08 11:19:36,357 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-08 11:19:36,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9149 states. [2025-03-08 11:19:36,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9149 to 9041. [2025-03-08 11:19:36,684 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-08 11:19:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9041 states to 9041 states and 15178 transitions. [2025-03-08 11:19:36,711 INFO L78 Accepts]: Start accepts. Automaton has 9041 states and 15178 transitions. Word has length 707 [2025-03-08 11:19:36,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:36,712 INFO L471 AbstractCegarLoop]: Abstraction has 9041 states and 15178 transitions. [2025-03-08 11:19:36,713 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-08 11:19:36,713 INFO L276 IsEmpty]: Start isEmpty. Operand 9041 states and 15178 transitions. [2025-03-08 11:19:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2025-03-08 11:19:36,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:36,725 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-08 11:19:36,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 11:19:36,927 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-08 11:19:36,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:36,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:36,928 INFO L85 PathProgramCache]: Analyzing trace with hash -952394931, now seen corresponding path program 1 times [2025-03-08 11:19:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650402701] [2025-03-08 11:19:36,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:36,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:36,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-08 11:19:37,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-08 11:19:37,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:37,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:37,572 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-08 11:19:37,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:37,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650402701] [2025-03-08 11:19:37,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650402701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:19:37,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589624631] [2025-03-08 11:19:37,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:37,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:37,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:37,575 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-08 11:19:37,577 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-08 11:19:37,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 707 statements into 1 equivalence classes. [2025-03-08 11:19:37,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 707 of 707 statements. [2025-03-08 11:19:37,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:37,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:37,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 11:19:37,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:38,117 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-08 11:19:38,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:19:38,535 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-08 11:19:38,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589624631] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:19:38,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:19:38,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 11:19:38,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724747428] [2025-03-08 11:19:38,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:19:38,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:19:38,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:38,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:19:38,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:19:38,537 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-08 11:19:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:39,158 INFO L93 Difference]: Finished difference Result 16535 states and 27563 transitions. [2025-03-08 11:19:39,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 11:19:39,159 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-08 11:19:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:39,183 INFO L225 Difference]: With dead ends: 16535 [2025-03-08 11:19:39,183 INFO L226 Difference]: Without dead ends: 7497 [2025-03-08 11:19:39,196 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-08 11:19:39,196 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-08 11:19:39,196 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-08 11:19:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7497 states. [2025-03-08 11:19:39,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7497 to 7389. [2025-03-08 11:19:39,440 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-08 11:19:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7389 states to 7389 states and 12240 transitions. [2025-03-08 11:19:39,463 INFO L78 Accepts]: Start accepts. Automaton has 7389 states and 12240 transitions. Word has length 707 [2025-03-08 11:19:39,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:39,464 INFO L471 AbstractCegarLoop]: Abstraction has 7389 states and 12240 transitions. [2025-03-08 11:19:39,464 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-08 11:19:39,464 INFO L276 IsEmpty]: Start isEmpty. Operand 7389 states and 12240 transitions. [2025-03-08 11:19:39,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-08 11:19:39,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:39,473 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-08 11:19:39,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 11:19:39,674 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-08 11:19:39,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:39,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash 472648617, now seen corresponding path program 1 times [2025-03-08 11:19:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:39,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673157716] [2025-03-08 11:19:39,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:39,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-08 11:19:39,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-08 11:19:39,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:39,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:40,372 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-08 11:19:40,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:40,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673157716] [2025-03-08 11:19:40,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673157716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:19:40,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053962676] [2025-03-08 11:19:40,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:40,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:40,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:40,375 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-08 11:19:40,377 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-08 11:19:40,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-08 11:19:40,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-08 11:19:40,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:40,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:40,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 11:19:40,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:41,393 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-08 11:19:41,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:19:41,832 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-08 11:19:41,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053962676] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 11:19:41,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 11:19:41,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-03-08 11:19:41,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572104136] [2025-03-08 11:19:41,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 11:19:41,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:19:41,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:41,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:19:41,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:19:41,838 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-08 11:19:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:42,493 INFO L93 Difference]: Finished difference Result 14899 states and 24597 transitions. [2025-03-08 11:19:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 11:19:42,494 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-08 11:19:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:42,521 INFO L225 Difference]: With dead ends: 14899 [2025-03-08 11:19:42,521 INFO L226 Difference]: Without dead ends: 7513 [2025-03-08 11:19:42,536 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-08 11:19:42,537 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 317 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:42,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1030 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 11:19:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2025-03-08 11:19:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 7405. [2025-03-08 11:19:42,878 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-08 11:19:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7405 states to 7405 states and 12212 transitions. [2025-03-08 11:19:42,900 INFO L78 Accepts]: Start accepts. Automaton has 7405 states and 12212 transitions. Word has length 709 [2025-03-08 11:19:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:42,902 INFO L471 AbstractCegarLoop]: Abstraction has 7405 states and 12212 transitions. [2025-03-08 11:19:42,902 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-08 11:19:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 7405 states and 12212 transitions. [2025-03-08 11:19:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2025-03-08 11:19:42,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:42,913 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-08 11:19:42,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 11:19:43,117 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-08 11:19:43,117 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:43,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1537455224, now seen corresponding path program 1 times [2025-03-08 11:19:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:43,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520220248] [2025-03-08 11:19:43,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:43,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:43,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-08 11:19:43,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-08 11:19:43,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:43,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:19:43,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293949036] [2025-03-08 11:19:43,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:43,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:43,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:43,525 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-08 11:19:43,528 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-08 11:19:43,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 709 statements into 1 equivalence classes. [2025-03-08 11:19:43,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 709 of 709 statements. [2025-03-08 11:19:43,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:43,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:43,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 11:19:43,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:44,491 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-08 11:19:44,492 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:19:44,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:44,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520220248] [2025-03-08 11:19:44,493 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 11:19:44,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293949036] [2025-03-08 11:19:44,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293949036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:44,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:44,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:19:44,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672906983] [2025-03-08 11:19:44,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:44,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 11:19:44,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:44,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 11:19:44,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:19:44,495 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-08 11:19:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:45,760 INFO L93 Difference]: Finished difference Result 26495 states and 43575 transitions. [2025-03-08 11:19:45,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:19:45,761 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-08 11:19:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:45,812 INFO L225 Difference]: With dead ends: 26495 [2025-03-08 11:19:45,812 INFO L226 Difference]: Without dead ends: 19093 [2025-03-08 11:19:45,827 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-08 11:19:45,828 INFO L435 NwaCegarLoop]: 902 mSDtfsCounter, 720 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:19:45,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 2163 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:19:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19093 states. [2025-03-08 11:19:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19093 to 17959. [2025-03-08 11:19:46,715 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-08 11:19:46,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17959 states to 17959 states and 29548 transitions. [2025-03-08 11:19:46,829 INFO L78 Accepts]: Start accepts. Automaton has 17959 states and 29548 transitions. Word has length 709 [2025-03-08 11:19:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:46,830 INFO L471 AbstractCegarLoop]: Abstraction has 17959 states and 29548 transitions. [2025-03-08 11:19:46,830 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-08 11:19:46,830 INFO L276 IsEmpty]: Start isEmpty. Operand 17959 states and 29548 transitions. [2025-03-08 11:19:46,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-08 11:19:46,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:46,845 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-08 11:19:46,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 11:19:47,049 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-08 11:19:47,050 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:47,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:47,051 INFO L85 PathProgramCache]: Analyzing trace with hash 245495853, now seen corresponding path program 1 times [2025-03-08 11:19:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:47,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022541033] [2025-03-08 11:19:47,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:47,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:47,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-08 11:19:47,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-08 11:19:47,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:47,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:47,416 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-08 11:19:47,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:47,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022541033] [2025-03-08 11:19:47,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022541033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:47,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:47,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:19:47,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219011158] [2025-03-08 11:19:47,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:47,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:19:47,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:47,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:19:47,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:19:47,419 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-08 11:19:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:48,630 INFO L93 Difference]: Finished difference Result 47139 states and 77394 transitions. [2025-03-08 11:19:48,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:19:48,631 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-08 11:19:48,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:48,746 INFO L225 Difference]: With dead ends: 47139 [2025-03-08 11:19:48,746 INFO L226 Difference]: Without dead ends: 29183 [2025-03-08 11:19:48,791 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-08 11:19:48,792 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-08 11:19:48,792 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-08 11:19:48,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29183 states. [2025-03-08 11:19:50,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29183 to 29173. [2025-03-08 11:19:50,152 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-08 11:19:50,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29173 states to 29173 states and 47656 transitions. [2025-03-08 11:19:50,231 INFO L78 Accepts]: Start accepts. Automaton has 29173 states and 47656 transitions. Word has length 710 [2025-03-08 11:19:50,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:50,231 INFO L471 AbstractCegarLoop]: Abstraction has 29173 states and 47656 transitions. [2025-03-08 11:19:50,232 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-08 11:19:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 29173 states and 47656 transitions. [2025-03-08 11:19:50,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-08 11:19:50,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:50,251 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-08 11:19:50,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:19:50,251 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:50,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:50,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1555048857, now seen corresponding path program 1 times [2025-03-08 11:19:50,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:50,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979637876] [2025-03-08 11:19:50,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:50,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:50,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-08 11:19:50,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-08 11:19:50,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:50,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:50,698 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-08 11:19:50,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:19:50,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979637876] [2025-03-08 11:19:50,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979637876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:19:50,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:19:50,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:19:50,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763890169] [2025-03-08 11:19:50,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:19:50,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:19:50,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:19:50,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:19:50,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:19:50,701 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-08 11:19:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:19:53,558 INFO L93 Difference]: Finished difference Result 70289 states and 115055 transitions. [2025-03-08 11:19:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:19:53,559 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-08 11:19:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:19:53,745 INFO L225 Difference]: With dead ends: 70289 [2025-03-08 11:19:53,745 INFO L226 Difference]: Without dead ends: 52333 [2025-03-08 11:19:53,801 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-08 11:19:53,801 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-08 11:19:53,801 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-08 11:19:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52333 states. [2025-03-08 11:19:55,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52333 to 25945. [2025-03-08 11:19:55,619 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-08 11:19:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25945 states to 25945 states and 42292 transitions. [2025-03-08 11:19:55,710 INFO L78 Accepts]: Start accepts. Automaton has 25945 states and 42292 transitions. Word has length 710 [2025-03-08 11:19:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:19:55,711 INFO L471 AbstractCegarLoop]: Abstraction has 25945 states and 42292 transitions. [2025-03-08 11:19:55,711 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-08 11:19:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 25945 states and 42292 transitions. [2025-03-08 11:19:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2025-03-08 11:19:55,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:19:55,727 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-08 11:19:55,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:19:55,727 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:19:55,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:19:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash 605067787, now seen corresponding path program 1 times [2025-03-08 11:19:55,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:19:55,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336739952] [2025-03-08 11:19:55,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:55,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:19:55,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-08 11:19:56,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-08 11:19:56,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:56,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:19:56,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1461377257] [2025-03-08 11:19:56,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:19:56,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:19:56,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:19:56,754 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-08 11:19:56,756 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-08 11:19:56,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 710 statements into 1 equivalence classes. [2025-03-08 11:19:57,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 710 of 710 statements. [2025-03-08 11:19:57,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:19:57,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:19:57,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 11:19:57,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:19:59,366 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-08 11:19:59,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 11:20:11,855 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-08 11:20:15,893 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_66~0 256))) (let ((.cse175 (+ c_~var_1_65~0 1)) (.cse36 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 2)) (.cse5 (mod c_~var_1_73~0 65536)) (.cse15 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 1)) (.cse6 (* (- 1) .cse3))) (let ((.cse11 (forall ((v_z_3 Int)) (let ((.cse217 (+ .cse6 v_z_3))) (let ((.cse218 (div .cse217 c_~var_1_65~0))) (or (< (div .cse217 .cse5) .cse15) (< v_z_3 0) (= .cse218 .cse15) (< 8 v_z_3) (< .cse218 .cse15)))))) (.cse1 (forall ((v_z_3 Int)) (let ((.cse216 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse216 .cse5) 0) (< (div .cse216 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15)))) (.cse48 (forall ((v_z_3 Int)) (let ((.cse215 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse215 .cse5) 0) (< (div .cse215 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse215 c_~var_1_65~0) .cse15))))) (.cse16 (forall ((v_z_3 Int)) (let ((.cse214 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse214 c_~var_1_65~0))) (< v_z_3 0) (< 8 v_z_3) (< (div .cse214 c_~var_1_65~0) .cse15))))) (.cse29 (forall ((v_z_3 Int)) (let ((.cse213 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse213 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse213 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse213 c_~var_1_65~0) .cse15))))) (.cse56 (forall ((v_z_3 Int)) (let ((.cse211 (+ .cse6 v_z_3))) (let ((.cse212 (div .cse211 c_~var_1_65~0))) (or (not (= 0 (mod .cse211 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse211 .cse5) 0) (< v_z_3 0) (= .cse212 .cse15) (< 8 v_z_3) (< .cse212 .cse15)))))) (.cse99 (forall ((v_z_3 Int)) (let ((.cse209 (+ .cse6 v_z_3))) (let ((.cse210 (div .cse209 c_~var_1_65~0))) (or (not (= 0 (mod .cse209 c_~var_1_65~0))) (< (div .cse209 .cse5) .cse15) (= (mod .cse209 .cse5) 0) (< v_z_3 0) (= .cse210 .cse15) (< 8 v_z_3) (< .cse210 .cse15)))))) (.cse23 (forall ((v_z_3 Int)) (let ((.cse207 (+ .cse6 v_z_3))) (let ((.cse208 (div .cse207 c_~var_1_65~0))) (or (not (= 0 (mod .cse207 c_~var_1_65~0))) (= (mod .cse207 .cse5) 0) (< v_z_3 0) (= .cse208 .cse15) (< 8 v_z_3) (< .cse208 .cse15)))))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse206 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse206 c_~var_1_65~0))) (not (= (mod .cse206 .cse5) 0)) (< (div .cse206 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse205 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse205 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse205 c_~var_1_65~0)))))) (.cse74 (forall ((v_z_3 Int)) (let ((.cse204 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (not (= (mod .cse204 .cse5) 0)) (< (div .cse204 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse204 c_~var_1_65~0)))))) (.cse61 (forall ((v_z_3 Int)) (let ((.cse203 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse203 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse203 .cse5) 0) (< (div .cse203 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse94 (forall ((v_z_3 Int)) (let ((.cse202 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse202 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse202 .cse5) 0) (< (div .cse202 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) (.cse97 (forall ((v_z_3 Int)) (let ((.cse200 (+ .cse6 v_z_3))) (let ((.cse201 (div .cse200 .cse5))) (or (not (= 0 (mod .cse200 c_~var_1_65~0))) (< .cse201 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse201) (< 8 v_z_3)))))) (.cse120 (forall ((v_z_3 Int)) (let ((.cse198 (+ .cse6 v_z_3))) (let ((.cse199 (div .cse198 .cse5))) (or (not (= 0 (mod .cse198 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse198 .cse5) 0) (< .cse199 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse199) (< 8 v_z_3) (< (div .cse198 c_~var_1_65~0) .cse15)))))) (.cse90 (forall ((v_z_3 Int)) (let ((.cse196 (+ .cse6 v_z_3))) (let ((.cse197 (div .cse196 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse196 .cse5) 0) (= .cse197 .cse15) (< 8 v_z_3) (< .cse197 .cse15)))))) (.cse26 (forall ((v_z_3 Int)) (let ((.cse194 (+ .cse6 v_z_3))) (let ((.cse195 (div .cse194 c_~var_1_65~0))) (or (= (mod .cse194 .cse5) 0) (< v_z_3 0) (= .cse195 .cse15) (< 8 v_z_3) (< .cse195 .cse15)))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse192 (+ .cse6 v_z_3))) (let ((.cse193 (div .cse192 c_~var_1_65~0))) (or (< (div .cse192 .cse5) .cse15) (= (mod .cse192 .cse5) 0) (< v_z_3 0) (= .cse193 .cse15) (< 8 v_z_3) (< .cse193 .cse15)))))) (.cse54 (forall ((v_z_3 Int)) (let ((.cse191 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse191 .cse5) 0) (< (div .cse191 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse191 c_~var_1_65~0)))))) (.cse133 (forall ((v_z_3 Int)) (let ((.cse189 (+ .cse6 v_z_3))) (let ((.cse190 (div .cse189 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse189 .cse5) 0) (< (div .cse189 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse190 .cse15) (< 8 v_z_3) (< .cse190 .cse15)))))) (.cse27 (forall ((v_z_3 Int)) (let ((.cse187 (+ .cse6 v_z_3))) (let ((.cse188 (div .cse187 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse187 .cse5) 0) (< v_z_3 0) (= .cse188 .cse15) (< 8 v_z_3) (< .cse188 .cse15)))))) (.cse79 (forall ((v_z_3 Int)) (let ((.cse186 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse186 c_~var_1_65~0))) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse186 c_~var_1_65~0) .cse15))))) (.cse10 (forall ((v_z_3 Int)) (let ((.cse185 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< v_z_3 0) (= .cse185 .cse15) (< 8 v_z_3) (< .cse185 .cse15))))) (.cse107 (forall ((v_z_3 Int)) (let ((.cse184 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse184 c_~var_1_65~0))) (not (= (mod .cse184 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse184 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse108 (forall ((v_z_3 Int)) (let ((.cse183 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse183 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse183 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse89 (forall ((v_z_3 Int)) (let ((.cse181 (+ .cse6 v_z_3))) (let ((.cse182 (div .cse181 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse181 .cse5) 0) (< .cse182 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse182) (< 8 v_z_3) (< (div .cse181 c_~var_1_65~0) .cse15)))))) (.cse98 (forall ((v_z_3 Int)) (let ((.cse180 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse180 c_~var_1_65~0))) (not (= (mod .cse180 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse180 c_~var_1_65~0) .cse15))))) (.cse30 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (.cse34 (forall ((v_z_3 Int)) (let ((.cse179 (+ .cse6 v_z_3))) (or (not (= (mod .cse179 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse179 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse21 (< c_~var_1_65~0 .cse5)) (.cse37 (forall ((v_z_3 Int)) (let ((.cse178 (+ .cse6 v_z_3))) (or (< (div .cse178 .cse5) .cse15) (not (= (mod .cse178 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse178 c_~var_1_65~0) .cse15))))) (.cse159 (forall ((v_z_3 Int)) (let ((.cse177 (+ .cse6 v_z_3))) (or (not (= (mod .cse177 .cse5) 0)) (< (div .cse177 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse0 (< .cse5 .cse175)) (.cse49 (forall ((v_z_3 Int)) (let ((.cse176 (+ .cse6 v_z_3))) (or (< (div .cse176 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse176 .cse5) 0) (< 8 v_z_3) (< (div .cse176 c_~var_1_65~0) .cse15))))) (.cse7 (< c_~var_1_65~0 0)) (.cse9 (< 0 .cse175)) (.cse8 (forall ((v_z_3 Int)) (let ((.cse173 (+ .cse6 v_z_3))) (let ((.cse174 (div .cse173 c_~var_1_65~0))) (or (not (= 0 (mod .cse173 c_~var_1_65~0))) (< v_z_3 0) (= .cse174 .cse15) (< 8 v_z_3) (< .cse174 .cse15)))))) (.cse102 (forall ((v_z_3 Int)) (let ((.cse171 (+ .cse6 v_z_3))) (let ((.cse172 (div .cse171 c_~var_1_65~0))) (or (not (= 0 (mod .cse171 c_~var_1_65~0))) (< (div .cse171 .cse5) .cse15) (< v_z_3 0) (= .cse172 .cse15) (< 8 v_z_3) (< .cse172 .cse15))))))) (and (or .cse0 (and .cse1 (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse6 v_z_3))) (let ((.cse2 (div .cse4 c_~var_1_65~0))) (or (< .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse4 .cse5) 0) (= .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse0 .cse8) (or .cse9 (and .cse10 .cse11)) (forall ((v_z_3 Int)) (let ((.cse12 (+ .cse6 v_z_3))) (let ((.cse13 (div .cse12 .cse5)) (.cse14 (div .cse12 c_~var_1_65~0))) (or (= (mod .cse12 .cse5) 0) (< .cse13 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse13) (= .cse14 .cse15) (< 8 v_z_3) (< .cse14 .cse15))))) (or .cse0 .cse16) (forall ((v_z_3 Int)) (let ((.cse17 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse17 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse17 .cse5) 0) (< (div .cse17 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse17 c_~var_1_65~0) .cse15)))) (or .cse18 .cse9) (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse6 v_z_3))) (let ((.cse20 (div .cse19 c_~var_1_65~0))) (or (not (= (mod .cse19 .cse5) 0)) (< v_z_3 0) (= .cse20 .cse15) (< 8 v_z_3) (< .cse20 .cse15))))) .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse22 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse22 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse22 c_~var_1_65~0)))))) (or .cse23 .cse0) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse6 v_z_3))) (let ((.cse25 (div .cse24 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse24 .cse5) .cse15) (= (mod .cse24 .cse5) 0) (< v_z_3 0) (= .cse25 .cse15) (< 8 v_z_3) (< .cse25 .cse15))))) .cse10 .cse26 .cse27 .cse28 .cse11)) (or .cse1 .cse9) (or (and .cse29 .cse16) .cse9) (or (and .cse30 (or (forall ((v_z_3 Int)) (let ((.cse31 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3)))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse6 v_z_3))) (let ((.cse32 (div .cse33 c_~var_1_65~0))) (or (< .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse33 .cse5) 0)) (< v_z_3 .cse3) (= .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse34) .cse0) (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (< (div .cse35 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse35 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or .cse37 .cse7) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse38 (+ .cse6 v_z_3))) (let ((.cse39 (div .cse38 c_~var_1_65~0))) (or (not (= 0 (mod .cse38 c_~var_1_65~0))) (< (div .cse38 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse39 .cse15) (< 8 v_z_3) (< .cse39 .cse15)))))) (forall ((v_z_3 Int)) (let ((.cse40 (+ .cse6 v_z_3))) (let ((.cse41 (div .cse40 .cse5)) (.cse42 (div .cse40 c_~var_1_65~0))) (or (not (= 0 (mod .cse40 c_~var_1_65~0))) (< .cse41 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse41) (= .cse42 .cse15) (< 8 v_z_3) (< .cse42 .cse15))))) (or .cse9 .cse43) (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse44 c_~var_1_65~0))) (< (div .cse44 .cse5) .cse15) (not (= (mod .cse44 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 c_~var_1_65~0) .cse15)))) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse6 v_z_3))) (let ((.cse46 (div .cse45 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse45 .cse5) 0) (< (div .cse45 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse46 .cse15) (< 8 v_z_3) (< .cse46 .cse15))))) (or (and (or .cse0 (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse47 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse47 c_~var_1_65~0) .cse15))))) .cse48) .cse7) (or (and .cse49 (or .cse0 (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse50 .cse5) 0) (< 8 v_z_3) (< (div .cse50 c_~var_1_65~0) .cse15)))))) .cse7) (or .cse18 .cse0) (or .cse21 .cse48) (forall ((v_z_3 Int)) (let ((.cse51 (+ .cse6 v_z_3))) (let ((.cse52 (div .cse51 .cse5)) (.cse53 (div .cse51 c_~var_1_65~0))) (or (not (= 0 (mod .cse51 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse51 .cse5) 0) (< .cse52 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse52) (= .cse53 .cse15) (< 8 v_z_3) (< .cse53 .cse15))))) (or (and .cse54 (or (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse6 v_z_3))) (or (< (div .cse55 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse55 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse55 c_~var_1_65~0))))) .cse7)) .cse0) (or .cse56 .cse0) (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse6 v_z_3))) (let ((.cse58 (div .cse57 .cse5)) (.cse59 (div .cse57 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse57 .cse5) 0) (< .cse58 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse58) (= .cse59 .cse15) (< 8 v_z_3) (< .cse59 .cse15))))) (or (and (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse60 c_~var_1_65~0))) (< (div .cse60 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse60 .cse5) 0) (< (div .cse60 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse61) .cse9) (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse6 v_z_3))) (let ((.cse63 (div .cse62 c_~var_1_65~0))) (or (not (= 0 (mod .cse62 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse62 .cse5) 0) (< (div .cse62 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse63 .cse15) (< 8 v_z_3) (< .cse63 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse6 v_z_3))) (let ((.cse65 (div .cse64 c_~var_1_65~0))) (or (not (= 0 (mod .cse64 c_~var_1_65~0))) (< (div .cse64 .cse5) .cse15) (not (= (mod .cse64 .cse5) 0)) (< v_z_3 0) (= .cse65 .cse15) (< 8 v_z_3) (< .cse65 .cse15))))) (or .cse9 .cse16) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse6 v_z_3))) (let ((.cse67 (div .cse66 .cse5))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse66 .cse5) 0) (< .cse67 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse67) (< 8 v_z_3)))))) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse6 v_z_3))) (let ((.cse69 (div .cse68 c_~var_1_65~0))) (or (< (div .cse68 .cse5) .cse15) (not (= (mod .cse68 .cse5) 0)) (< v_z_3 0) (= .cse69 .cse15) (< 8 v_z_3) (< .cse69 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse6 v_z_3))) (or (< (div .cse70 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse70 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse6 v_z_3))) (or (< (div .cse71 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse71 .cse5) 0) (< (div .cse71 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or (and .cse72 (or (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse6 v_z_3))) (or (< (div .cse73 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (not (= (mod .cse73 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse73 c_~var_1_65~0))))) .cse7) .cse74 (or (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse6 v_z_3))) (or (< (div .cse75 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse75 c_~var_1_65~0))))) .cse7)) .cse0) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse6 v_z_3))) (let ((.cse76 (div .cse78 .cse5)) (.cse77 (div .cse78 c_~var_1_65~0))) (or (< .cse76 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse76) (= .cse77 .cse15) (< 8 v_z_3) (< .cse77 .cse15))))) (or .cse29 .cse0) (or .cse79 .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse6 v_z_3))) (let ((.cse81 (div .cse80 .cse5))) (or (not (= 0 (mod .cse80 c_~var_1_65~0))) (= (mod .cse80 .cse5) 0) (< .cse81 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse81) (< 8 v_z_3) (< (div .cse80 c_~var_1_65~0) .cse15)))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse6 v_z_3))) (let ((.cse83 (div .cse82 .cse5))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (< .cse83 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse83) (< 8 v_z_3) (< (div .cse82 c_~var_1_65~0) .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse6 v_z_3))) (or (< (div .cse84 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< (div .cse84 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse85 c_~var_1_65~0))) (< (div .cse85 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3)))) .cse21) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse6 v_z_3))) (or (< (div .cse86 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse86 .cse5) 0) (< 8 v_z_3))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse6 v_z_3))) (let ((.cse87 (div .cse88 .cse5))) (or (< .cse87 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse87) (< 8 v_z_3) (< (div .cse88 c_~var_1_65~0) .cse15)))))) (or .cse21 .cse89) (or .cse56 .cse9) (or .cse0 .cse26) (or .cse90 .cse0) (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse6 v_z_3))) (let ((.cse92 (div .cse91 .cse5)) (.cse93 (div .cse91 c_~var_1_65~0))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (= (mod .cse91 .cse5) 0) (< .cse92 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse92) (= .cse93 .cse15) (< 8 v_z_3) (< .cse93 .cse15))))) (or .cse21 (and .cse94 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse6 v_z_3))) (let ((.cse96 (div .cse95 .cse5))) (or (not (= 0 (mod .cse95 c_~var_1_65~0))) (= (mod .cse95 .cse5) 0) (< .cse96 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse96) (< 8 v_z_3))))) .cse97)) (or .cse9 .cse98) (or (and .cse99 .cse23) .cse9) (or (and (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse6 v_z_3))) (let ((.cse101 (div .cse100 c_~var_1_65~0))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (< (div .cse100 .cse5) .cse15) (= (mod .cse100 .cse5) 0) (< v_z_3 0) (= .cse101 .cse15) (< 8 v_z_3) (< .cse101 .cse15))))) .cse56 .cse99 .cse23 .cse8 .cse102) .cse9) (or (and .cse43 (or (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse6 v_z_3))) (let ((.cse104 (div .cse103 c_~var_1_65~0))) (or (not (= 0 (mod .cse103 c_~var_1_65~0))) (< .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse103 .cse5) 0)) (= .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse6 v_z_3))) (let ((.cse106 (div .cse105 c_~var_1_65~0))) (or (not (= 0 (mod .cse105 c_~var_1_65~0))) (< .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse105 .cse5) 0)) (< v_z_3 .cse3) (= .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse107 .cse108 (or (forall ((v_z_3 Int)) (let ((.cse109 (+ .cse6 v_z_3))) (let ((.cse110 (div .cse109 c_~var_1_65~0))) (or (not (= 0 (mod .cse109 c_~var_1_65~0))) (< .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7)) .cse0) (or (and .cse72 (forall ((v_z_3 Int)) (let ((.cse112 (+ .cse6 v_z_3))) (let ((.cse111 (div .cse112 .cse5))) (or (< .cse3 (+ v_z_3 1)) (< .cse111 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse112 c_~var_1_65~0) .cse36) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse111) (< 8 v_z_3) (= 0 (mod .cse112 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse113 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse113 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse113 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse113 c_~var_1_65~0))))) .cse74 (forall ((v_z_3 Int)) (let ((.cse114 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse114 .cse5) .cse15) (not (= (mod .cse114 .cse5) 0)) (< (div .cse114 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse114 c_~var_1_65~0)))))) .cse9) (or .cse0 (and .cse61 (or (forall ((v_z_3 Int)) (let ((.cse115 (+ .cse6 v_z_3))) (let ((.cse116 (div .cse115 c_~var_1_65~0))) (or (not (= 0 (mod .cse115 c_~var_1_65~0))) (< .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse115 .cse5) 0) (= .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse21 (and .cse94 .cse97)) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse117 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse117 c_~var_1_65~0))) (< (div .cse117 .cse5) .cse15) (not (= (mod .cse117 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3))))) (or (forall ((v_z_3 Int)) (or (< (div (+ .cse6 v_z_3) .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3))) .cse21) (or (forall ((v_z_3 Int)) (let ((.cse118 (+ .cse6 v_z_3))) (let ((.cse119 (div .cse118 c_~var_1_65~0))) (or (not (= 0 (mod .cse118 c_~var_1_65~0))) (not (= (mod .cse118 .cse5) 0)) (< v_z_3 0) (= .cse119 .cse15) (< 8 v_z_3) (< .cse119 .cse15))))) .cse0) (or .cse21 .cse120) (or .cse21 (and (forall ((v_z_3 Int)) (let ((.cse121 (+ .cse6 v_z_3))) (let ((.cse122 (div .cse121 .cse5))) (or (= (mod .cse121 .cse5) 0) (< .cse122 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse122) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse123 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse123 .cse5) 0) (< (div .cse123 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse124 (div (+ .cse6 v_z_3) .cse5))) (or (< .cse124 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse124) (< 8 v_z_3)))))) (or .cse120 .cse7) (or .cse9 (and .cse90 (forall ((v_z_3 Int)) (let ((.cse125 (+ .cse6 v_z_3))) (let ((.cse126 (div .cse125 c_~var_1_65~0))) (or (< (div .cse125 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse125 .cse5) 0) (= .cse126 .cse15) (< 8 v_z_3) (< .cse126 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse127 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse127 .cse5) .cse15) (< (div .cse127 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse127 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse128 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse128 .cse5) 0) (< (div .cse128 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse128 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse128 c_~var_1_65~0))))) (or (and .cse26 .cse28) .cse9) (or .cse0 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse129 (+ .cse6 v_z_3))) (let ((.cse130 (div .cse129 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse129 .cse5) 0) (< .cse130 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse130) (< 8 v_z_3)))))) (or (forall ((v_z_3 Int)) (let ((.cse131 (+ .cse6 v_z_3))) (let ((.cse132 (div .cse131 c_~var_1_65~0))) (or (not (= 0 (mod .cse131 c_~var_1_65~0))) (= (mod .cse131 .cse5) 0) (< (div .cse131 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse132 .cse15) (< 8 v_z_3) (< .cse132 .cse15))))) .cse0) (or .cse54 .cse9) (or .cse133 .cse0) (or (and .cse133 (or (forall ((v_z_3 Int)) (let ((.cse134 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse134 .cse5) 0) (< (div .cse134 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse134 c_~var_1_65~0) .cse15)))) .cse7)) .cse0) (or .cse9 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse135 (+ .cse6 v_z_3))) (let ((.cse136 (div .cse135 .cse5))) (or (= (mod .cse135 .cse5) 0) (< .cse136 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse136) (< 8 v_z_3) (< (div .cse135 c_~var_1_65~0) .cse15)))))) (or .cse9 .cse79) (or .cse10 .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse137 (+ .cse6 v_z_3))) (or (not (= (mod .cse137 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse137 c_~var_1_65~0) .cse15)))) .cse0) .cse37) .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< v_z_3 0) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15))) .cse0) (forall ((v_z_3 Int)) (let ((.cse138 (+ .cse6 v_z_3))) (or (< (div .cse138 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse138 c_~var_1_65~0) .cse15))))) .cse7) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse139 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse139 .cse5) 0) (< (div .cse139 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse139 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse140 (+ .cse6 v_z_3))) (or (< (div .cse140 .cse5) .cse15) (not (= (mod .cse140 .cse5) 0)) (< (div .cse140 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse141 (+ .cse6 v_z_3))) (let ((.cse142 (div .cse141 .cse5))) (or (not (= 0 (mod .cse141 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse141 .cse5) 0) (< .cse142 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse141 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse142) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse143 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse143 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse143 .cse5) 0) (< (div .cse143 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse143 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) .cse9) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse144 (+ .cse6 v_z_3))) (let ((.cse145 (div .cse144 c_~var_1_65~0))) (or (< (div .cse144 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse145 .cse15) (< 8 v_z_3) (< .cse145 .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse146 (+ .cse6 v_z_3))) (or (< (div .cse146 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse146 .cse5) 0) (< (div .cse146 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse146 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse147 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse147 c_~var_1_65~0))) (< (div .cse147 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse147 c_~var_1_65~0) .cse15)))) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse148 (+ .cse6 v_z_3))) (let ((.cse149 (div .cse148 .cse5))) (or (not (= 0 (mod .cse148 c_~var_1_65~0))) (< v_z_3 .cse3) (< .cse149 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse148 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse149) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse150 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse150 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse150 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse150 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse107 .cse108 (forall ((v_z_3 Int)) (let ((.cse151 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse151 c_~var_1_65~0))) (< (div .cse151 .cse5) .cse15) (not (= (mod .cse151 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse151 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse89 .cse7) (or (forall ((v_z_3 Int)) (let ((.cse152 (+ .cse6 v_z_3))) (or (< (div .cse152 .cse5) .cse15) (not (= (mod .cse152 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3)))) .cse21) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse153 (+ .cse6 v_z_3))) (let ((.cse154 (div .cse153 c_~var_1_65~0))) (or (= (mod .cse153 .cse5) 0) (< (div .cse153 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse154 .cse15) (< 8 v_z_3) (< .cse154 .cse15)))))) (or .cse0 (and (or (forall ((v_z_3 Int)) (let ((.cse155 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse155 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse155 .cse5) 0) (< (div .cse155 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse155 c_~var_1_65~0) .cse15)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse156 (+ .cse6 v_z_3))) (let ((.cse157 (div .cse156 c_~var_1_65~0))) (or (not (= 0 (mod .cse156 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse156 .cse5) 0) (< (div .cse156 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse157 .cse15) (< 8 v_z_3) (< .cse157 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse158 (+ .cse6 v_z_3))) (or (< (div .cse158 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse158 c_~var_1_65~0) .cse15)))) (or .cse159 .cse9) (forall ((v_z_3 Int)) (let ((.cse160 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse160 c_~var_1_65~0))) (< (div .cse160 .cse5) .cse15) (not (= (mod .cse160 .cse5) 0)) (< (div .cse160 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or .cse98 .cse0) (or .cse9 (and .cse30 (forall ((v_z_3 Int)) (let ((.cse161 (+ .cse6 v_z_3))) (or (< (div .cse161 .cse5) .cse15) (not (= (mod .cse161 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse161 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse163 (+ .cse6 v_z_3))) (let ((.cse162 (div .cse163 .cse5))) (or (< v_z_3 .cse3) (< .cse162 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse163 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse162) (< 8 v_z_3))))) .cse34 (forall ((v_z_3 Int)) (let ((.cse164 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (< (div .cse164 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse164 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse21 .cse37) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse165 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse165 .cse5) 0) (< (div .cse165 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse165 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse166 (+ .cse6 v_z_3))) (let ((.cse167 (div .cse166 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse166 .cse5) 0) (< .cse167 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse166 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse167) (< 8 v_z_3))))))) (or (and .cse159 (or (forall ((v_z_3 Int)) (let ((.cse169 (+ .cse6 v_z_3))) (let ((.cse168 (div .cse169 c_~var_1_65~0))) (or (< .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse169 .cse5) 0)) (= .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or .cse49 .cse7) (or .cse9 (and .cse8 .cse102)) (forall ((v_z_3 Int)) (let ((.cse170 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse170 c_~var_1_65~0))) (< (div .cse170 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse170 c_~var_1_65~0) .cse15)))))))) is different from true [2025-03-08 11:20:43,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_66~0 256))) (let ((.cse89 (+ c_~var_1_65~0 1)) (.cse2 (mod c_~var_1_73~0 65536)) (.cse3 (* (- 1) .cse0))) (let ((.cse26 (forall ((v_z_3 Int)) (let ((.cse108 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse108 c_~var_1_65~0))) (= (mod .cse108 .cse2) 0) (< (div .cse108 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse30 (forall ((v_z_3 Int)) (let ((.cse107 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse107 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse107 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse11 (forall ((v_z_3 Int)) (let ((.cse106 (+ .cse3 v_z_3))) (or (not (= (mod .cse106 .cse2) 0)) (< (div .cse106 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse3 v_z_3))) (or (not (= (mod .cse105 .cse2) 0)) (< (div .cse105 .cse2) 1) (< (div .cse105 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse8 (forall ((v_z_3 Int)) (let ((.cse104 (+ .cse3 v_z_3))) (or (< (div .cse104 .cse2) 1) (< (div .cse104 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse12 (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse3 v_z_3))) (or (not (= (mod .cse103 .cse2) 0)) (< (div .cse103 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse38 (forall ((v_z_3 Int)) (let ((.cse102 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse102 c_~var_1_65~0))) (< (div .cse102 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse51 (forall ((v_z_3 Int)) (let ((.cse101 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse101 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse101 .cse2) 0) (< (div .cse101 c_~var_1_65~0) 2) (< 8 v_z_3))))) (.cse40 (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse100 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse100 .cse2) 0))))) (.cse41 (forall ((v_z_3 Int)) (let ((.cse99 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse99 c_~var_1_65~0))) (< (div .cse99 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse20 (forall ((v_z_3 Int)) (let ((.cse98 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse98 .cse2) 0) (< (div .cse98 c_~var_1_65~0) 2) (< 8 v_z_3))))) (.cse25 (forall ((v_z_3 Int)) (let ((.cse97 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse97 c_~var_1_65~0))) (< (div .cse97 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse29 (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (.cse16 (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 1) (< 8 v_z_3)))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse96 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse96 c_~var_1_65~0))) (= (mod .cse96 .cse2) 0) (< (div .cse96 .cse2) 1) (< (div .cse96 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse22 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse3 v_z_3))) (or (= (mod .cse95 .cse2) 0) (< (div .cse95 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (let ((.cse94 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse94 .cse2) 0) (< (div .cse94 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse93 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse93 .cse2) 0) (< (div .cse93 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse6 (forall ((v_z_3 Int)) (let ((.cse92 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse92 .cse2) 0) (< (div .cse92 .cse2) 1) (< (div .cse92 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse7 (< c_~var_1_65~0 0)) (.cse13 (< c_~var_1_65~0 .cse2)) (.cse5 (< .cse2 .cse89)) (.cse17 (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (not (= (mod .cse91 .cse2) 0)) (< (div .cse91 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse31 (forall ((v_z_3 Int)) (let ((.cse90 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse90 c_~var_1_65~0))) (not (= (mod .cse90 .cse2) 0)) (< (div .cse90 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse9 (< 0 .cse89))) (and (forall ((v_z_3 Int)) (let ((.cse1 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse1 .cse2) 0) (< (div .cse1 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse1 .cse2) 0) (= 0 (mod .cse1 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse4 .cse2) 0) (< (div .cse4 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse6 .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))) .cse5) .cse8) .cse7) (or .cse9 (forall ((v_z_3 Int)) (let ((.cse10 (+ .cse3 v_z_3))) (or (= (mod .cse10 .cse2) 0) (< (div .cse10 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse10 c_~var_1_65~0)))))) (or (and (or .cse11 .cse7) .cse12) .cse5) (or .cse13 .cse6) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse14 (+ .cse3 v_z_3))) (or (not (= (mod .cse14 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse14 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse15 (+ .cse3 v_z_3))) (or (not (= (mod .cse15 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse15 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7) (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 2) (< 8 v_z_3))) (or .cse16 .cse7))) (or .cse17 .cse5) (or .cse13 .cse18) (or .cse5 (and (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse3 v_z_3))) (or (= (mod .cse19 .cse2) 0) (< (div .cse19 c_~var_1_65~0) 1) (< 8 v_z_3) (< (div .cse19 .cse2) 0)))) .cse7) .cse20)) (or (forall ((v_z_3 Int)) (let ((.cse21 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse21 c_~var_1_65~0))) (< (div .cse21 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse21 .cse2) 0)))) .cse5) (or .cse22 .cse5) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse23 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse23 c_~var_1_65~0))) (not (= (mod .cse23 .cse2) 0)) (< (div .cse23 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse3 v_z_3))) (or (not (= (mod .cse24 .cse2) 0)) (< (div .cse24 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (or (and .cse25 .cse26) .cse9) (forall ((v_z_3 Int)) (let ((.cse27 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse27 .cse2) 0) (< (div .cse27 .cse2) 1) (< (div .cse27 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse28 .cse13) (or .cse29 .cse5) (or (and .cse22 .cse29) .cse9) (or .cse20 .cse5) (or .cse5 .cse30) (or .cse5 (and .cse17 (or .cse31 .cse7))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse32 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse32 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse32 .cse2) 0) (< (div .cse32 .cse2) 1) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse33 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse33 .cse2) 0) (< (div .cse33 .cse2) 1) (< (div .cse33 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse34 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse34 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse34 .cse2) 0) (< (div .cse34 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse5 (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (= (mod .cse35 .cse2) 0) (< (div .cse35 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse35 .cse2) 0))))) (or (forall ((v_z_3 Int)) (let ((.cse36 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse36 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse36 .cse2) 0) (= 0 (mod .cse36 c_~var_1_65~0))))) .cse13) (forall ((v_z_3 Int)) (let ((.cse37 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse37 c_~var_1_65~0))) (not (= (mod .cse37 .cse2) 0)) (< (div .cse37 .cse2) 1) (< (div .cse37 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or .cse38 .cse9) (or .cse9 .cse26) (or .cse13 (and (forall ((v_z_3 Int)) (let ((.cse39 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse39 c_~var_1_65~0))) (= (mod .cse39 .cse2) 0) (< (div .cse39 .cse2) 1) (< v_z_3 0) (< 8 v_z_3)))) .cse40 .cse41)) (or .cse13 (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) .cse2) 1) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse42 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse42 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse42 .cse2) 0) (< (div .cse42 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse43 .cse13) (or (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse3 v_z_3))) (or (= (mod .cse44 .cse2) 0) (< (div .cse44 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 .cse2) 0)))) .cse5) (or .cse5 .cse26) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse45 c_~var_1_65~0))) (< (div .cse45 .cse2) 1) (< (div .cse45 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse46 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse46 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse46 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse47 c_~var_1_65~0))) (not (= (mod .cse47 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse47 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse48 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse48 c_~var_1_65~0))) (not (= (mod .cse48 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse48 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse30 .cse7))) (or .cse5 (and (or (forall ((v_z_3 Int)) (let ((.cse49 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse49 .cse2) 0) (< v_z_3 0) (< (div .cse49 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse49 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse50 .cse2) 0) (< (div .cse50 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse50 c_~var_1_65~0))))))) (or (and .cse28 (or .cse5 .cse11)) .cse7) (or .cse28 .cse7) (or .cse5 (and .cse51 (or (forall ((v_z_3 Int)) (let ((.cse52 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse52 c_~var_1_65~0))) (= (mod .cse52 .cse2) 0) (< (div .cse52 c_~var_1_65~0) 1) (< 8 v_z_3) (< (div .cse52 .cse2) 0)))) .cse7))) (or .cse13 .cse8) (forall ((v_z_3 Int)) (let ((.cse53 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse53 c_~var_1_65~0))) (= (mod .cse53 .cse2) 0) (< (div .cse53 .cse2) 1) (< (div .cse53 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse54 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (< (div .cse54 .cse2) 1) (< (div .cse54 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse25 .cse5) (or .cse12 .cse5) (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse3 v_z_3))) (or (not (= (mod .cse55 .cse2) 0)) (< (div .cse55 .cse2) 1) (< (div .cse55 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse56 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse56 c_~var_1_65~0))) (< (div .cse56 .cse2) 1) (< (div .cse56 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse57 .cse2) 1) (< v_z_3 0) (< (div .cse57 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse57 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse58 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse58 .cse2) 0) (< (div .cse58 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse58 .cse2) 0)))) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse59 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (not (= (mod .cse59 .cse2) 0)) (< (div .cse59 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse59 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (not (= (mod .cse60 .cse2) 0)) (< v_z_3 0) (< (div .cse60 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse60 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse61 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse61 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse61 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< v_z_3 0) (< (div .cse62 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse62 c_~var_1_65~0))))) .cse7))) (or (forall ((v_z_3 Int)) (let ((.cse63 (+ .cse3 v_z_3))) (or (< (div .cse63 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse63 .cse2) 0)))) .cse5) (or (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< v_z_3 0) (< (div .cse64 c_~var_1_65~0) 0) (< 8 v_z_3) (< (div .cse64 .cse2) 0) (= 0 (mod .cse64 c_~var_1_65~0))))) .cse7) (or .cse9 (and .cse38 (forall ((v_z_3 Int)) (let ((.cse65 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse65 c_~var_1_65~0))) (= (mod .cse65 .cse2) 0) (< (div .cse65 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))))) (or .cse9 .cse12) (or .cse38 .cse5) (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse66 .cse2) 0) (< (div .cse66 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse66 .cse2) 0)))) (or (and .cse51 (or (forall ((v_z_3 Int)) (let ((.cse67 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse67 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse67 .cse2) 0) (< (div .cse67 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7)) .cse5) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse68 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse68 .cse2) 1) (< (div .cse68 c_~var_1_65~0) 1) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse69 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse69 .cse2) 1) (< (div .cse69 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse69 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse70 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse70 .cse2) 1) (< (div .cse70 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse71 .cse2) 1) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse71 c_~var_1_65~0)))))) (or .cse13 (and .cse40 .cse41)) (or (and (or .cse72 .cse7) .cse20) .cse5) (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse73 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse73 .cse2) 0) (< (div .cse73 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3) (< (div .cse73 .cse2) 0)))) (or .cse9 .cse25) (or .cse9 .cse29) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse74 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse74 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse74 .cse2) 1) (< 8 v_z_3))))) (or .cse16 .cse5) (or .cse13 (and (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse3 v_z_3))) (or (= (mod .cse75 .cse2) 0) (< (div .cse75 .cse2) 1) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) .cse2) 1) (< v_z_3 0) (< 8 v_z_3))) (forall ((v_z_3 Int)) (let ((.cse76 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse76 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse76 .cse2) 0)))))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse77 (+ .cse3 v_z_3))) (or (= (mod .cse77 .cse2) 0) (< (div .cse77 .cse2) 1) (< (div .cse77 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (or .cse43 .cse7) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse3 v_z_3))) (or (< (div .cse78 .cse2) 1) (< (div .cse78 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse79 (+ .cse3 v_z_3))) (or (= (mod .cse79 .cse2) 0) (< (div .cse79 .cse2) 1) (< (div .cse79 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or .cse22 .cse9) (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (< (div .cse80 .cse2) 1) (< (div .cse80 c_~var_1_65~0) 1) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse81 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse81 .cse2) 0) (< (div .cse81 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3) (< (div .cse81 .cse2) 0)))) (or .cse5 .cse18)) .cse7) (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (not (= (mod .cse82 .cse2) 0)) (< (div .cse82 .cse2) 1) (< (div .cse82 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) (or (and (or .cse72 .cse5) .cse6) .cse7) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse83 (+ .cse3 v_z_3))) (or (< (div .cse83 .cse2) 1) (< (div .cse83 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse83 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse3 v_z_3))) (or (not (= (mod .cse84 .cse2) 0)) (< (div .cse84 .cse2) 1) (< (div .cse84 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse3 v_z_3))) (or (< (div .cse85 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse85 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse3 v_z_3))) (or (< (div .cse86 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse86 .cse2) 0) (= 0 (mod .cse86 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse87 (+ .cse3 v_z_3))) (or (not (= (mod .cse87 .cse2) 0)) (< (div .cse87 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse87 c_~var_1_65~0))))))) (or (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse88 .cse2) 0) (< (div .cse88 .cse2) 1) (< 8 v_z_3)))) .cse13) (or .cse31 .cse5) (or .cse17 .cse9) (or .cse31 .cse9))))) is different from false