./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.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 fe87987a4c3b43d3e816779d5565e54008de65667868ef23ae879587f6bedbbd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:34:14,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:34:14,104 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:34:14,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:34:14,110 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:34:14,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:34:14,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:34:14,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:34:14,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:34:14,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:34:14,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:34:14,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:34:14,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:34:14,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:34:14,141 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:34:14,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:34:14,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:34:14,142 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:34:14,142 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:34:14,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:34:14,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:34:14,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:34:14,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:34:14,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:34:14,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:34:14,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:34:14,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:34:14,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:34:14,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:34:14,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:34:14,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:34:14,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:34:14,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:34:14,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:34:14,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:34:14,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:34:14,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:34:14,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:34:14,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:34:14,148 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:34:14,148 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:34:14,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:34:14,148 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> fe87987a4c3b43d3e816779d5565e54008de65667868ef23ae879587f6bedbbd [2024-10-13 01:34:14,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:34:14,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:34:14,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:34:14,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:34:14,387 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:34:14,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-10-13 01:34:15,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:34:15,963 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:34:15,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-10-13 01:34:15,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b9799cd8/d453ed5ec6834205b0d1a51fef5f96f9/FLAG9d3dd8689 [2024-10-13 01:34:15,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b9799cd8/d453ed5ec6834205b0d1a51fef5f96f9 [2024-10-13 01:34:15,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:34:15,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:34:15,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:34:15,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:34:15,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:34:15,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:34:15" (1/1) ... [2024-10-13 01:34:15,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d896a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:15, skipping insertion in model container [2024-10-13 01:34:15,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:34:15" (1/1) ... [2024-10-13 01:34:16,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:34:16,149 WARN L248 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_fillercodestructure_filler-pe-ci_file-23.i[919,932] [2024-10-13 01:34:16,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:34:16,218 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:34:16,227 WARN L248 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_fillercodestructure_filler-pe-ci_file-23.i[919,932] [2024-10-13 01:34:16,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:34:16,270 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:34:16,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16 WrapperNode [2024-10-13 01:34:16,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:34:16,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:34:16,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:34:16,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:34:16,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,291 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,331 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-10-13 01:34:16,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:34:16,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:34:16,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:34:16,336 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:34:16,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,372 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]. [2024-10-13 01:34:16,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:34:16,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:34:16,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:34:16,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:34:16,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (1/1) ... [2024-10-13 01:34:16,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:34:16,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:34:16,447 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) [2024-10-13 01:34:16,451 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 [2024-10-13 01:34:16,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:34:16,487 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:34:16,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:34:16,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:34:16,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:34:16,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:34:16,615 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:34:16,617 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:34:16,982 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 01:34:16,982 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:34:17,035 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:34:17,036 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:34:17,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:34:17 BoogieIcfgContainer [2024-10-13 01:34:17,036 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:34:17,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:34:17,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:34:17,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:34:17,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:34:15" (1/3) ... [2024-10-13 01:34:17,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f91da1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:34:17, skipping insertion in model container [2024-10-13 01:34:17,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:34:16" (2/3) ... [2024-10-13 01:34:17,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f91da1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:34:17, skipping insertion in model container [2024-10-13 01:34:17,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:34:17" (3/3) ... [2024-10-13 01:34:17,044 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-10-13 01:34:17,057 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:34:17,057 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:34:17,103 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:34:17,108 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;@6987444d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:34:17,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:34:17,112 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 01:34:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 01:34:17,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:34:17,126 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:34:17,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:34:17,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:34:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash 734730128, now seen corresponding path program 1 times [2024-10-13 01:34:17,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:34:17,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931233161] [2024-10-13 01:34:17,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:34:17,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:34:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:34:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:34:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:34:17,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:34:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:34:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 01:34:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 01:34:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 01:34:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 01:34:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 01:34:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 01:34:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 01:34:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 01:34:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 01:34:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-13 01:34:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 01:34:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 01:34:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 01:34:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:34:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 01:34:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:34:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 01:34:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 01:34:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 01:34:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 01:34:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-13 01:34:17,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:34:17,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931233161] [2024-10-13 01:34:17,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931233161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:34:17,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:34:17,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:34:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779001190] [2024-10-13 01:34:17,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:34:17,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:34:17,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:34:17,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:34:17,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:34:17,522 INFO L87 Difference]: Start difference. First operand has 76 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 01:34:17,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:34:17,570 INFO L93 Difference]: Finished difference Result 149 states and 269 transitions. [2024-10-13 01:34:17,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:34:17,575 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 159 [2024-10-13 01:34:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:34:17,582 INFO L225 Difference]: With dead ends: 149 [2024-10-13 01:34:17,583 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 01:34:17,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:34:17,591 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:34:17,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:34:17,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 01:34:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-13 01:34:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.425531914893617) internal successors, (67), 47 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 01:34:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 117 transitions. [2024-10-13 01:34:17,636 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 117 transitions. Word has length 159 [2024-10-13 01:34:17,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:34:17,636 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 117 transitions. [2024-10-13 01:34:17,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 01:34:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 117 transitions. [2024-10-13 01:34:17,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 01:34:17,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:34:17,643 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:34:17,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:34:17,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:34:17,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:34:17,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1005526750, now seen corresponding path program 1 times [2024-10-13 01:34:17,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:34:17,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544893178] [2024-10-13 01:34:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:34:17,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:34:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:34:17,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [805361624] [2024-10-13 01:34:17,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:34:17,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:34:17,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:34:17,966 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) [2024-10-13 01:34:17,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:34:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:34:18,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-13 01:34:18,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:34:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 869 proven. 44 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-10-13 01:34:19,721 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:34:39,441 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~var_1_13~0 256))) (or (let ((.cse11 (div c_~last_1_var_1_19~0 c_~var_1_20~0))) (let ((.cse10 (= (mod c_~last_1_var_1_19~0 c_~var_1_20~0) 0)) (.cse2 (+ 65536 .cse11)) (.cse0 (< 0 (+ c_~last_1_var_1_19~0 1))) (.cse6 (mod c_~var_1_22~0 65536))) (let ((.cse9 (< c_~var_1_20~0 0)) (.cse122 (and (or .cse0 (forall ((v_z_15 Int) (v_y_15 Int)) (let ((.cse160 (+ (* v_z_15 65535) (* 65536 v_y_15))) (.cse161 (+ v_z_15 .cse6))) (or (= (mod c_~last_1_var_1_19~0 .cse160) 0) (< .cse160 0) (< v_z_15 0) (< .cse11 .cse161) (< .cse160 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse11 .cse161) (< 65535 v_z_15) (< (div c_~last_1_var_1_19~0 .cse160) .cse161))))) (forall ((v_z_15 Int)) (let ((.cse162 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse162) (= .cse11 .cse162) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse163 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse164 (div c_~last_1_var_1_19~0 .cse163))) (or (< .cse163 0) (< .cse4 .cse163) (< .cse163 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse164 .cse162) (= .cse164 .cse162)))))))) (forall ((v_z_15 Int)) (let ((.cse165 (+ v_z_15 .cse6))) (or (= .cse2 .cse165) (< .cse165 65536) (< .cse2 .cse165) (forall ((v_y_15 Int)) (let ((.cse166 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse167 (+ 65536 (div c_~last_1_var_1_19~0 .cse166)))) (or (< .cse166 0) (< .cse4 .cse166) (< .cse166 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse167 .cse165) (= .cse167 .cse165))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse168 (+ v_z_15 .cse6))) (or (= .cse2 .cse168) (< .cse168 65536) (< .cse2 .cse168) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse169 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse170 (div c_~last_1_var_1_19~0 .cse169))) (or (< .cse169 0) (< .cse4 .cse169) (< .cse169 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse170 .cse168) (= .cse170 .cse168)))))))) (forall ((v_z_15 Int)) (let ((.cse171 (+ v_z_15 .cse6))) (or (< .cse11 .cse171) (< .cse171 65536) (forall ((v_y_15 Int)) (let ((.cse172 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse173 (+ 65536 (div c_~last_1_var_1_19~0 .cse172)))) (or (< .cse172 0) (< .cse4 .cse172) (< .cse172 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse173 .cse171) (= .cse173 .cse171))))) (= .cse11 .cse171) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse174 (+ v_z_15 .cse6))) (or (= .cse2 .cse174) (< .cse174 65536) (< .cse2 .cse174) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse175 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse175 0) (< .cse4 .cse175) (< .cse175 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse175) .cse174))))))) (forall ((v_z_15 Int)) (let ((.cse176 (+ v_z_15 .cse6))) (or (< .cse11 .cse176) (< .cse176 65536) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse177 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse178 (div c_~last_1_var_1_19~0 .cse177))) (or (< .cse177 0) (< .cse4 .cse177) (< .cse177 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse178 .cse176) (= .cse178 .cse176)))))))) (forall ((v_z_15 Int)) (let ((.cse179 (+ v_z_15 .cse6))) (or (< .cse11 .cse179) (< .cse179 65536) (forall ((v_y_15 Int)) (let ((.cse180 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse181 (+ 65536 (div c_~last_1_var_1_19~0 .cse180)))) (or (< .cse180 0) (< .cse4 .cse180) (< .cse180 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse181 .cse179) (= .cse181 .cse179))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse182 (+ v_z_15 .cse6))) (or (< .cse11 .cse182) (< .cse182 65536) (= .cse11 .cse182) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse183 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse183 0) (< .cse4 .cse183) (< .cse183 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse183) .cse182))))))) (or (forall ((v_z_15 Int) (v_y_15 Int)) (let ((.cse184 (+ (* v_z_15 65535) (* 65536 v_y_15))) (.cse185 (+ v_z_15 .cse6))) (or (= (mod c_~last_1_var_1_19~0 .cse184) 0) (< .cse184 0) (< v_z_15 0) (< .cse11 .cse185) (< .cse184 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 .cse185) (= .cse11 .cse185) (< (div c_~last_1_var_1_19~0 .cse184) .cse185)))) .cse0) (forall ((v_z_15 Int)) (let ((.cse186 (+ v_z_15 .cse6))) (or (< .cse11 .cse186) (< .cse186 65536) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse187 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse187 0) (< .cse4 .cse187) (< .cse187 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse187) .cse186))))))) (forall ((v_z_15 Int)) (let ((.cse188 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse188) (< 65535 .cse188) (= .cse11 .cse188) (forall ((v_y_15 Int)) (let ((.cse189 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse190 (div c_~last_1_var_1_19~0 .cse189))) (or (< .cse189 0) (< .cse4 .cse189) (< .cse189 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse190 .cse188) (= .cse190 .cse188)))))))))) (.cse61 (not .cse10)) (.cse5 (+ .cse11 65535))) (and (or .cse0 (and (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse3 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse1 (+ .cse6 v_z_6))) (or (= .cse1 .cse2) (< .cse3 0) (< .cse2 .cse1) (< .cse4 .cse3) (< .cse3 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse1 65536) (= .cse5 .cse1)))) (or (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse7 (+ .cse6 v_z_6)) (.cse8 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse2 .cse7) (< .cse4 .cse8) (< .cse8 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse7 65536) (< .cse8 c_~var_1_20~0)))) .cse9)) .cse10) (or (and (forall ((v_z_15 Int)) (let ((.cse12 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse12) (= .cse11 .cse12) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse13 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (= (mod c_~last_1_var_1_19~0 .cse13) 0) (< .cse13 0) (< .cse13 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse13) .cse12))))))) (forall ((v_z_15 Int)) (let ((.cse14 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse14) (< 65535 .cse14) (forall ((v_y_15 Int)) (let ((.cse15 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse16 (div c_~last_1_var_1_19~0 .cse15))) (or (< .cse15 0) (< .cse15 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse16 .cse14) (= .cse16 .cse14))))) (= .cse11 .cse14) (= (+ v_z_15 .cse6 1) .cse11)))) (forall ((v_z_15 Int)) (let ((.cse17 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse17) (forall ((v_y_15 Int)) (let ((.cse18 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse19 (div c_~last_1_var_1_19~0 .cse18))) (or (< .cse18 0) (< .cse18 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse19 .cse17) (= .cse19 .cse17))))) (= .cse11 .cse17) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11)))) (forall ((v_z_15 Int)) (let ((.cse20 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse20) (< 65535 .cse20) (= .cse11 .cse20) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse21 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (= (mod c_~last_1_var_1_19~0 .cse21) 0) (< .cse21 0) (< .cse21 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse21) .cse20))))))) (or .cse9 (and (forall ((v_z_15 Int)) (let ((.cse22 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse22) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse23 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse23 0) (< .cse23 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse23) .cse22))))))) (forall ((v_z_15 Int)) (let ((.cse24 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse24) (forall ((v_y_15 Int)) (let ((.cse25 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse26 (div c_~last_1_var_1_19~0 .cse25))) (or (< .cse25 0) (< .cse25 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse26 .cse24) (= .cse26 .cse24))))) (< 65535 v_z_15))))))) .cse0 .cse10) (forall ((v_z_9 Int)) (let ((.cse27 (+ .cse6 v_z_9 1))) (or (< .cse11 .cse27) (forall ((v_y_9 Int)) (let ((.cse28 (* 65536 v_y_9)) (.cse29 (* v_z_9 65535))) (let ((.cse30 (+ .cse28 .cse29))) (or (< c_~var_1_20~0 (+ .cse28 .cse29 1)) (< .cse30 0) (< .cse4 .cse30) (< .cse30 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (= .cse11 .cse27) (< 65535 v_z_9) (< (+ .cse6 v_z_9) 65536)))) (forall ((v_z_9 Int)) (let ((.cse31 (+ .cse6 v_z_9 1))) (or (< .cse11 .cse31) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse32 (* 65536 v_y_9)) (.cse33 (* v_z_9 65535))) (let ((.cse34 (+ .cse32 .cse33))) (let ((.cse35 (div c_~last_1_var_1_19~0 .cse34)) (.cse36 (+ .cse6 v_z_9))) (or (< c_~var_1_20~0 (+ .cse32 .cse33 1)) (< .cse34 0) (= .cse35 .cse36) (< .cse4 .cse34) (< .cse35 .cse36) (< .cse34 |c_ULTIMATE.start_step_~stepLocal_4~0#1|)))))) (= .cse11 .cse31) (< 65535 v_z_9)))) (forall ((v_z_15 Int)) (let ((.cse37 (+ v_z_15 .cse6))) (or (< .cse11 .cse37) (< .cse37 65536) (= .cse11 .cse37) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse38 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse38 0) (< .cse4 .cse38) (< .cse38 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse38) .cse37))))))) (forall ((v_z_9 Int)) (let ((.cse39 (+ .cse6 v_z_9))) (or (= .cse5 .cse39) (< .cse5 .cse39) (< 65535 v_z_9) (forall ((v_y_9 Int)) (let ((.cse40 (* 65536 v_y_9)) (.cse41 (* v_z_9 65535))) (let ((.cse42 (+ .cse40 .cse41))) (or (< c_~var_1_20~0 (+ .cse40 .cse41 1)) (< .cse42 0) (< .cse4 .cse42) (< (div c_~last_1_var_1_19~0 .cse42) .cse39) (< .cse42 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (< .cse39 65536)))) (forall ((v_z_15 Int)) (let ((.cse43 (+ v_z_15 .cse6))) (or (= .cse5 .cse43) (= .cse2 .cse43) (< .cse43 65536) (< .cse2 .cse43) (forall ((v_y_15 Int)) (let ((.cse44 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse45 (+ 65536 (div c_~last_1_var_1_19~0 .cse44)))) (or (< .cse44 0) (< .cse4 .cse44) (< .cse44 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse45 .cse43) (= .cse45 .cse43))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse46 (+ v_z_15 .cse6))) (or (< .cse11 .cse46) (< .cse46 65536) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse47 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse48 (div c_~last_1_var_1_19~0 .cse47))) (or (< .cse47 0) (< .cse4 .cse47) (< .cse47 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse48 .cse46) (= .cse48 .cse46)))))))) (or (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse49 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse50 (+ .cse6 v_z_6))) (or (< .cse4 .cse49) (< .cse49 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< v_z_6 0) (< 65535 v_z_6) (< .cse11 .cse50) (< .cse49 c_~var_1_20~0) (= .cse50 .cse11)))) .cse9) (forall ((v_z_15 Int)) (let ((.cse51 (+ v_z_15 .cse6))) (or (< .cse11 .cse51) (< .cse51 65536) (forall ((v_y_15 Int)) (let ((.cse52 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse53 (+ 65536 (div c_~last_1_var_1_19~0 .cse52)))) (or (< .cse52 0) (< .cse4 .cse52) (< .cse52 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse53 .cse51) (= .cse53 .cse51))))) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11)))) (or .cse0 (and (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse54 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse55 (+ .cse6 v_z_6))) (or (< .cse54 0) (< .cse4 .cse54) (< .cse54 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< v_z_6 0) (< 65535 v_z_6) (< .cse11 .cse55) (= .cse55 .cse11) (= (+ .cse6 v_z_6 1) .cse11)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse56 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse57 (+ .cse6 v_z_6))) (or (< .cse56 0) (< .cse4 .cse56) (< .cse56 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse11 .cse57) (< .cse57 65536)))) (or (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse58 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse4 .cse58) (< .cse58 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< v_z_6 0) (< 65535 v_z_6) (< .cse11 (+ .cse6 v_z_6)) (< .cse58 c_~var_1_20~0)))) .cse9) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse59 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse60 (+ .cse6 v_z_6))) (or (< .cse59 0) (< .cse4 .cse59) (< .cse59 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse11 .cse60) (< .cse60 65536) (= (+ .cse6 v_z_6 1) .cse11))))) .cse10) (or .cse61 (and (forall ((v_z_9 Int)) (let ((.cse65 (+ .cse6 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse62 (* 65536 v_y_9)) (.cse63 (* v_z_9 65535))) (let ((.cse64 (+ .cse62 .cse63))) (or (< c_~var_1_20~0 (+ .cse62 .cse63 1)) (< .cse64 0) (< .cse4 .cse64) (< .cse64 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (< .cse5 .cse65) (< 65535 v_z_9) (< .cse65 65536)))) (forall ((v_z_9 Int)) (let ((.cse70 (+ .cse6 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse66 (* 65536 v_y_9)) (.cse67 (* v_z_9 65535))) (let ((.cse68 (+ .cse66 .cse67))) (let ((.cse69 (div c_~last_1_var_1_19~0 .cse68))) (or (< c_~var_1_20~0 (+ .cse66 .cse67 1)) (< .cse68 0) (= .cse69 .cse70) (< .cse4 .cse68) (< .cse69 .cse70) (< .cse68 |c_ULTIMATE.start_step_~stepLocal_4~0#1|)))))) (< .cse5 .cse70) (< 65535 v_z_9) (< .cse70 65536)))) (forall ((v_z_9 Int)) (let ((.cse71 (+ .cse6 v_z_9))) (or (< .cse5 .cse71) (< 65535 v_z_9) (forall ((v_y_9 Int)) (let ((.cse72 (* 65536 v_y_9)) (.cse73 (* v_z_9 65535))) (let ((.cse74 (+ .cse72 .cse73))) (or (< c_~var_1_20~0 (+ .cse72 .cse73 1)) (< .cse74 0) (< .cse4 .cse74) (< (div c_~last_1_var_1_19~0 .cse74) .cse71) (< .cse74 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (< .cse71 65536)))) (forall ((v_z_9 Int)) (or (< .cse11 (+ .cse6 v_z_9 1)) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse75 (* 65536 v_y_9)) (.cse76 (* v_z_9 65535))) (let ((.cse77 (+ .cse75 .cse76))) (let ((.cse78 (div c_~last_1_var_1_19~0 .cse77)) (.cse79 (+ .cse6 v_z_9))) (or (< c_~var_1_20~0 (+ .cse75 .cse76 1)) (< .cse77 0) (= .cse78 .cse79) (< .cse4 .cse77) (< .cse78 .cse79) (< .cse77 |c_ULTIMATE.start_step_~stepLocal_4~0#1|)))))) (< 65535 v_z_9))))) (forall ((v_z_15 Int)) (let ((.cse80 (+ v_z_15 .cse6))) (or (= .cse5 .cse80) (= .cse2 .cse80) (< .cse80 65536) (< .cse2 .cse80) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse81 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse81 0) (< .cse4 .cse81) (< .cse81 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse81) .cse80))))))) (forall ((v_z_15 Int)) (let ((.cse82 (+ v_z_15 .cse6))) (or (< .cse11 .cse82) (< .cse82 65536) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse83 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse83 0) (< .cse4 .cse83) (< .cse83 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse83) .cse82))))))) (or .cse61 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse84 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse85 (+ .cse6 v_z_6))) (or (< .cse84 0) (< .cse4 .cse84) (< .cse84 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< v_z_6 0) (< 65535 v_z_6) (< .cse11 .cse85) (< .cse84 c_~var_1_20~0) (= .cse85 .cse11))))) (forall ((v_z_15 Int)) (let ((.cse86 (+ v_z_15 .cse6))) (or (= .cse5 .cse86) (= .cse2 .cse86) (< .cse86 65536) (< .cse2 .cse86) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse87 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse87 0) (< .cse4 .cse87) (< .cse87 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse87) .cse86))))))) (forall ((v_z_15 Int)) (let ((.cse88 (+ v_z_15 .cse6))) (or (< .cse11 .cse88) (< .cse88 65536) (forall ((v_y_15 Int)) (let ((.cse89 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse90 (+ 65536 (div c_~last_1_var_1_19~0 .cse89)))) (or (< .cse89 0) (< .cse4 .cse89) (< .cse89 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse90 .cse88) (= .cse90 .cse88))))) (= .cse11 .cse88) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11)))) (forall ((v_z_15 Int)) (let ((.cse91 (+ v_z_15 .cse6))) (or (= .cse5 .cse91) (= .cse2 .cse91) (< .cse91 65536) (< .cse2 .cse91) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse92 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse93 (div c_~last_1_var_1_19~0 .cse92))) (or (< .cse92 0) (< .cse4 .cse92) (< .cse92 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse93 .cse91) (= .cse93 .cse91)))))))) (forall ((v_z_15 Int)) (let ((.cse94 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse94) (< 65535 .cse94) (= .cse11 .cse94) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse95 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse96 (div c_~last_1_var_1_19~0 .cse95))) (or (< .cse95 0) (< .cse4 .cse95) (< .cse95 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse96 .cse94) (= .cse96 .cse94)))))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse97 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse98 (+ .cse6 v_z_6))) (or (< .cse97 0) (< .cse4 .cse97) (< .cse97 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< v_z_6 0) (< 65535 v_z_6) (< .cse11 .cse98) (< .cse97 c_~var_1_20~0) (= .cse98 .cse11) (= (+ .cse6 v_z_6 1) .cse11)))) (forall ((v_z_9 Int)) (let ((.cse102 (+ .cse6 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse99 (* 65536 v_y_9)) (.cse100 (* v_z_9 65535))) (let ((.cse101 (+ .cse99 .cse100))) (or (< c_~var_1_20~0 (+ .cse99 .cse100 1)) (< .cse101 0) (< .cse4 .cse101) (< .cse101 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (= .cse5 .cse102) (< .cse5 .cse102) (< 65535 v_z_9) (< .cse102 65536)))) (forall ((v_z_15 Int)) (let ((.cse103 (+ v_z_15 .cse6))) (or (= .cse5 .cse103) (= .cse2 .cse103) (< .cse103 65536) (< .cse2 .cse103) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse104 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse105 (div c_~last_1_var_1_19~0 .cse104))) (or (< .cse104 0) (< .cse4 .cse104) (< .cse104 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse105 .cse103) (= .cse105 .cse103)))))))) (or (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse106 (+ .cse6 v_z_6)) (.cse107 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (= .cse106 .cse2) (< .cse2 .cse106) (< .cse4 .cse107) (< .cse107 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse106 65536) (< .cse107 c_~var_1_20~0)))) .cse9) (or (forall ((v_z_15 Int) (v_y_15 Int)) (let ((.cse108 (+ (* v_z_15 65535) (* 65536 v_y_15))) (.cse109 (+ v_z_15 .cse6))) (or (= (mod c_~last_1_var_1_19~0 .cse108) 0) (< .cse108 0) (< v_z_15 0) (< .cse11 .cse109) (< .cse108 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 .cse109) (= .cse11 .cse109) (= (+ v_z_15 .cse6 1) .cse11) (< (div c_~last_1_var_1_19~0 .cse108) .cse109)))) .cse0) (forall ((v_z_9 Int)) (let ((.cse110 (+ .cse6 v_z_9))) (or (= .cse5 .cse110) (forall ((v_y_9 Int)) (let ((.cse111 (* 65536 v_y_9)) (.cse112 (* v_z_9 65535))) (let ((.cse113 (+ .cse111 .cse112))) (let ((.cse114 (div c_~last_1_var_1_19~0 .cse113))) (or (< c_~var_1_20~0 (+ .cse111 .cse112 1)) (< .cse113 0) (= .cse114 .cse110) (< .cse4 .cse113) (< .cse114 .cse110) (< .cse113 |c_ULTIMATE.start_step_~stepLocal_4~0#1|)))))) (< .cse5 .cse110) (< 65535 v_z_9) (< .cse110 65536)))) (or (forall ((v_z_15 Int) (v_y_15 Int)) (let ((.cse115 (+ (* v_z_15 65535) (* 65536 v_y_15))) (.cse116 (+ v_z_15 .cse6))) (or (= (mod c_~last_1_var_1_19~0 .cse115) 0) (< .cse115 0) (< v_z_15 0) (< .cse11 .cse116) (< .cse115 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse11 .cse116) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (< (div c_~last_1_var_1_19~0 .cse115) .cse116)))) .cse0) (forall ((v_z_15 Int)) (let ((.cse117 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse117) (= .cse11 .cse117) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse118 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse119 (div c_~last_1_var_1_19~0 .cse118))) (or (< .cse118 0) (< .cse4 .cse118) (< .cse118 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse119 .cse117) (= .cse119 .cse117)))))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse120 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse121 (+ .cse6 v_z_6))) (or (< .cse120 0) (< .cse4 .cse120) (< .cse120 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse11 .cse121) (< .cse121 65536) (< .cse120 c_~var_1_20~0) (= .cse121 .cse11)))) (or .cse9 .cse122) (forall ((v_z_9 Int)) (let ((.cse123 (+ .cse6 v_z_9 1)) (.cse128 (+ .cse6 v_z_9))) (or (< .cse11 .cse123) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse124 (* 65536 v_y_9)) (.cse125 (* v_z_9 65535))) (let ((.cse126 (+ .cse124 .cse125))) (let ((.cse127 (div c_~last_1_var_1_19~0 .cse126))) (or (< c_~var_1_20~0 (+ .cse124 .cse125 1)) (< .cse126 0) (= .cse127 .cse128) (< .cse4 .cse126) (< .cse127 .cse128) (< .cse126 |c_ULTIMATE.start_step_~stepLocal_4~0#1|)))))) (= .cse11 .cse123) (< 65535 .cse128)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse130 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse129 (+ .cse6 v_z_6))) (or (= .cse129 .cse2) (< .cse130 0) (< .cse2 .cse129) (< .cse4 .cse130) (< .cse130 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse129 65536) (< .cse130 c_~var_1_20~0) (= .cse5 .cse129)))) (or .cse9 (and (forall ((v_z_12 Int)) (or (< 65535 v_z_12) (< v_z_12 0) (forall ((v_y_12 Int)) (let ((.cse134 (* 65536 v_y_12)) (.cse135 (* v_z_12 65535))) (let ((.cse133 (+ .cse134 .cse135))) (let ((.cse132 (div c_~last_1_var_1_19~0 .cse133)) (.cse131 (+ v_z_12 .cse6))) (or (= .cse131 .cse132) (< .cse132 .cse131) (< .cse133 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< c_~var_1_20~0 (+ .cse134 .cse135 1)) (< .cse4 .cse133) (< .cse133 0)))))))) (or (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse137 (* 65536 v_y_14)) (.cse138 (* v_z_14 65535))) (let ((.cse136 (+ .cse137 .cse138))) (or (< .cse136 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= (mod c_~last_1_var_1_19~0 .cse136) 0) (< .cse136 0) (< c_~var_1_20~0 (+ .cse137 .cse138 1)) (< 65535 v_z_14) (< (div c_~last_1_var_1_19~0 .cse136) (+ v_z_14 .cse6)) (< v_z_14 0))))) .cse0) (forall ((v_z_12 Int)) (let ((.cse139 (+ v_z_12 .cse6))) (or (forall ((v_y_12 Int)) (let ((.cse143 (* 65536 v_y_12)) (.cse144 (* v_z_12 65535))) (let ((.cse141 (+ .cse143 .cse144))) (let ((.cse140 (div c_~last_1_var_1_19~0 .cse141))) (let ((.cse142 (+ 65536 .cse140))) (or (= .cse139 .cse140) (< .cse141 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse139 .cse142) (< c_~var_1_20~0 (+ .cse143 .cse144 1)) (< .cse4 .cse141) (< .cse141 0) (< .cse142 .cse139))))))) (< 65535 v_z_12) (< .cse139 65536)))) (forall ((v_z_12 Int)) (let ((.cse146 (+ v_z_12 .cse6))) (or (< 65535 v_z_12) (forall ((v_y_12 Int)) (let ((.cse148 (* 65536 v_y_12)) (.cse149 (* v_z_12 65535))) (let ((.cse145 (+ .cse148 .cse149))) (let ((.cse147 (+ 65536 (div c_~last_1_var_1_19~0 .cse145)))) (or (< .cse145 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse146 .cse147) (< c_~var_1_20~0 (+ .cse148 .cse149 1)) (< .cse4 .cse145) (< .cse145 0) (< .cse147 .cse146)))))) (< .cse146 65536)))))) (forall ((v_z_9 Int)) (or (< .cse11 (+ .cse6 v_z_9 1)) (forall ((v_y_9 Int)) (let ((.cse150 (* 65536 v_y_9)) (.cse151 (* v_z_9 65535))) (let ((.cse152 (+ .cse150 .cse151))) (or (< c_~var_1_20~0 (+ .cse150 .cse151 1)) (< .cse152 0) (< .cse4 .cse152) (< .cse152 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (< 65535 v_z_9) (< (+ .cse6 v_z_9) 65536))) (or .cse61 .cse122) (or .cse61 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse153 (+ .cse6 v_z_6)) (.cse154 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (= .cse153 .cse2) (< .cse154 0) (< .cse2 .cse153) (< .cse4 .cse154) (< .cse154 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse153 65536) (< .cse154 c_~var_1_20~0))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse156 (+ .cse6 v_z_6)) (.cse155 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse155 0) (< .cse4 .cse155) (< .cse155 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse11 .cse156) (< .cse156 65536) (< .cse155 c_~var_1_20~0)))) (forall ((v_z_15 Int)) (let ((.cse157 (+ v_z_15 .cse6))) (or (= .cse5 .cse157) (= .cse2 .cse157) (< .cse157 65536) (< .cse2 .cse157) (forall ((v_y_15 Int)) (let ((.cse158 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse159 (+ 65536 (div c_~last_1_var_1_19~0 .cse158)))) (or (< .cse158 0) (< .cse4 .cse158) (< .cse158 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse159 .cse157) (= .cse159 .cse157))))) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11)))))))) (< .cse4 (mod c_~var_1_40~0 256)))) is different from true [2024-10-13 01:34:52,631 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_13~0 256))) (or (let ((.cse4 (div c_~last_1_var_1_19~0 c_~var_1_20~0))) (let ((.cse27 (+ 65536 .cse4)) (.cse5 (mod c_~var_1_22~0 65536)) (.cse42 (= (mod c_~last_1_var_1_19~0 c_~var_1_20~0) 0))) (let ((.cse41 (< 0 (+ c_~last_1_var_1_19~0 1))) (.cse6 (not .cse42)) (.cse80 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse155 (+ .cse5 v_z_6)) (.cse156 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (= .cse155 .cse27) (< .cse156 5) (< .cse27 .cse155) (< .cse0 .cse156) (< 65535 v_z_6) (< .cse155 65536) (< .cse156 c_~var_1_20~0))))) (.cse61 (and (forall ((v_z_15 Int)) (let ((.cse130 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse128 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse129 (+ 65536 (div c_~last_1_var_1_19~0 .cse128)))) (or (< .cse0 .cse128) (< .cse128 5) (< .cse129 .cse130) (= .cse129 .cse130))))) (= .cse27 .cse130) (< .cse130 65536) (< .cse27 .cse130) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse131 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse131) (< 65535 .cse131) (forall ((v_y_15 Int)) (let ((.cse132 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse133 (div c_~last_1_var_1_19~0 .cse132))) (or (< .cse0 .cse132) (< .cse132 5) (< .cse133 .cse131) (= .cse133 .cse131))))) (= .cse4 .cse131)))) (forall ((v_z_15 Int)) (let ((.cse134 (+ v_z_15 .cse5))) (or (= .cse27 .cse134) (forall ((v_y_15 Int)) (let ((.cse135 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse135) (< .cse135 5) (< (div c_~last_1_var_1_19~0 .cse135) .cse134)))) (< .cse134 65536) (< .cse27 .cse134) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse136 (+ v_z_15 .cse5))) (or (< .cse4 .cse136) (forall ((v_y_15 Int)) (let ((.cse137 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse137) (< .cse137 5) (< (div c_~last_1_var_1_19~0 .cse137) .cse136)))) (< .cse136 65536) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse138 (+ v_z_15 .cse5))) (or (< .cse4 .cse138) (forall ((v_y_15 Int)) (let ((.cse139 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse139) (< .cse139 5) (< (div c_~last_1_var_1_19~0 .cse139) .cse138)))) (< .cse138 65536) (= .cse4 .cse138) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse140 (+ v_z_15 .cse5))) (or (= .cse27 .cse140) (< .cse140 65536) (< .cse27 .cse140) (forall ((v_y_15 Int)) (let ((.cse141 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse142 (div c_~last_1_var_1_19~0 .cse141))) (or (< .cse0 .cse141) (< .cse141 5) (< .cse142 .cse140) (= .cse142 .cse140))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse143 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse143) (forall ((v_y_15 Int)) (let ((.cse144 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse145 (div c_~last_1_var_1_19~0 .cse144))) (or (< .cse0 .cse144) (< .cse144 5) (< .cse145 .cse143) (= .cse145 .cse143))))) (= .cse4 .cse143) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse148 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse146 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse147 (+ 65536 (div c_~last_1_var_1_19~0 .cse146)))) (or (< .cse0 .cse146) (< .cse146 5) (< .cse147 .cse148) (= .cse147 .cse148))))) (< .cse4 .cse148) (< .cse148 65536) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse151 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse149 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse150 (+ 65536 (div c_~last_1_var_1_19~0 .cse149)))) (or (< .cse0 .cse149) (< .cse149 5) (< .cse150 .cse151) (= .cse150 .cse151))))) (< .cse4 .cse151) (< .cse151 65536) (= .cse4 .cse151) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse152 (+ v_z_15 .cse5))) (or (< .cse4 .cse152) (< .cse152 65536) (forall ((v_y_15 Int)) (let ((.cse153 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse154 (div c_~last_1_var_1_19~0 .cse153))) (or (< .cse0 .cse153) (< .cse153 5) (< .cse154 .cse152) (= .cse154 .cse152))))) (< 65535 v_z_15)))))) (.cse14 (+ .cse4 65535)) (.cse33 (< c_~var_1_20~0 0)) (.cse62 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse126 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse127 (+ .cse5 v_z_6))) (or (< .cse126 5) (< .cse0 .cse126) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 .cse127) (< .cse126 c_~var_1_20~0) (= .cse127 .cse4)))))) (and (forall ((v_z_15 Int)) (let ((.cse3 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse1 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse2 (+ 65536 (div c_~last_1_var_1_19~0 .cse1)))) (or (< .cse0 .cse1) (< .cse1 5) (< .cse2 .cse3) (= .cse2 .cse3))))) (< .cse4 .cse3) (< .cse3 65536) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (or .cse6 (and (forall ((v_z_9 Int)) (or (< .cse4 (+ .cse5 v_z_9 1)) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse7 (* 65536 v_y_9)) (.cse8 (* v_z_9 65535))) (let ((.cse9 (+ .cse7 .cse8))) (or (< c_~var_1_20~0 (+ .cse7 .cse8 1)) (< .cse0 .cse9) (< .cse9 5))))) (< 65535 v_z_9))) (forall ((v_z_9 Int)) (let ((.cse13 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse10 (* 65536 v_y_9)) (.cse11 (* v_z_9 65535))) (let ((.cse12 (+ .cse10 .cse11))) (or (< c_~var_1_20~0 (+ .cse10 .cse11 1)) (< .cse0 .cse12) (< (div c_~last_1_var_1_19~0 .cse12) .cse13) (< .cse12 5))))) (< .cse14 .cse13) (< 65535 v_z_9) (< .cse13 65536)))) (forall ((v_z_9 Int)) (let ((.cse18 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse15 (* 65536 v_y_9)) (.cse16 (* v_z_9 65535))) (let ((.cse19 (+ .cse15 .cse16))) (let ((.cse17 (div c_~last_1_var_1_19~0 .cse19))) (or (< c_~var_1_20~0 (+ .cse15 .cse16 1)) (= .cse17 .cse18) (< .cse0 .cse19) (< .cse17 .cse18) (< .cse19 5)))))) (< .cse14 .cse18) (< 65535 v_z_9) (< .cse18 65536)))) (forall ((v_z_9 Int)) (let ((.cse23 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse20 (* 65536 v_y_9)) (.cse21 (* v_z_9 65535))) (let ((.cse22 (+ .cse20 .cse21))) (or (< c_~var_1_20~0 (+ .cse20 .cse21 1)) (< .cse0 .cse22) (< .cse22 5))))) (< .cse14 .cse23) (< 65535 v_z_9) (< .cse23 65536)))))) (forall ((v_z_15 Int)) (let ((.cse26 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse24 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse25 (+ 65536 (div c_~last_1_var_1_19~0 .cse24)))) (or (< .cse0 .cse24) (< .cse24 5) (< .cse25 .cse26) (= .cse25 .cse26))))) (= .cse14 .cse26) (= .cse27 .cse26) (< .cse26 65536) (< .cse27 .cse26) (< 65535 v_z_15)))) (forall ((v_z_9 Int)) (let ((.cse31 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse28 (* 65536 v_y_9)) (.cse29 (* v_z_9 65535))) (let ((.cse32 (+ .cse28 .cse29))) (let ((.cse30 (div c_~last_1_var_1_19~0 .cse32))) (or (< c_~var_1_20~0 (+ .cse28 .cse29 1)) (= .cse30 .cse31) (< .cse0 .cse32) (< .cse30 .cse31) (< .cse32 5)))))) (= .cse14 .cse31) (< .cse14 .cse31) (< 65535 v_z_9) (< .cse31 65536)))) (or (and (or .cse33 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse34 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse34 5) (< .cse0 .cse34) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 (+ .cse5 v_z_6)))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse35 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse36 (+ .cse5 v_z_6))) (or (< .cse35 5) (< .cse0 .cse35) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 .cse36) (= .cse36 .cse4) (= (+ .cse5 v_z_6 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse37 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse38 (+ .cse5 v_z_6))) (or (< .cse37 5) (< .cse0 .cse37) (< 65535 v_z_6) (< .cse4 .cse38) (< .cse38 65536) (= (+ .cse5 v_z_6 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse39 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse40 (+ .cse5 v_z_6))) (or (< .cse39 5) (< .cse0 .cse39) (< 65535 v_z_6) (< .cse4 .cse40) (< .cse40 65536))))) .cse41 .cse42) (or (and (or .cse33 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse43 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse44 (+ .cse5 v_z_6))) (or (< .cse43 5) (< .cse27 .cse44) (< .cse0 .cse43) (< 65535 v_z_6) (< .cse44 65536))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse46 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse45 (+ .cse5 v_z_6))) (or (= .cse45 .cse27) (< .cse46 5) (< .cse27 .cse45) (< .cse0 .cse46) (< 65535 v_z_6) (< .cse45 65536) (= .cse14 .cse45))))) .cse41 .cse42) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse48 (+ .cse5 v_z_6)) (.cse47 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse47 5) (< .cse0 .cse47) (< 65535 v_z_6) (< .cse4 .cse48) (< .cse48 65536) (< .cse47 c_~var_1_20~0)))) (forall ((v_z_9 Int)) (let ((.cse49 (+ .cse5 v_z_9 1))) (or (< .cse4 .cse49) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse50 (* 65536 v_y_9)) (.cse51 (* v_z_9 65535))) (let ((.cse52 (+ .cse50 .cse51))) (or (< c_~var_1_20~0 (+ .cse50 .cse51 1)) (< .cse0 .cse52) (< .cse52 5))))) (= .cse4 .cse49) (< 65535 v_z_9)))) (forall ((v_z_15 Int)) (let ((.cse53 (+ v_z_15 .cse5))) (or (= .cse14 .cse53) (= .cse27 .cse53) (forall ((v_y_15 Int)) (let ((.cse54 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse54) (< .cse54 5) (< (div c_~last_1_var_1_19~0 .cse54) .cse53)))) (< .cse53 65536) (< .cse27 .cse53) (< 65535 v_z_15)))) (forall ((v_z_9 Int)) (let ((.cse58 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse55 (* 65536 v_y_9)) (.cse56 (* v_z_9 65535))) (let ((.cse57 (+ .cse55 .cse56))) (or (< c_~var_1_20~0 (+ .cse55 .cse56 1)) (< .cse0 .cse57) (< .cse57 5))))) (= .cse14 .cse58) (< .cse14 .cse58) (< 65535 v_z_9) (< .cse58 65536)))) (forall ((v_z_15 Int)) (let ((.cse59 (+ v_z_15 .cse5))) (or (< .cse4 .cse59) (forall ((v_y_15 Int)) (let ((.cse60 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse60) (< .cse60 5) (< (div c_~last_1_var_1_19~0 .cse60) .cse59)))) (< .cse59 65536) (= .cse4 .cse59) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (or .cse6 .cse61) (or .cse6 .cse62) (forall ((v_z_9 Int)) (let ((.cse63 (+ .cse5 v_z_9))) (or (= .cse14 .cse63) (forall ((v_y_9 Int)) (let ((.cse64 (* 65536 v_y_9)) (.cse65 (* v_z_9 65535))) (let ((.cse66 (+ .cse64 .cse65))) (or (< c_~var_1_20~0 (+ .cse64 .cse65 1)) (< .cse0 .cse66) (< (div c_~last_1_var_1_19~0 .cse66) .cse63) (< .cse66 5))))) (< .cse14 .cse63) (< 65535 v_z_9) (< .cse63 65536)))) (forall ((v_z_15 Int)) (let ((.cse67 (+ v_z_15 .cse5))) (or (< .cse4 .cse67) (forall ((v_y_15 Int)) (let ((.cse68 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse68) (< .cse68 5) (< (div c_~last_1_var_1_19~0 .cse68) .cse67)))) (< .cse67 65536) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse69 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse70 (+ .cse5 v_z_6))) (or (< .cse69 5) (< .cse0 .cse69) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 .cse70) (< .cse69 c_~var_1_20~0) (= .cse70 .cse4) (= (+ .cse5 v_z_6 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse71 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse71) (forall ((v_y_15 Int)) (let ((.cse72 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse73 (div c_~last_1_var_1_19~0 .cse72))) (or (< .cse0 .cse72) (< .cse72 5) (< .cse73 .cse71) (= .cse73 .cse71))))) (= .cse4 .cse71) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse75 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse74 (+ .cse5 v_z_6))) (or (= .cse74 .cse27) (< .cse75 5) (< .cse27 .cse74) (< .cse0 .cse75) (< 65535 v_z_6) (< .cse74 65536) (< .cse75 c_~var_1_20~0) (= .cse14 .cse74)))) (forall ((v_z_9 Int)) (let ((.cse76 (+ .cse5 v_z_9 1))) (or (< .cse4 .cse76) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse77 (* 65536 v_y_9)) (.cse78 (* v_z_9 65535))) (let ((.cse79 (+ .cse77 .cse78))) (or (< c_~var_1_20~0 (+ .cse77 .cse78 1)) (< .cse0 .cse79) (< .cse79 5))))) (= .cse4 .cse76) (< 65535 (+ .cse5 v_z_9))))) (or .cse33 .cse80) (or .cse6 .cse80) (or .cse33 .cse61) (forall ((v_z_9 Int)) (let ((.cse81 (+ .cse5 v_z_9 1))) (or (< .cse4 .cse81) (forall ((v_y_9 Int)) (let ((.cse82 (* 65536 v_y_9)) (.cse83 (* v_z_9 65535))) (let ((.cse84 (+ .cse82 .cse83))) (or (< c_~var_1_20~0 (+ .cse82 .cse83 1)) (< .cse0 .cse84) (< .cse84 5))))) (= .cse4 .cse81) (< 65535 v_z_9) (< (+ .cse5 v_z_9) 65536)))) (forall ((v_z_15 Int)) (let ((.cse85 (+ v_z_15 .cse5))) (or (= .cse14 .cse85) (= .cse27 .cse85) (< .cse85 65536) (< .cse27 .cse85) (forall ((v_y_15 Int)) (let ((.cse86 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse87 (div c_~last_1_var_1_19~0 .cse86))) (or (< .cse0 .cse86) (< .cse86 5) (< .cse87 .cse85) (= .cse87 .cse85))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse90 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse88 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse89 (+ 65536 (div c_~last_1_var_1_19~0 .cse88)))) (or (< .cse0 .cse88) (< .cse88 5) (< .cse89 .cse90) (= .cse89 .cse90))))) (< .cse4 .cse90) (< .cse90 65536) (= .cse4 .cse90) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse91 (+ v_z_15 .cse5))) (or (= .cse14 .cse91) (= .cse27 .cse91) (< .cse91 65536) (< .cse27 .cse91) (forall ((v_y_15 Int)) (let ((.cse92 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse93 (div c_~last_1_var_1_19~0 .cse92))) (or (< .cse0 .cse92) (< .cse92 5) (< .cse93 .cse91) (= .cse93 .cse91))))) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse94 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse94) (< 65535 .cse94) (forall ((v_y_15 Int)) (let ((.cse95 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse96 (div c_~last_1_var_1_19~0 .cse95))) (or (< .cse0 .cse95) (< .cse95 5) (< .cse96 .cse94) (= .cse96 .cse94))))) (= .cse4 .cse94) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse97 (+ v_z_15 .cse5))) (or (= .cse14 .cse97) (= .cse27 .cse97) (forall ((v_y_15 Int)) (let ((.cse98 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse98) (< .cse98 5) (< (div c_~last_1_var_1_19~0 .cse98) .cse97)))) (< .cse97 65536) (< .cse27 .cse97) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse99 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse100 (+ .cse5 v_z_6))) (or (< .cse99 5) (< .cse0 .cse99) (< 65535 v_z_6) (< .cse4 .cse100) (< .cse100 65536) (< .cse99 c_~var_1_20~0) (= .cse100 .cse4)))) (forall ((v_z_9 Int)) (or (< .cse4 (+ .cse5 v_z_9 1)) (forall ((v_y_9 Int)) (let ((.cse101 (* 65536 v_y_9)) (.cse102 (* v_z_9 65535))) (let ((.cse103 (+ .cse101 .cse102))) (or (< c_~var_1_20~0 (+ .cse101 .cse102 1)) (< .cse0 .cse103) (< .cse103 5))))) (< 65535 v_z_9) (< (+ .cse5 v_z_9) 65536))) (forall ((v_z_15 Int)) (let ((.cse104 (+ v_z_15 .cse5))) (or (< .cse4 .cse104) (< .cse104 65536) (forall ((v_y_15 Int)) (let ((.cse105 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse106 (div c_~last_1_var_1_19~0 .cse105))) (or (< .cse0 .cse105) (< .cse105 5) (< .cse106 .cse104) (= .cse106 .cse104))))) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse109 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse107 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse108 (+ 65536 (div c_~last_1_var_1_19~0 .cse107)))) (or (< .cse0 .cse107) (< .cse107 5) (< .cse108 .cse109) (= .cse108 .cse109))))) (= .cse14 .cse109) (= .cse27 .cse109) (< .cse109 65536) (< .cse27 .cse109) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (or .cse33 (and (forall ((v_z_12 Int)) (let ((.cse110 (+ v_z_12 .cse5))) (or (< 65535 v_z_12) (< .cse110 65536) (forall ((v_y_12 Int)) (let ((.cse113 (* 65536 v_y_12)) (.cse114 (* v_z_12 65535))) (let ((.cse111 (+ .cse113 .cse114))) (let ((.cse112 (+ 65536 (div c_~last_1_var_1_19~0 .cse111)))) (or (< .cse111 5) (= .cse110 .cse112) (< c_~var_1_20~0 (+ .cse113 .cse114 1)) (< .cse0 .cse111) (< .cse112 .cse110))))))))) (forall ((v_z_12 Int)) (or (< 65535 v_z_12) (< v_z_12 0) (forall ((v_y_12 Int)) (let ((.cse118 (* 65536 v_y_12)) (.cse119 (* v_z_12 65535))) (let ((.cse115 (+ .cse118 .cse119))) (let ((.cse117 (div c_~last_1_var_1_19~0 .cse115)) (.cse116 (+ v_z_12 .cse5))) (or (< .cse115 5) (= .cse116 .cse117) (< .cse117 .cse116) (< c_~var_1_20~0 (+ .cse118 .cse119 1)) (< .cse0 .cse115)))))))) (forall ((v_z_12 Int)) (let ((.cse120 (+ v_z_12 .cse5))) (or (< 65535 v_z_12) (< .cse120 65536) (forall ((v_y_12 Int)) (let ((.cse124 (* 65536 v_y_12)) (.cse125 (* v_z_12 65535))) (let ((.cse121 (+ .cse124 .cse125))) (let ((.cse122 (div c_~last_1_var_1_19~0 .cse121))) (let ((.cse123 (+ 65536 .cse122))) (or (< .cse121 5) (= .cse120 .cse122) (= .cse120 .cse123) (< c_~var_1_20~0 (+ .cse124 .cse125 1)) (< .cse0 .cse121) (< .cse123 .cse120)))))))))))) (or .cse33 .cse62))))) (< .cse0 (mod c_~var_1_40~0 256)))) is different from true [2024-10-13 01:35:07,820 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_~last_1_var_1_19~0 c_~var_1_20~0))) (let ((.cse27 (+ 65536 .cse4)) (.cse0 (mod c_~var_1_13~0 256)) (.cse5 (mod c_~var_1_22~0 65536)) (.cse42 (= (mod c_~last_1_var_1_19~0 c_~var_1_20~0) 0))) (let ((.cse41 (< 0 (+ c_~last_1_var_1_19~0 1))) (.cse6 (not .cse42)) (.cse80 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse155 (+ .cse5 v_z_6)) (.cse156 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (= .cse155 .cse27) (< .cse156 5) (< .cse27 .cse155) (< .cse0 .cse156) (< 65535 v_z_6) (< .cse155 65536) (< .cse156 c_~var_1_20~0))))) (.cse61 (and (forall ((v_z_15 Int)) (let ((.cse130 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse128 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse129 (+ 65536 (div c_~last_1_var_1_19~0 .cse128)))) (or (< .cse0 .cse128) (< .cse128 5) (< .cse129 .cse130) (= .cse129 .cse130))))) (= .cse27 .cse130) (< .cse130 65536) (< .cse27 .cse130) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse131 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse131) (< 65535 .cse131) (forall ((v_y_15 Int)) (let ((.cse132 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse133 (div c_~last_1_var_1_19~0 .cse132))) (or (< .cse0 .cse132) (< .cse132 5) (< .cse133 .cse131) (= .cse133 .cse131))))) (= .cse4 .cse131)))) (forall ((v_z_15 Int)) (let ((.cse134 (+ v_z_15 .cse5))) (or (= .cse27 .cse134) (forall ((v_y_15 Int)) (let ((.cse135 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse135) (< .cse135 5) (< (div c_~last_1_var_1_19~0 .cse135) .cse134)))) (< .cse134 65536) (< .cse27 .cse134) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse136 (+ v_z_15 .cse5))) (or (< .cse4 .cse136) (forall ((v_y_15 Int)) (let ((.cse137 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse137) (< .cse137 5) (< (div c_~last_1_var_1_19~0 .cse137) .cse136)))) (< .cse136 65536) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse138 (+ v_z_15 .cse5))) (or (< .cse4 .cse138) (forall ((v_y_15 Int)) (let ((.cse139 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse139) (< .cse139 5) (< (div c_~last_1_var_1_19~0 .cse139) .cse138)))) (< .cse138 65536) (= .cse4 .cse138) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse140 (+ v_z_15 .cse5))) (or (= .cse27 .cse140) (< .cse140 65536) (< .cse27 .cse140) (forall ((v_y_15 Int)) (let ((.cse141 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse142 (div c_~last_1_var_1_19~0 .cse141))) (or (< .cse0 .cse141) (< .cse141 5) (< .cse142 .cse140) (= .cse142 .cse140))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse143 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse143) (forall ((v_y_15 Int)) (let ((.cse144 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse145 (div c_~last_1_var_1_19~0 .cse144))) (or (< .cse0 .cse144) (< .cse144 5) (< .cse145 .cse143) (= .cse145 .cse143))))) (= .cse4 .cse143) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse148 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse146 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse147 (+ 65536 (div c_~last_1_var_1_19~0 .cse146)))) (or (< .cse0 .cse146) (< .cse146 5) (< .cse147 .cse148) (= .cse147 .cse148))))) (< .cse4 .cse148) (< .cse148 65536) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse151 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse149 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse150 (+ 65536 (div c_~last_1_var_1_19~0 .cse149)))) (or (< .cse0 .cse149) (< .cse149 5) (< .cse150 .cse151) (= .cse150 .cse151))))) (< .cse4 .cse151) (< .cse151 65536) (= .cse4 .cse151) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse152 (+ v_z_15 .cse5))) (or (< .cse4 .cse152) (< .cse152 65536) (forall ((v_y_15 Int)) (let ((.cse153 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse154 (div c_~last_1_var_1_19~0 .cse153))) (or (< .cse0 .cse153) (< .cse153 5) (< .cse154 .cse152) (= .cse154 .cse152))))) (< 65535 v_z_15)))))) (.cse14 (+ .cse4 65535)) (.cse33 (< c_~var_1_20~0 0)) (.cse62 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse126 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse127 (+ .cse5 v_z_6))) (or (< .cse126 5) (< .cse0 .cse126) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 .cse127) (< .cse126 c_~var_1_20~0) (= .cse127 .cse4)))))) (and (forall ((v_z_15 Int)) (let ((.cse3 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse1 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse2 (+ 65536 (div c_~last_1_var_1_19~0 .cse1)))) (or (< .cse0 .cse1) (< .cse1 5) (< .cse2 .cse3) (= .cse2 .cse3))))) (< .cse4 .cse3) (< .cse3 65536) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (or .cse6 (and (forall ((v_z_9 Int)) (or (< .cse4 (+ .cse5 v_z_9 1)) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse7 (* 65536 v_y_9)) (.cse8 (* v_z_9 65535))) (let ((.cse9 (+ .cse7 .cse8))) (or (< c_~var_1_20~0 (+ .cse7 .cse8 1)) (< .cse0 .cse9) (< .cse9 5))))) (< 65535 v_z_9))) (forall ((v_z_9 Int)) (let ((.cse13 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse10 (* 65536 v_y_9)) (.cse11 (* v_z_9 65535))) (let ((.cse12 (+ .cse10 .cse11))) (or (< c_~var_1_20~0 (+ .cse10 .cse11 1)) (< .cse0 .cse12) (< (div c_~last_1_var_1_19~0 .cse12) .cse13) (< .cse12 5))))) (< .cse14 .cse13) (< 65535 v_z_9) (< .cse13 65536)))) (forall ((v_z_9 Int)) (let ((.cse18 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse15 (* 65536 v_y_9)) (.cse16 (* v_z_9 65535))) (let ((.cse19 (+ .cse15 .cse16))) (let ((.cse17 (div c_~last_1_var_1_19~0 .cse19))) (or (< c_~var_1_20~0 (+ .cse15 .cse16 1)) (= .cse17 .cse18) (< .cse0 .cse19) (< .cse17 .cse18) (< .cse19 5)))))) (< .cse14 .cse18) (< 65535 v_z_9) (< .cse18 65536)))) (forall ((v_z_9 Int)) (let ((.cse23 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse20 (* 65536 v_y_9)) (.cse21 (* v_z_9 65535))) (let ((.cse22 (+ .cse20 .cse21))) (or (< c_~var_1_20~0 (+ .cse20 .cse21 1)) (< .cse0 .cse22) (< .cse22 5))))) (< .cse14 .cse23) (< 65535 v_z_9) (< .cse23 65536)))))) (forall ((v_z_15 Int)) (let ((.cse26 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse24 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse25 (+ 65536 (div c_~last_1_var_1_19~0 .cse24)))) (or (< .cse0 .cse24) (< .cse24 5) (< .cse25 .cse26) (= .cse25 .cse26))))) (= .cse14 .cse26) (= .cse27 .cse26) (< .cse26 65536) (< .cse27 .cse26) (< 65535 v_z_15)))) (forall ((v_z_9 Int)) (let ((.cse31 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse28 (* 65536 v_y_9)) (.cse29 (* v_z_9 65535))) (let ((.cse32 (+ .cse28 .cse29))) (let ((.cse30 (div c_~last_1_var_1_19~0 .cse32))) (or (< c_~var_1_20~0 (+ .cse28 .cse29 1)) (= .cse30 .cse31) (< .cse0 .cse32) (< .cse30 .cse31) (< .cse32 5)))))) (= .cse14 .cse31) (< .cse14 .cse31) (< 65535 v_z_9) (< .cse31 65536)))) (or (and (or .cse33 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse34 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse34 5) (< .cse0 .cse34) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 (+ .cse5 v_z_6)))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse35 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse36 (+ .cse5 v_z_6))) (or (< .cse35 5) (< .cse0 .cse35) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 .cse36) (= .cse36 .cse4) (= (+ .cse5 v_z_6 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse37 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse38 (+ .cse5 v_z_6))) (or (< .cse37 5) (< .cse0 .cse37) (< 65535 v_z_6) (< .cse4 .cse38) (< .cse38 65536) (= (+ .cse5 v_z_6 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse39 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse40 (+ .cse5 v_z_6))) (or (< .cse39 5) (< .cse0 .cse39) (< 65535 v_z_6) (< .cse4 .cse40) (< .cse40 65536))))) .cse41 .cse42) (or (and (or .cse33 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse43 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse44 (+ .cse5 v_z_6))) (or (< .cse43 5) (< .cse27 .cse44) (< .cse0 .cse43) (< 65535 v_z_6) (< .cse44 65536))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse46 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse45 (+ .cse5 v_z_6))) (or (= .cse45 .cse27) (< .cse46 5) (< .cse27 .cse45) (< .cse0 .cse46) (< 65535 v_z_6) (< .cse45 65536) (= .cse14 .cse45))))) .cse41 .cse42) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse48 (+ .cse5 v_z_6)) (.cse47 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse47 5) (< .cse0 .cse47) (< 65535 v_z_6) (< .cse4 .cse48) (< .cse48 65536) (< .cse47 c_~var_1_20~0)))) (forall ((v_z_9 Int)) (let ((.cse49 (+ .cse5 v_z_9 1))) (or (< .cse4 .cse49) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse50 (* 65536 v_y_9)) (.cse51 (* v_z_9 65535))) (let ((.cse52 (+ .cse50 .cse51))) (or (< c_~var_1_20~0 (+ .cse50 .cse51 1)) (< .cse0 .cse52) (< .cse52 5))))) (= .cse4 .cse49) (< 65535 v_z_9)))) (forall ((v_z_15 Int)) (let ((.cse53 (+ v_z_15 .cse5))) (or (= .cse14 .cse53) (= .cse27 .cse53) (forall ((v_y_15 Int)) (let ((.cse54 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse54) (< .cse54 5) (< (div c_~last_1_var_1_19~0 .cse54) .cse53)))) (< .cse53 65536) (< .cse27 .cse53) (< 65535 v_z_15)))) (forall ((v_z_9 Int)) (let ((.cse58 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse55 (* 65536 v_y_9)) (.cse56 (* v_z_9 65535))) (let ((.cse57 (+ .cse55 .cse56))) (or (< c_~var_1_20~0 (+ .cse55 .cse56 1)) (< .cse0 .cse57) (< .cse57 5))))) (= .cse14 .cse58) (< .cse14 .cse58) (< 65535 v_z_9) (< .cse58 65536)))) (forall ((v_z_15 Int)) (let ((.cse59 (+ v_z_15 .cse5))) (or (< .cse4 .cse59) (forall ((v_y_15 Int)) (let ((.cse60 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse60) (< .cse60 5) (< (div c_~last_1_var_1_19~0 .cse60) .cse59)))) (< .cse59 65536) (= .cse4 .cse59) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (or .cse6 .cse61) (or .cse6 .cse62) (forall ((v_z_9 Int)) (let ((.cse63 (+ .cse5 v_z_9))) (or (= .cse14 .cse63) (forall ((v_y_9 Int)) (let ((.cse64 (* 65536 v_y_9)) (.cse65 (* v_z_9 65535))) (let ((.cse66 (+ .cse64 .cse65))) (or (< c_~var_1_20~0 (+ .cse64 .cse65 1)) (< .cse0 .cse66) (< (div c_~last_1_var_1_19~0 .cse66) .cse63) (< .cse66 5))))) (< .cse14 .cse63) (< 65535 v_z_9) (< .cse63 65536)))) (forall ((v_z_15 Int)) (let ((.cse67 (+ v_z_15 .cse5))) (or (< .cse4 .cse67) (forall ((v_y_15 Int)) (let ((.cse68 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse68) (< .cse68 5) (< (div c_~last_1_var_1_19~0 .cse68) .cse67)))) (< .cse67 65536) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse69 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse70 (+ .cse5 v_z_6))) (or (< .cse69 5) (< .cse0 .cse69) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 .cse70) (< .cse69 c_~var_1_20~0) (= .cse70 .cse4) (= (+ .cse5 v_z_6 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse71 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse71) (forall ((v_y_15 Int)) (let ((.cse72 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse73 (div c_~last_1_var_1_19~0 .cse72))) (or (< .cse0 .cse72) (< .cse72 5) (< .cse73 .cse71) (= .cse73 .cse71))))) (= .cse4 .cse71) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse75 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse74 (+ .cse5 v_z_6))) (or (= .cse74 .cse27) (< .cse75 5) (< .cse27 .cse74) (< .cse0 .cse75) (< 65535 v_z_6) (< .cse74 65536) (< .cse75 c_~var_1_20~0) (= .cse14 .cse74)))) (forall ((v_z_9 Int)) (let ((.cse76 (+ .cse5 v_z_9 1))) (or (< .cse4 .cse76) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse77 (* 65536 v_y_9)) (.cse78 (* v_z_9 65535))) (let ((.cse79 (+ .cse77 .cse78))) (or (< c_~var_1_20~0 (+ .cse77 .cse78 1)) (< .cse0 .cse79) (< .cse79 5))))) (= .cse4 .cse76) (< 65535 (+ .cse5 v_z_9))))) (or .cse33 .cse80) (or .cse6 .cse80) (or .cse33 .cse61) (forall ((v_z_9 Int)) (let ((.cse81 (+ .cse5 v_z_9 1))) (or (< .cse4 .cse81) (forall ((v_y_9 Int)) (let ((.cse82 (* 65536 v_y_9)) (.cse83 (* v_z_9 65535))) (let ((.cse84 (+ .cse82 .cse83))) (or (< c_~var_1_20~0 (+ .cse82 .cse83 1)) (< .cse0 .cse84) (< .cse84 5))))) (= .cse4 .cse81) (< 65535 v_z_9) (< (+ .cse5 v_z_9) 65536)))) (forall ((v_z_15 Int)) (let ((.cse85 (+ v_z_15 .cse5))) (or (= .cse14 .cse85) (= .cse27 .cse85) (< .cse85 65536) (< .cse27 .cse85) (forall ((v_y_15 Int)) (let ((.cse86 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse87 (div c_~last_1_var_1_19~0 .cse86))) (or (< .cse0 .cse86) (< .cse86 5) (< .cse87 .cse85) (= .cse87 .cse85))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse90 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse88 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse89 (+ 65536 (div c_~last_1_var_1_19~0 .cse88)))) (or (< .cse0 .cse88) (< .cse88 5) (< .cse89 .cse90) (= .cse89 .cse90))))) (< .cse4 .cse90) (< .cse90 65536) (= .cse4 .cse90) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse91 (+ v_z_15 .cse5))) (or (= .cse14 .cse91) (= .cse27 .cse91) (< .cse91 65536) (< .cse27 .cse91) (forall ((v_y_15 Int)) (let ((.cse92 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse93 (div c_~last_1_var_1_19~0 .cse92))) (or (< .cse0 .cse92) (< .cse92 5) (< .cse93 .cse91) (= .cse93 .cse91))))) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse94 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse94) (< 65535 .cse94) (forall ((v_y_15 Int)) (let ((.cse95 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse96 (div c_~last_1_var_1_19~0 .cse95))) (or (< .cse0 .cse95) (< .cse95 5) (< .cse96 .cse94) (= .cse96 .cse94))))) (= .cse4 .cse94) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse97 (+ v_z_15 .cse5))) (or (= .cse14 .cse97) (= .cse27 .cse97) (forall ((v_y_15 Int)) (let ((.cse98 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse98) (< .cse98 5) (< (div c_~last_1_var_1_19~0 .cse98) .cse97)))) (< .cse97 65536) (< .cse27 .cse97) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse99 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse100 (+ .cse5 v_z_6))) (or (< .cse99 5) (< .cse0 .cse99) (< 65535 v_z_6) (< .cse4 .cse100) (< .cse100 65536) (< .cse99 c_~var_1_20~0) (= .cse100 .cse4)))) (forall ((v_z_9 Int)) (or (< .cse4 (+ .cse5 v_z_9 1)) (forall ((v_y_9 Int)) (let ((.cse101 (* 65536 v_y_9)) (.cse102 (* v_z_9 65535))) (let ((.cse103 (+ .cse101 .cse102))) (or (< c_~var_1_20~0 (+ .cse101 .cse102 1)) (< .cse0 .cse103) (< .cse103 5))))) (< 65535 v_z_9) (< (+ .cse5 v_z_9) 65536))) (forall ((v_z_15 Int)) (let ((.cse104 (+ v_z_15 .cse5))) (or (< .cse4 .cse104) (< .cse104 65536) (forall ((v_y_15 Int)) (let ((.cse105 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse106 (div c_~last_1_var_1_19~0 .cse105))) (or (< .cse0 .cse105) (< .cse105 5) (< .cse106 .cse104) (= .cse106 .cse104))))) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse109 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse107 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse108 (+ 65536 (div c_~last_1_var_1_19~0 .cse107)))) (or (< .cse0 .cse107) (< .cse107 5) (< .cse108 .cse109) (= .cse108 .cse109))))) (= .cse14 .cse109) (= .cse27 .cse109) (< .cse109 65536) (< .cse27 .cse109) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (or .cse33 (and (forall ((v_z_12 Int)) (let ((.cse110 (+ v_z_12 .cse5))) (or (< 65535 v_z_12) (< .cse110 65536) (forall ((v_y_12 Int)) (let ((.cse113 (* 65536 v_y_12)) (.cse114 (* v_z_12 65535))) (let ((.cse111 (+ .cse113 .cse114))) (let ((.cse112 (+ 65536 (div c_~last_1_var_1_19~0 .cse111)))) (or (< .cse111 5) (= .cse110 .cse112) (< c_~var_1_20~0 (+ .cse113 .cse114 1)) (< .cse0 .cse111) (< .cse112 .cse110))))))))) (forall ((v_z_12 Int)) (or (< 65535 v_z_12) (< v_z_12 0) (forall ((v_y_12 Int)) (let ((.cse118 (* 65536 v_y_12)) (.cse119 (* v_z_12 65535))) (let ((.cse115 (+ .cse118 .cse119))) (let ((.cse117 (div c_~last_1_var_1_19~0 .cse115)) (.cse116 (+ v_z_12 .cse5))) (or (< .cse115 5) (= .cse116 .cse117) (< .cse117 .cse116) (< c_~var_1_20~0 (+ .cse118 .cse119 1)) (< .cse0 .cse115)))))))) (forall ((v_z_12 Int)) (let ((.cse120 (+ v_z_12 .cse5))) (or (< 65535 v_z_12) (< .cse120 65536) (forall ((v_y_12 Int)) (let ((.cse124 (* 65536 v_y_12)) (.cse125 (* v_z_12 65535))) (let ((.cse121 (+ .cse124 .cse125))) (let ((.cse122 (div c_~last_1_var_1_19~0 .cse121))) (let ((.cse123 (+ 65536 .cse122))) (or (< .cse121 5) (= .cse120 .cse122) (= .cse120 .cse123) (< c_~var_1_20~0 (+ .cse124 .cse125 1)) (< .cse0 .cse121) (< .cse123 .cse120)))))))))))) (or .cse33 .cse62))))) is different from false [2024-10-13 01:35:11,833 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (div c_~last_1_var_1_19~0 c_~var_1_20~0))) (let ((.cse27 (+ 65536 .cse4)) (.cse0 (mod c_~var_1_13~0 256)) (.cse5 (mod c_~var_1_22~0 65536)) (.cse42 (= (mod c_~last_1_var_1_19~0 c_~var_1_20~0) 0))) (let ((.cse41 (< 0 (+ c_~last_1_var_1_19~0 1))) (.cse6 (not .cse42)) (.cse80 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse155 (+ .cse5 v_z_6)) (.cse156 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (= .cse155 .cse27) (< .cse156 5) (< .cse27 .cse155) (< .cse0 .cse156) (< 65535 v_z_6) (< .cse155 65536) (< .cse156 c_~var_1_20~0))))) (.cse61 (and (forall ((v_z_15 Int)) (let ((.cse130 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse128 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse129 (+ 65536 (div c_~last_1_var_1_19~0 .cse128)))) (or (< .cse0 .cse128) (< .cse128 5) (< .cse129 .cse130) (= .cse129 .cse130))))) (= .cse27 .cse130) (< .cse130 65536) (< .cse27 .cse130) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse131 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse131) (< 65535 .cse131) (forall ((v_y_15 Int)) (let ((.cse132 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse133 (div c_~last_1_var_1_19~0 .cse132))) (or (< .cse0 .cse132) (< .cse132 5) (< .cse133 .cse131) (= .cse133 .cse131))))) (= .cse4 .cse131)))) (forall ((v_z_15 Int)) (let ((.cse134 (+ v_z_15 .cse5))) (or (= .cse27 .cse134) (forall ((v_y_15 Int)) (let ((.cse135 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse135) (< .cse135 5) (< (div c_~last_1_var_1_19~0 .cse135) .cse134)))) (< .cse134 65536) (< .cse27 .cse134) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse136 (+ v_z_15 .cse5))) (or (< .cse4 .cse136) (forall ((v_y_15 Int)) (let ((.cse137 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse137) (< .cse137 5) (< (div c_~last_1_var_1_19~0 .cse137) .cse136)))) (< .cse136 65536) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse138 (+ v_z_15 .cse5))) (or (< .cse4 .cse138) (forall ((v_y_15 Int)) (let ((.cse139 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse139) (< .cse139 5) (< (div c_~last_1_var_1_19~0 .cse139) .cse138)))) (< .cse138 65536) (= .cse4 .cse138) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse140 (+ v_z_15 .cse5))) (or (= .cse27 .cse140) (< .cse140 65536) (< .cse27 .cse140) (forall ((v_y_15 Int)) (let ((.cse141 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse142 (div c_~last_1_var_1_19~0 .cse141))) (or (< .cse0 .cse141) (< .cse141 5) (< .cse142 .cse140) (= .cse142 .cse140))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse143 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse143) (forall ((v_y_15 Int)) (let ((.cse144 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse145 (div c_~last_1_var_1_19~0 .cse144))) (or (< .cse0 .cse144) (< .cse144 5) (< .cse145 .cse143) (= .cse145 .cse143))))) (= .cse4 .cse143) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse148 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse146 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse147 (+ 65536 (div c_~last_1_var_1_19~0 .cse146)))) (or (< .cse0 .cse146) (< .cse146 5) (< .cse147 .cse148) (= .cse147 .cse148))))) (< .cse4 .cse148) (< .cse148 65536) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse151 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse149 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse150 (+ 65536 (div c_~last_1_var_1_19~0 .cse149)))) (or (< .cse0 .cse149) (< .cse149 5) (< .cse150 .cse151) (= .cse150 .cse151))))) (< .cse4 .cse151) (< .cse151 65536) (= .cse4 .cse151) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse152 (+ v_z_15 .cse5))) (or (< .cse4 .cse152) (< .cse152 65536) (forall ((v_y_15 Int)) (let ((.cse153 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse154 (div c_~last_1_var_1_19~0 .cse153))) (or (< .cse0 .cse153) (< .cse153 5) (< .cse154 .cse152) (= .cse154 .cse152))))) (< 65535 v_z_15)))))) (.cse14 (+ .cse4 65535)) (.cse33 (< c_~var_1_20~0 0)) (.cse62 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse126 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse127 (+ .cse5 v_z_6))) (or (< .cse126 5) (< .cse0 .cse126) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 .cse127) (< .cse126 c_~var_1_20~0) (= .cse127 .cse4)))))) (and (forall ((v_z_15 Int)) (let ((.cse3 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse1 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse2 (+ 65536 (div c_~last_1_var_1_19~0 .cse1)))) (or (< .cse0 .cse1) (< .cse1 5) (< .cse2 .cse3) (= .cse2 .cse3))))) (< .cse4 .cse3) (< .cse3 65536) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (or .cse6 (and (forall ((v_z_9 Int)) (or (< .cse4 (+ .cse5 v_z_9 1)) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse7 (* 65536 v_y_9)) (.cse8 (* v_z_9 65535))) (let ((.cse9 (+ .cse7 .cse8))) (or (< c_~var_1_20~0 (+ .cse7 .cse8 1)) (< .cse0 .cse9) (< .cse9 5))))) (< 65535 v_z_9))) (forall ((v_z_9 Int)) (let ((.cse13 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse10 (* 65536 v_y_9)) (.cse11 (* v_z_9 65535))) (let ((.cse12 (+ .cse10 .cse11))) (or (< c_~var_1_20~0 (+ .cse10 .cse11 1)) (< .cse0 .cse12) (< (div c_~last_1_var_1_19~0 .cse12) .cse13) (< .cse12 5))))) (< .cse14 .cse13) (< 65535 v_z_9) (< .cse13 65536)))) (forall ((v_z_9 Int)) (let ((.cse18 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse15 (* 65536 v_y_9)) (.cse16 (* v_z_9 65535))) (let ((.cse19 (+ .cse15 .cse16))) (let ((.cse17 (div c_~last_1_var_1_19~0 .cse19))) (or (< c_~var_1_20~0 (+ .cse15 .cse16 1)) (= .cse17 .cse18) (< .cse0 .cse19) (< .cse17 .cse18) (< .cse19 5)))))) (< .cse14 .cse18) (< 65535 v_z_9) (< .cse18 65536)))) (forall ((v_z_9 Int)) (let ((.cse23 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse20 (* 65536 v_y_9)) (.cse21 (* v_z_9 65535))) (let ((.cse22 (+ .cse20 .cse21))) (or (< c_~var_1_20~0 (+ .cse20 .cse21 1)) (< .cse0 .cse22) (< .cse22 5))))) (< .cse14 .cse23) (< 65535 v_z_9) (< .cse23 65536)))))) (forall ((v_z_15 Int)) (let ((.cse26 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse24 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse25 (+ 65536 (div c_~last_1_var_1_19~0 .cse24)))) (or (< .cse0 .cse24) (< .cse24 5) (< .cse25 .cse26) (= .cse25 .cse26))))) (= .cse14 .cse26) (= .cse27 .cse26) (< .cse26 65536) (< .cse27 .cse26) (< 65535 v_z_15)))) (forall ((v_z_9 Int)) (let ((.cse31 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse28 (* 65536 v_y_9)) (.cse29 (* v_z_9 65535))) (let ((.cse32 (+ .cse28 .cse29))) (let ((.cse30 (div c_~last_1_var_1_19~0 .cse32))) (or (< c_~var_1_20~0 (+ .cse28 .cse29 1)) (= .cse30 .cse31) (< .cse0 .cse32) (< .cse30 .cse31) (< .cse32 5)))))) (= .cse14 .cse31) (< .cse14 .cse31) (< 65535 v_z_9) (< .cse31 65536)))) (or (and (or .cse33 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse34 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse34 5) (< .cse0 .cse34) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 (+ .cse5 v_z_6)))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse35 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse36 (+ .cse5 v_z_6))) (or (< .cse35 5) (< .cse0 .cse35) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 .cse36) (= .cse36 .cse4) (= (+ .cse5 v_z_6 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse37 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse38 (+ .cse5 v_z_6))) (or (< .cse37 5) (< .cse0 .cse37) (< 65535 v_z_6) (< .cse4 .cse38) (< .cse38 65536) (= (+ .cse5 v_z_6 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse39 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse40 (+ .cse5 v_z_6))) (or (< .cse39 5) (< .cse0 .cse39) (< 65535 v_z_6) (< .cse4 .cse40) (< .cse40 65536))))) .cse41 .cse42) (or (and (or .cse33 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse43 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse44 (+ .cse5 v_z_6))) (or (< .cse43 5) (< .cse27 .cse44) (< .cse0 .cse43) (< 65535 v_z_6) (< .cse44 65536))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse46 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse45 (+ .cse5 v_z_6))) (or (= .cse45 .cse27) (< .cse46 5) (< .cse27 .cse45) (< .cse0 .cse46) (< 65535 v_z_6) (< .cse45 65536) (= .cse14 .cse45))))) .cse41 .cse42) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse48 (+ .cse5 v_z_6)) (.cse47 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse47 5) (< .cse0 .cse47) (< 65535 v_z_6) (< .cse4 .cse48) (< .cse48 65536) (< .cse47 c_~var_1_20~0)))) (forall ((v_z_9 Int)) (let ((.cse49 (+ .cse5 v_z_9 1))) (or (< .cse4 .cse49) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse50 (* 65536 v_y_9)) (.cse51 (* v_z_9 65535))) (let ((.cse52 (+ .cse50 .cse51))) (or (< c_~var_1_20~0 (+ .cse50 .cse51 1)) (< .cse0 .cse52) (< .cse52 5))))) (= .cse4 .cse49) (< 65535 v_z_9)))) (forall ((v_z_15 Int)) (let ((.cse53 (+ v_z_15 .cse5))) (or (= .cse14 .cse53) (= .cse27 .cse53) (forall ((v_y_15 Int)) (let ((.cse54 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse54) (< .cse54 5) (< (div c_~last_1_var_1_19~0 .cse54) .cse53)))) (< .cse53 65536) (< .cse27 .cse53) (< 65535 v_z_15)))) (forall ((v_z_9 Int)) (let ((.cse58 (+ .cse5 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse55 (* 65536 v_y_9)) (.cse56 (* v_z_9 65535))) (let ((.cse57 (+ .cse55 .cse56))) (or (< c_~var_1_20~0 (+ .cse55 .cse56 1)) (< .cse0 .cse57) (< .cse57 5))))) (= .cse14 .cse58) (< .cse14 .cse58) (< 65535 v_z_9) (< .cse58 65536)))) (forall ((v_z_15 Int)) (let ((.cse59 (+ v_z_15 .cse5))) (or (< .cse4 .cse59) (forall ((v_y_15 Int)) (let ((.cse60 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse60) (< .cse60 5) (< (div c_~last_1_var_1_19~0 .cse60) .cse59)))) (< .cse59 65536) (= .cse4 .cse59) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (or .cse6 .cse61) (or .cse6 .cse62) (forall ((v_z_9 Int)) (let ((.cse63 (+ .cse5 v_z_9))) (or (= .cse14 .cse63) (forall ((v_y_9 Int)) (let ((.cse64 (* 65536 v_y_9)) (.cse65 (* v_z_9 65535))) (let ((.cse66 (+ .cse64 .cse65))) (or (< c_~var_1_20~0 (+ .cse64 .cse65 1)) (< .cse0 .cse66) (< (div c_~last_1_var_1_19~0 .cse66) .cse63) (< .cse66 5))))) (< .cse14 .cse63) (< 65535 v_z_9) (< .cse63 65536)))) (forall ((v_z_15 Int)) (let ((.cse67 (+ v_z_15 .cse5))) (or (< .cse4 .cse67) (forall ((v_y_15 Int)) (let ((.cse68 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse68) (< .cse68 5) (< (div c_~last_1_var_1_19~0 .cse68) .cse67)))) (< .cse67 65536) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse69 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse70 (+ .cse5 v_z_6))) (or (< .cse69 5) (< .cse0 .cse69) (< v_z_6 0) (< 65535 v_z_6) (< .cse4 .cse70) (< .cse69 c_~var_1_20~0) (= .cse70 .cse4) (= (+ .cse5 v_z_6 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse71 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse71) (forall ((v_y_15 Int)) (let ((.cse72 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse73 (div c_~last_1_var_1_19~0 .cse72))) (or (< .cse0 .cse72) (< .cse72 5) (< .cse73 .cse71) (= .cse73 .cse71))))) (= .cse4 .cse71) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse75 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse74 (+ .cse5 v_z_6))) (or (= .cse74 .cse27) (< .cse75 5) (< .cse27 .cse74) (< .cse0 .cse75) (< 65535 v_z_6) (< .cse74 65536) (< .cse75 c_~var_1_20~0) (= .cse14 .cse74)))) (forall ((v_z_9 Int)) (let ((.cse76 (+ .cse5 v_z_9 1))) (or (< .cse4 .cse76) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse77 (* 65536 v_y_9)) (.cse78 (* v_z_9 65535))) (let ((.cse79 (+ .cse77 .cse78))) (or (< c_~var_1_20~0 (+ .cse77 .cse78 1)) (< .cse0 .cse79) (< .cse79 5))))) (= .cse4 .cse76) (< 65535 (+ .cse5 v_z_9))))) (or .cse33 .cse80) (or .cse6 .cse80) (or .cse33 .cse61) (forall ((v_z_9 Int)) (let ((.cse81 (+ .cse5 v_z_9 1))) (or (< .cse4 .cse81) (forall ((v_y_9 Int)) (let ((.cse82 (* 65536 v_y_9)) (.cse83 (* v_z_9 65535))) (let ((.cse84 (+ .cse82 .cse83))) (or (< c_~var_1_20~0 (+ .cse82 .cse83 1)) (< .cse0 .cse84) (< .cse84 5))))) (= .cse4 .cse81) (< 65535 v_z_9) (< (+ .cse5 v_z_9) 65536)))) (forall ((v_z_15 Int)) (let ((.cse85 (+ v_z_15 .cse5))) (or (= .cse14 .cse85) (= .cse27 .cse85) (< .cse85 65536) (< .cse27 .cse85) (forall ((v_y_15 Int)) (let ((.cse86 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse87 (div c_~last_1_var_1_19~0 .cse86))) (or (< .cse0 .cse86) (< .cse86 5) (< .cse87 .cse85) (= .cse87 .cse85))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse90 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse88 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse89 (+ 65536 (div c_~last_1_var_1_19~0 .cse88)))) (or (< .cse0 .cse88) (< .cse88 5) (< .cse89 .cse90) (= .cse89 .cse90))))) (< .cse4 .cse90) (< .cse90 65536) (= .cse4 .cse90) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse91 (+ v_z_15 .cse5))) (or (= .cse14 .cse91) (= .cse27 .cse91) (< .cse91 65536) (< .cse27 .cse91) (forall ((v_y_15 Int)) (let ((.cse92 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse93 (div c_~last_1_var_1_19~0 .cse92))) (or (< .cse0 .cse92) (< .cse92 5) (< .cse93 .cse91) (= .cse93 .cse91))))) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse94 (+ v_z_15 .cse5))) (or (< v_z_15 0) (< .cse4 .cse94) (< 65535 .cse94) (forall ((v_y_15 Int)) (let ((.cse95 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse96 (div c_~last_1_var_1_19~0 .cse95))) (or (< .cse0 .cse95) (< .cse95 5) (< .cse96 .cse94) (= .cse96 .cse94))))) (= .cse4 .cse94) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse97 (+ v_z_15 .cse5))) (or (= .cse14 .cse97) (= .cse27 .cse97) (forall ((v_y_15 Int)) (let ((.cse98 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse0 .cse98) (< .cse98 5) (< (div c_~last_1_var_1_19~0 .cse98) .cse97)))) (< .cse97 65536) (< .cse27 .cse97) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse99 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse100 (+ .cse5 v_z_6))) (or (< .cse99 5) (< .cse0 .cse99) (< 65535 v_z_6) (< .cse4 .cse100) (< .cse100 65536) (< .cse99 c_~var_1_20~0) (= .cse100 .cse4)))) (forall ((v_z_9 Int)) (or (< .cse4 (+ .cse5 v_z_9 1)) (forall ((v_y_9 Int)) (let ((.cse101 (* 65536 v_y_9)) (.cse102 (* v_z_9 65535))) (let ((.cse103 (+ .cse101 .cse102))) (or (< c_~var_1_20~0 (+ .cse101 .cse102 1)) (< .cse0 .cse103) (< .cse103 5))))) (< 65535 v_z_9) (< (+ .cse5 v_z_9) 65536))) (forall ((v_z_15 Int)) (let ((.cse104 (+ v_z_15 .cse5))) (or (< .cse4 .cse104) (< .cse104 65536) (forall ((v_y_15 Int)) (let ((.cse105 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse106 (div c_~last_1_var_1_19~0 .cse105))) (or (< .cse0 .cse105) (< .cse105 5) (< .cse106 .cse104) (= .cse106 .cse104))))) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (forall ((v_z_15 Int)) (let ((.cse109 (+ v_z_15 .cse5))) (or (forall ((v_y_15 Int)) (let ((.cse107 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse108 (+ 65536 (div c_~last_1_var_1_19~0 .cse107)))) (or (< .cse0 .cse107) (< .cse107 5) (< .cse108 .cse109) (= .cse108 .cse109))))) (= .cse14 .cse109) (= .cse27 .cse109) (< .cse109 65536) (< .cse27 .cse109) (< 65535 v_z_15) (= (+ v_z_15 .cse5 1) .cse4)))) (or .cse33 (and (forall ((v_z_12 Int)) (let ((.cse110 (+ v_z_12 .cse5))) (or (< 65535 v_z_12) (< .cse110 65536) (forall ((v_y_12 Int)) (let ((.cse113 (* 65536 v_y_12)) (.cse114 (* v_z_12 65535))) (let ((.cse111 (+ .cse113 .cse114))) (let ((.cse112 (+ 65536 (div c_~last_1_var_1_19~0 .cse111)))) (or (< .cse111 5) (= .cse110 .cse112) (< c_~var_1_20~0 (+ .cse113 .cse114 1)) (< .cse0 .cse111) (< .cse112 .cse110))))))))) (forall ((v_z_12 Int)) (or (< 65535 v_z_12) (< v_z_12 0) (forall ((v_y_12 Int)) (let ((.cse118 (* 65536 v_y_12)) (.cse119 (* v_z_12 65535))) (let ((.cse115 (+ .cse118 .cse119))) (let ((.cse117 (div c_~last_1_var_1_19~0 .cse115)) (.cse116 (+ v_z_12 .cse5))) (or (< .cse115 5) (= .cse116 .cse117) (< .cse117 .cse116) (< c_~var_1_20~0 (+ .cse118 .cse119 1)) (< .cse0 .cse115)))))))) (forall ((v_z_12 Int)) (let ((.cse120 (+ v_z_12 .cse5))) (or (< 65535 v_z_12) (< .cse120 65536) (forall ((v_y_12 Int)) (let ((.cse124 (* 65536 v_y_12)) (.cse125 (* v_z_12 65535))) (let ((.cse121 (+ .cse124 .cse125))) (let ((.cse122 (div c_~last_1_var_1_19~0 .cse121))) (let ((.cse123 (+ 65536 .cse122))) (or (< .cse121 5) (= .cse120 .cse122) (= .cse120 .cse123) (< c_~var_1_20~0 (+ .cse124 .cse125 1)) (< .cse0 .cse121) (< .cse123 .cse120)))))))))))) (or .cse33 .cse62))))) is different from true [2024-10-13 01:35:11,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:35:11,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544893178] [2024-10-13 01:35:11,851 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 01:35:11,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805361624] [2024-10-13 01:35:11,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805361624] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:35:11,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:35:11,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2024-10-13 01:35:11,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959266953] [2024-10-13 01:35:11,852 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 01:35:11,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-13 01:35:11,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:35:11,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-13 01:35:11,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=500, Unknown=4, NotChecked=150, Total=812 [2024-10-13 01:35:11,858 INFO L87 Difference]: Start difference. First operand 74 states and 117 transitions. Second operand has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 21 states have internal predecessors, (61), 6 states have call successors, (25), 6 states have call predecessors, (25), 9 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2024-10-13 01:35:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:35:13,163 INFO L93 Difference]: Finished difference Result 278 states and 416 transitions. [2024-10-13 01:35:13,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-13 01:35:13,164 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 21 states have internal predecessors, (61), 6 states have call successors, (25), 6 states have call predecessors, (25), 9 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) Word has length 159 [2024-10-13 01:35:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:35:13,168 INFO L225 Difference]: With dead ends: 278 [2024-10-13 01:35:13,168 INFO L226 Difference]: Without dead ends: 205 [2024-10-13 01:35:13,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=655, Invalid=2323, Unknown=4, NotChecked=324, Total=3306 [2024-10-13 01:35:13,172 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 288 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:35:13,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 717 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 01:35:13,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-13 01:35:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 153. [2024-10-13 01:35:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 94 states have internal predecessors, (121), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 01:35:13,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2024-10-13 01:35:13,205 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 159 [2024-10-13 01:35:13,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:35:13,206 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2024-10-13 01:35:13,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 21 states have internal predecessors, (61), 6 states have call successors, (25), 6 states have call predecessors, (25), 9 states have return successors, (25), 7 states have call predecessors, (25), 6 states have call successors, (25) [2024-10-13 01:35:13,206 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2024-10-13 01:35:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 01:35:13,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:35:13,210 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:35:13,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 01:35:13,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:35:13,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:35:13,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:35:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 612499740, now seen corresponding path program 1 times [2024-10-13 01:35:13,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:35:13,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608174961] [2024-10-13 01:35:13,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:35:13,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:35:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:35:13,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111304656] [2024-10-13 01:35:13,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:35:13,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:35:13,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:35:13,506 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) [2024-10-13 01:35:13,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:35:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:35:13,668 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:35:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:35:13,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:35:13,812 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:35:13,813 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:35:13,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 01:35:14,015 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,SelfDestructingSolverStorable2 [2024-10-13 01:35:14,021 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 01:35:14,134 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:35:14,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:35:14 BoogieIcfgContainer [2024-10-13 01:35:14,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:35:14,137 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:35:14,137 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:35:14,137 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:35:14,138 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:34:17" (3/4) ... [2024-10-13 01:35:14,139 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:35:14,140 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:35:14,140 INFO L158 Benchmark]: Toolchain (without parser) took 58152.95ms. Allocated memory was 167.8MB in the beginning and 289.4MB in the end (delta: 121.6MB). Free memory was 95.6MB in the beginning and 245.9MB in the end (delta: -150.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:35:14,140 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:35:14,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.42ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 77.9MB in the end (delta: 17.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 01:35:14,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.21ms. Allocated memory is still 167.8MB. Free memory was 77.9MB in the beginning and 72.9MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:35:14,141 INFO L158 Benchmark]: Boogie Preprocessor took 58.34ms. Allocated memory is still 167.8MB. Free memory was 72.9MB in the beginning and 65.3MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 01:35:14,141 INFO L158 Benchmark]: RCFGBuilder took 641.29ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 64.9MB in the beginning and 155.3MB in the end (delta: -90.3MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. [2024-10-13 01:35:14,142 INFO L158 Benchmark]: TraceAbstraction took 57099.06ms. Allocated memory was 218.1MB in the beginning and 289.4MB in the end (delta: 71.3MB). Free memory was 155.3MB in the beginning and 245.9MB in the end (delta: -90.6MB). Peak memory consumption was 149.6MB. Max. memory is 16.1GB. [2024-10-13 01:35:14,142 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 289.4MB. Free memory is still 245.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:35:14,143 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 167.8MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.42ms. Allocated memory is still 167.8MB. Free memory was 95.1MB in the beginning and 77.9MB in the end (delta: 17.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.21ms. Allocated memory is still 167.8MB. Free memory was 77.9MB in the beginning and 72.9MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.34ms. Allocated memory is still 167.8MB. Free memory was 72.9MB in the beginning and 65.3MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 641.29ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 64.9MB in the beginning and 155.3MB in the end (delta: -90.3MB). Peak memory consumption was 22.7MB. Max. memory is 16.1GB. * TraceAbstraction took 57099.06ms. Allocated memory was 218.1MB in the beginning and 289.4MB in the end (delta: 71.3MB). Free memory was 155.3MB in the beginning and 245.9MB in the end (delta: -90.6MB). Peak memory consumption was 149.6MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 289.4MB. Free memory is still 245.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someUnaryDOUBLEoperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 1.4; [L26] float var_1_7 = 9.25; [L27] float var_1_8 = 1.2; [L28] float var_1_9 = 0.0; [L29] float var_1_10 = 3.1; [L30] float var_1_11 = 500.5; [L31] signed long int var_1_12 = 0; [L32] unsigned char var_1_13 = 10; [L33] unsigned char var_1_14 = 8; [L34] unsigned char var_1_17 = 64; [L35] unsigned long int var_1_18 = 25; [L36] signed char var_1_19 = -100; [L37] signed short int var_1_20 = -4; [L38] unsigned short int var_1_21 = 200; [L39] unsigned short int var_1_22 = 54878; [L40] double var_1_23 = 9999.8; [L41] float var_1_24 = -0.25; [L42] signed char var_1_25 = 50; [L43] signed char var_1_26 = 100; [L44] unsigned char var_1_36 = 32; [L45] unsigned char var_1_39 = 64; [L46] unsigned char var_1_40 = 16; [L47] unsigned short int var_1_42 = 8; [L48] signed char var_1_43 = -16; [L49] unsigned char var_1_46 = 128; [L50] unsigned short int var_1_47 = 64; [L51] signed char var_1_49 = 0; [L52] signed char last_1_var_1_19 = -100; [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L184] last_1_var_1_19 = var_1_19 [L194] RET updateLastVariables() [L195] CALL updateVariables() [L143] var_1_2 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L144] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L145] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L146] var_1_3 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L147] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L148] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_7=37/4, var_1_8=6/5, var_1_9=0] [L149] var_1_7 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_8=6/5, var_1_9=0] [L151] var_1_8 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_9=0] [L152] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5, var_1_9=0] [L153] var_1_9 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_9 >= 4611686.018427382800e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L154] RET assume_abort_if_not((var_1_9 >= 4611686.018427382800e+12F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=31/10, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L155] var_1_10 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L156] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_11=1001/2, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L157] var_1_11 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L158] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=10, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L159] var_1_13 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L160] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L161] CALL assume_abort_if_not(var_1_13 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L161] RET assume_abort_if_not(var_1_13 <= 64) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=8, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L162] var_1_14 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L163] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L164] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L164] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=64, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L165] var_1_17 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L166] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L167] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L167] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L168] CALL assume_abort_if_not(var_1_17 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L168] RET assume_abort_if_not(var_1_17 != 127) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=-4, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L169] var_1_20 = __VERIFIER_nondet_short() [L170] CALL assume_abort_if_not(var_1_20 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L170] RET assume_abort_if_not(var_1_20 >= -32768) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L171] CALL assume_abort_if_not(var_1_20 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L171] RET assume_abort_if_not(var_1_20 <= 32767) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L172] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L172] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=54878, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L173] var_1_22 = __VERIFIER_nondet_ushort() [L174] CALL assume_abort_if_not(var_1_22 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L174] RET assume_abort_if_not(var_1_22 >= 32767) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L175] CALL assume_abort_if_not(var_1_22 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L175] RET assume_abort_if_not(var_1_22 <= 65534) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=64, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L176] var_1_39 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_39 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L177] RET assume_abort_if_not(var_1_39 >= 63) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L178] CALL assume_abort_if_not(var_1_39 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L178] RET assume_abort_if_not(var_1_39 <= 127) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=16, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L179] var_1_40 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L180] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L181] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L181] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L195] RET updateVariables() [L196] CALL step() [L56] COND TRUE \read(var_1_2) [L57] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L59] signed long int stepLocal_4 = 5; VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_4=5, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=200, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L60] COND TRUE stepLocal_4 <= var_1_17 [L61] var_1_21 = (var_1_22 - var_1_17) VAL [isInitial=1, last_1_var_1_19=-100, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L71] var_1_23 = var_1_10 [L72] var_1_24 = 31.75f [L73] var_1_25 = -5 [L74] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_0=0, var_1_10=2, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=7/5] [L75] COND TRUE (var_1_23 <= var_1_23) || stepLocal_0 [L76] var_1_4 = ((((31.5f) > (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (31.5f) : (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L80] signed long int stepLocal_3 = (200 - var_1_13) - var_1_14; [L81] unsigned char stepLocal_2 = var_1_13; [L82] unsigned char stepLocal_1 = var_1_13; VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=264, stepLocal_2=264, stepLocal_3=191, var_1_10=2, var_1_12=0, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L83] COND TRUE stepLocal_3 != var_1_25 [L84] var_1_12 = (var_1_13 + ((((var_1_14) < (var_1_21)) ? (var_1_14) : (var_1_21)))) VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=264, stepLocal_2=264, var_1_10=2, var_1_12=9, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L96] COND TRUE (- (var_1_13 / var_1_17)) > var_1_25 [L97] var_1_18 = var_1_13 VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=264, stepLocal_2=264, var_1_10=2, var_1_12=9, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=8, var_1_19=-100, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L99] COND FALSE !((last_1_var_1_19 / ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20)))) > var_1_21) [L102] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=264, stepLocal_2=264, var_1_10=2, var_1_12=9, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=8, var_1_19=5, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L104] COND FALSE !(var_1_9 < 256.5) VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=264, stepLocal_2=264, var_1_10=2, var_1_12=9, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=8, var_1_19=5, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L115] COND TRUE (var_1_11 - var_1_9) > var_1_23 [L116] var_1_36 = ((var_1_39 - var_1_40) + var_1_17) VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=264, stepLocal_2=264, var_1_10=2, var_1_12=9, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=8, var_1_19=5, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=64, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L120] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=264, stepLocal_2=264, var_1_10=2, var_1_12=9, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=8, var_1_19=5, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=64, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L123] COND FALSE !((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10))) / var_1_9) > ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10)))) VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=264, stepLocal_2=264, var_1_10=2, var_1_12=9, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=8, var_1_19=5, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=64, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L132] var_1_46 = var_1_40 VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=264, stepLocal_2=264, var_1_10=2, var_1_12=9, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=8, var_1_19=5, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=64, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=-249, var_1_47=64, var_1_49=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L133] COND FALSE !(var_1_13 < ((((var_1_40) > (var_1_17)) ? (var_1_40) : (var_1_17)))) [L138] var_1_47 = ((((((((var_1_21) > (var_1_39)) ? (var_1_21) : (var_1_39)))) > (var_1_13)) ? (((((var_1_21) > (var_1_39)) ? (var_1_21) : (var_1_39)))) : (var_1_13))) VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=264, stepLocal_2=264, var_1_10=2, var_1_12=9, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=8, var_1_19=5, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=64, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=-249, var_1_47=32763, var_1_49=0, var_1_4=63/2, var_1_7=0, var_1_8=0] [L140] var_1_49 = var_1_13 [L196] RET step() [L197] CALL, EXPR property() [L187-L188] return ((((((((var_1_2 ? (var_1_1 == ((unsigned char) var_1_3)) : 1) && (((var_1_23 <= var_1_23) || var_1_1) ? (var_1_4 == ((float) ((((31.5f) > (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))))) ? (31.5f) : (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8)))))))) : (var_1_4 == ((float) ((var_1_9 - var_1_10) - var_1_11))))) && ((((200 - var_1_13) - var_1_14) != var_1_25) ? (var_1_12 == ((signed long int) (var_1_13 + ((((var_1_14) < (var_1_21)) ? (var_1_14) : (var_1_21)))))) : (((var_1_25 / (128 - var_1_17)) < var_1_13) ? ((var_1_13 >= var_1_25) ? (var_1_12 == ((signed long int) var_1_14)) : (var_1_12 == ((signed long int) var_1_17))) : (var_1_12 == ((signed long int) var_1_17))))) && (((- (var_1_13 / var_1_17)) > var_1_25) ? (var_1_18 == ((unsigned long int) var_1_13)) : 1)) && (((last_1_var_1_19 / ((((var_1_17) < (var_1_20)) ? (var_1_17) : (var_1_20)))) > var_1_21) ? (var_1_19 == ((signed char) ((((var_1_17) > (var_1_13)) ? (var_1_17) : (var_1_13))))) : (var_1_19 == ((signed char) var_1_17)))) && ((5 <= var_1_17) ? (var_1_21 == ((unsigned short int) (var_1_22 - var_1_17))) : (var_1_1 ? (var_1_1 ? (var_1_21 == ((unsigned short int) var_1_17)) : (var_1_21 == ((unsigned short int) var_1_17))) : 1))) && (var_1_23 == ((double) var_1_10))) && (var_1_24 == ((float) 31.75f))) && (var_1_25 == ((signed char) -5)) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=9, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=8, var_1_19=5, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=64, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=-249, var_1_47=32763, var_1_49=8, var_1_4=63/2, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=9, var_1_13=264, var_1_14=-255, var_1_17=-251, var_1_18=8, var_1_19=5, var_1_1=0, var_1_20=7, var_1_21=32763, var_1_22=-32768, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=64, var_1_39=322, var_1_3=0, var_1_40=-249, var_1_42=8, var_1_43=-16, var_1_46=-249, var_1_47=32763, var_1_49=8, var_1_4=63/2, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.9s, OverallIterations: 3, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 831 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 652 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 715 IncrementalHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 179 mSDtfsCounter, 715 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=2, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 52 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 53.9s InterpolantComputationTime, 795 NumberOfCodeBlocks, 795 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 316 ConstructedInterpolants, 0 QuantifiedInterpolants, 2157 SizeOfPredicates, 7 NumberOfNonLiveVariables, 380 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 2356/2400 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 01:35:14,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 fe87987a4c3b43d3e816779d5565e54008de65667868ef23ae879587f6bedbbd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:35:16,177 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:35:16,242 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:35:16,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:35:16,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:35:16,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:35:16,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:35:16,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:35:16,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:35:16,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:35:16,277 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:35:16,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:35:16,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:35:16,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:35:16,280 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:35:16,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:35:16,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:35:16,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:35:16,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:35:16,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:35:16,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:35:16,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:35:16,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:35:16,282 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:35:16,282 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:35:16,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:35:16,282 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:35:16,283 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:35:16,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:35:16,283 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:35:16,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:35:16,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:35:16,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:35:16,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:35:16,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:35:16,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:35:16,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:35:16,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:35:16,284 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:35:16,284 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:35:16,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:35:16,286 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:35:16,286 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:35:16,286 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:35:16,286 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:35:16,286 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> fe87987a4c3b43d3e816779d5565e54008de65667868ef23ae879587f6bedbbd [2024-10-13 01:35:16,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:35:16,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:35:16,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:35:16,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:35:16,568 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:35:16,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-10-13 01:35:18,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:35:18,301 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:35:18,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-10-13 01:35:18,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a73164e9/5044bdde75b64c96aa9cecc6f10cb8eb/FLAGe7b60e8e7 [2024-10-13 01:35:18,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a73164e9/5044bdde75b64c96aa9cecc6f10cb8eb [2024-10-13 01:35:18,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:35:18,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:35:18,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:35:18,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:35:18,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:35:18,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:35:18" (1/1) ... [2024-10-13 01:35:18,661 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2228677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:18, skipping insertion in model container [2024-10-13 01:35:18,661 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:35:18" (1/1) ... [2024-10-13 01:35:18,689 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:35:18,837 WARN L248 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_fillercodestructure_filler-pe-ci_file-23.i[919,932] [2024-10-13 01:35:18,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:35:18,921 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:35:18,931 WARN L248 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_fillercodestructure_filler-pe-ci_file-23.i[919,932] [2024-10-13 01:35:18,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:35:19,001 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:35:19,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19 WrapperNode [2024-10-13 01:35:19,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:35:19,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:35:19,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:35:19,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:35:19,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,021 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,055 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-10-13 01:35:19,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:35:19,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:35:19,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:35:19,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:35:19,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,099 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]. [2024-10-13 01:35:19,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,122 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,123 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:35:19,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:35:19,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:35:19,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:35:19,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (1/1) ... [2024-10-13 01:35:19,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:35:19,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:35:19,158 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) [2024-10-13 01:35:19,160 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 [2024-10-13 01:35:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:35:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:35:19,197 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:35:19,197 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:35:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:35:19,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:35:19,268 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:35:19,269 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:35:21,672 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 01:35:21,672 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:35:21,743 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:35:21,743 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:35:21,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:35:21 BoogieIcfgContainer [2024-10-13 01:35:21,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:35:21,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:35:21,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:35:21,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:35:21,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:35:18" (1/3) ... [2024-10-13 01:35:21,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6389a664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:35:21, skipping insertion in model container [2024-10-13 01:35:21,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:35:19" (2/3) ... [2024-10-13 01:35:21,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6389a664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:35:21, skipping insertion in model container [2024-10-13 01:35:21,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:35:21" (3/3) ... [2024-10-13 01:35:21,753 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-10-13 01:35:21,766 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:35:21,766 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:35:21,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:35:21,833 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;@45f0b767, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:35:21,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:35:21,837 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 01:35:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 01:35:21,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:35:21,851 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:35:21,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:35:21,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:35:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash 734730128, now seen corresponding path program 1 times [2024-10-13 01:35:21,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:35:21,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227312492] [2024-10-13 01:35:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:35:21,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:35:21,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:35:21,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:35:21,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 01:35:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:35:22,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 01:35:22,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:35:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-10-13 01:35:22,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:35:22,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:35:22,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227312492] [2024-10-13 01:35:22,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227312492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:35:22,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:35:22,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:35:22,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701333584] [2024-10-13 01:35:22,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:35:22,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:35:22,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:35:22,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:35:22,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:35:22,497 INFO L87 Difference]: Start difference. First operand has 76 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 01:35:23,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:35:23,536 INFO L93 Difference]: Finished difference Result 149 states and 269 transitions. [2024-10-13 01:35:23,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:35:23,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 159 [2024-10-13 01:35:23,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:35:23,575 INFO L225 Difference]: With dead ends: 149 [2024-10-13 01:35:23,576 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 01:35:23,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:35:23,588 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:35:23,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 01:35:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 01:35:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-13 01:35:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 47 states have internal predecessors, (66), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-13 01:35:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 116 transitions. [2024-10-13 01:35:23,637 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 116 transitions. Word has length 159 [2024-10-13 01:35:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:35:23,638 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 116 transitions. [2024-10-13 01:35:23,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 01:35:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 116 transitions. [2024-10-13 01:35:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-13 01:35:23,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:35:23,642 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:35:23,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 01:35:23,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:35:23,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:35:23,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:35:23,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1005526750, now seen corresponding path program 1 times [2024-10-13 01:35:23,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:35:23,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623930960] [2024-10-13 01:35:23,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:35:23,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:35:23,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:35:23,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:35:23,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 01:35:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:35:24,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 01:35:24,383 INFO L278 TraceCheckSpWp]: Computing forward predicates...