./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:47:31,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:47:31,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:47:31,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:47:31,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:47:32,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:47:32,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:47:32,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:47:32,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:47:32,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:47:32,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:47:32,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:47:32,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:47:32,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:47:32,046 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:47:32,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:47:32,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:47:32,047 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:47:32,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:47:32,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:47:32,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:47:32,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:47:32,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:47:32,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:47:32,050 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:47:32,050 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:47:32,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:47:32,051 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:47:32,051 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:47:32,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:47:32,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:47:32,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:47:32,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:47:32,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:47:32,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:47:32,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:47:32,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:47:32,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:47:32,055 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:47:32,055 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:47:32,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:47:32,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:47:32,056 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-11-16 13:47:32,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:47:32,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:47:32,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:47:32,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:47:32,340 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:47:32,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-11-16 13:47:33,782 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:47:34,000 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:47:34,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-11-16 13:47:34,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a5961be/659e69ab99164ea6a8609feb29a04b4e/FLAG716395f3b [2024-11-16 13:47:34,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a5961be/659e69ab99164ea6a8609feb29a04b4e [2024-11-16 13:47:34,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:47:34,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:47:34,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:47:34,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:47:34,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:47:34,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca5dac3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34, skipping insertion in model container [2024-11-16 13:47:34,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:47:34,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i[919,932] [2024-11-16 13:47:34,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:47:34,338 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:47:34,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i[919,932] [2024-11-16 13:47:34,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:47:34,414 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:47:34,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34 WrapperNode [2024-11-16 13:47:34,418 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:47:34,419 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:47:34,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:47:34,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:47:34,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,508 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-16 13:47:34,509 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:47:34,510 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:47:34,510 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:47:34,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:47:34,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,523 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,547 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-11-16 13:47:34,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:47:34,589 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:47:34,589 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:47:34,589 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:47:34,590 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (1/1) ... [2024-11-16 13:47:34,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:47:34,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:47:34,617 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-11-16 13:47:34,620 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-11-16 13:47:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:47:34,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:47:34,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:47:34,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:47:34,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:47:34,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:47:34,739 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:47:34,741 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:47:35,196 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 13:47:35,196 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:47:35,212 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:47:35,213 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:47:35,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:47:35 BoogieIcfgContainer [2024-11-16 13:47:35,213 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:47:35,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:47:35,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:47:35,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:47:35,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:47:34" (1/3) ... [2024-11-16 13:47:35,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cd474c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:47:35, skipping insertion in model container [2024-11-16 13:47:35,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:47:34" (2/3) ... [2024-11-16 13:47:35,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12cd474c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:47:35, skipping insertion in model container [2024-11-16 13:47:35,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:47:35" (3/3) ... [2024-11-16 13:47:35,224 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-11-16 13:47:35,239 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:47:35,240 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:47:35,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:47:35,306 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;@2bb267ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:47:35,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:47:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 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-11-16 13:47:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 13:47:35,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:47:35,323 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:47:35,323 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:47:35,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:47:35,328 INFO L85 PathProgramCache]: Analyzing trace with hash -428037915, now seen corresponding path program 1 times [2024-11-16 13:47:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:47:35,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119998576] [2024-11-16 13:47:35,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:35,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:47:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:47:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:47:35,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:47:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:47:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:47:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:47:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:47:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:47:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:47:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 13:47:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:47:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 13:47:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:47:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 13:47:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:47:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:47:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:47:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:47:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:47:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:47:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:47:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:47:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:47:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:47:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:47:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 13:47:35,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:47:35,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119998576] [2024-11-16 13:47:35,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119998576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:47:35,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:47:35,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:47:35,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913449660] [2024-11-16 13:47:35,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:47:35,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:47:35,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:47:35,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:47:35,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:47:35,882 INFO L87 Difference]: Start difference. First operand has 86 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 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 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-11-16 13:47:35,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:47:35,915 INFO L93 Difference]: Finished difference Result 164 states and 284 transitions. [2024-11-16 13:47:35,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:47:35,917 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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 166 [2024-11-16 13:47:35,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:47:35,924 INFO L225 Difference]: With dead ends: 164 [2024-11-16 13:47:35,925 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 13:47:35,929 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-11-16 13:47:35,932 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:47:35,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:47:35,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 13:47:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-16 13:47:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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-11-16 13:47:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2024-11-16 13:47:35,992 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 166 [2024-11-16 13:47:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:47:35,993 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2024-11-16 13:47:35,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 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-11-16 13:47:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2024-11-16 13:47:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 13:47:35,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:47:35,999 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:47:36,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:47:36,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:47:36,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:47:36,001 INFO L85 PathProgramCache]: Analyzing trace with hash 248754142, now seen corresponding path program 1 times [2024-11-16 13:47:36,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:47:36,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409480321] [2024-11-16 13:47:36,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:47:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:36,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:47:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:36,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:47:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:36,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:47:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:47:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:47:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 13:47:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 13:47:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 13:47:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:36,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-16 13:47:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:36,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 13:47:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 13:47:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 13:47:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 13:47:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 13:47:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 13:47:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 13:47:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 13:47:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 13:47:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 13:47:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 13:47:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 13:47:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 13:47:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 13:47:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 13:47:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:47:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-16 13:47:37,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:47:37,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409480321] [2024-11-16 13:47:37,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409480321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:47:37,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:47:37,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:47:37,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237340653] [2024-11-16 13:47:37,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:47:37,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:47:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:47:37,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:47:37,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:47:37,090 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-16 13:47:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:47:37,294 INFO L93 Difference]: Finished difference Result 236 states and 356 transitions. [2024-11-16 13:47:37,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:47:37,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-11-16 13:47:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:47:37,301 INFO L225 Difference]: With dead ends: 236 [2024-11-16 13:47:37,304 INFO L226 Difference]: Without dead ends: 158 [2024-11-16 13:47:37,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:47:37,307 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 132 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:47:37,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 320 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:47:37,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-16 13:47:37,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2024-11-16 13:47:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 104 states have internal predecessors, (152), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 13:47:37,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 206 transitions. [2024-11-16 13:47:37,338 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 206 transitions. Word has length 166 [2024-11-16 13:47:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:47:37,339 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 206 transitions. [2024-11-16 13:47:37,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-16 13:47:37,339 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 206 transitions. [2024-11-16 13:47:37,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 13:47:37,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:47:37,346 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:47:37,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:47:37,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:47:37,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:47:37,347 INFO L85 PathProgramCache]: Analyzing trace with hash 52240637, now seen corresponding path program 1 times [2024-11-16 13:47:37,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:47:37,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389110244] [2024-11-16 13:47:37,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:37,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:47:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:47:37,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [462311426] [2024-11-16 13:47:37,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:47:37,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:47:37,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:47:37,496 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-11-16 13:47:37,498 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-11-16 13:47:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:47:37,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-16 13:47:37,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:47:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 869 proven. 59 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-16 13:47:39,536 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:47:59,663 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-11-16 13:48:10,827 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-11-16 13:48:25,368 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-11-16 13:48:29,384 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-11-16 13:48:29,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:48:29,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389110244] [2024-11-16 13:48:29,400 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 13:48:29,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462311426] [2024-11-16 13:48:29,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462311426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:48:29,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 13:48:29,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2024-11-16 13:48:29,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290815336] [2024-11-16 13:48:29,401 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 13:48:29,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-16 13:48:29,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:48:29,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-16 13:48:29,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=500, Unknown=4, NotChecked=150, Total=812 [2024-11-16 13:48:29,404 INFO L87 Difference]: Start difference. First operand 133 states and 206 transitions. Second operand has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 21 states have internal predecessors, (68), 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-11-16 13:48:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:30,746 INFO L93 Difference]: Finished difference Result 494 states and 745 transitions. [2024-11-16 13:48:30,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-16 13:48:30,748 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 21 states have internal predecessors, (68), 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 166 [2024-11-16 13:48:30,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:30,754 INFO L225 Difference]: With dead ends: 494 [2024-11-16 13:48:30,754 INFO L226 Difference]: Without dead ends: 364 [2024-11-16 13:48:30,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=655, Invalid=2323, Unknown=4, NotChecked=324, Total=3306 [2024-11-16 13:48:30,760 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 416 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:30,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 743 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 13:48:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-16 13:48:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 234. [2024-11-16 13:48:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 171 states have (on average 1.3859649122807018) internal successors, (237), 172 states have internal predecessors, (237), 52 states have call successors, (52), 10 states have call predecessors, (52), 10 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 13:48:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 341 transitions. [2024-11-16 13:48:30,817 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 341 transitions. Word has length 166 [2024-11-16 13:48:30,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:30,818 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 341 transitions. [2024-11-16 13:48:30,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.8333333333333335) internal successors, (68), 21 states have internal predecessors, (68), 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-11-16 13:48:30,819 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 341 transitions. [2024-11-16 13:48:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 13:48:30,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:30,824 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:30,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 13:48:31,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:48:31,025 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:31,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:31,026 INFO L85 PathProgramCache]: Analyzing trace with hash -241162370, now seen corresponding path program 1 times [2024-11-16 13:48:31,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:48:31,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505313705] [2024-11-16 13:48:31,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:48:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:48:31,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1385155182] [2024-11-16 13:48:31,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:31,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:48:31,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:48:31,136 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-11-16 13:48:31,137 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-11-16 13:48:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:48:31,310 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:48:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:48:31,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:48:31,499 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:48:31,501 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:48:31,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 13:48:31,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-16 13:48:31,717 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-16 13:48:31,856 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:48:31,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:48:31 BoogieIcfgContainer [2024-11-16 13:48:31,859 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:48:31,859 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:48:31,859 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:48:31,859 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:48:31,860 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:47:35" (3/4) ... [2024-11-16 13:48:31,864 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:48:31,865 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:48:31,866 INFO L158 Benchmark]: Toolchain (without parser) took 57824.03ms. Allocated memory was 182.5MB in the beginning and 306.2MB in the end (delta: 123.7MB). Free memory was 130.3MB in the beginning and 252.8MB in the end (delta: -122.5MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2024-11-16 13:48:31,866 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 182.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:48:31,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.15ms. Allocated memory is still 182.5MB. Free memory was 130.3MB in the beginning and 113.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 13:48:31,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.63ms. Allocated memory is still 182.5MB. Free memory was 113.0MB in the beginning and 107.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 13:48:31,867 INFO L158 Benchmark]: Boogie Preprocessor took 77.76ms. Allocated memory is still 182.5MB. Free memory was 107.3MB in the beginning and 100.4MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 13:48:31,868 INFO L158 Benchmark]: IcfgBuilder took 624.70ms. Allocated memory is still 182.5MB. Free memory was 100.4MB in the beginning and 71.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 13:48:31,868 INFO L158 Benchmark]: TraceAbstraction took 56643.09ms. Allocated memory was 182.5MB in the beginning and 306.2MB in the end (delta: 123.7MB). Free memory was 70.3MB in the beginning and 252.8MB in the end (delta: -182.6MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. [2024-11-16 13:48:31,868 INFO L158 Benchmark]: Witness Printer took 6.09ms. Allocated memory is still 306.2MB. Free memory is still 252.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:48:31,871 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.19ms. Allocated memory is still 182.5MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.15ms. Allocated memory is still 182.5MB. Free memory was 130.3MB in the beginning and 113.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.63ms. Allocated memory is still 182.5MB. Free memory was 113.0MB in the beginning and 107.3MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.76ms. Allocated memory is still 182.5MB. Free memory was 107.3MB in the beginning and 100.4MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 624.70ms. Allocated memory is still 182.5MB. Free memory was 100.4MB in the beginning and 71.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 56643.09ms. Allocated memory was 182.5MB in the beginning and 306.2MB in the end (delta: 123.7MB). Free memory was 70.3MB in the beginning and 252.8MB in the end (delta: -182.6MB). Peak memory consumption was 109.7MB. Max. memory is 16.1GB. * Witness Printer took 6.09ms. Allocated memory is still 306.2MB. Free memory is still 252.8MB. 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 someUnaryDOUBLEoperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someBinaryArithmeticFLOAToperation at line 78. 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; VAL [isInitial=0, 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] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L184] last_1_var_1_19 = var_1_19 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] [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=64, 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=64, 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=64, 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=64, 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=64, 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=64, 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=64, var_1_14=0, 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=64, var_1_14=0, 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=64, var_1_14=0, 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=64, var_1_14=0, var_1_17=50, 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=64, var_1_14=0, var_1_17=50, 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=64, var_1_14=0, var_1_17=50, 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=64, var_1_14=0, var_1_17=50, 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=64, var_1_14=0, var_1_17=50, 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=64, var_1_14=0, var_1_17=50, 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=64, var_1_14=0, var_1_17=50, 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=64, var_1_14=0, var_1_17=50, 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=64, var_1_14=0, var_1_17=50, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, var_1_3=0, var_1_40=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, var_1_3=0, var_1_40=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, var_1_3=0, var_1_40=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, var_1_3=0, var_1_40=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=200, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, var_1_3=0, var_1_40=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, var_1_23=49999/5, var_1_25=50, var_1_26=100, var_1_2=1, var_1_36=32, var_1_39=63, var_1_3=0, var_1_40=63, 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=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, 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=63, var_1_3=0, var_1_40=63, 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 FALSE !((var_1_23 <= var_1_23) || stepLocal_0) [L78] var_1_4 = ((var_1_9 - var_1_10) - var_1_11) VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=0, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, 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=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=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=64, stepLocal_2=64, stepLocal_3=136, var_1_10=2, var_1_12=0, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, 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=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=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=64, stepLocal_2=64, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=25, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, 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=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=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=64, stepLocal_2=64, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=-100, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, 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=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=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=64, stepLocal_2=64, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=50, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, 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=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0] [L104] COND FALSE !(var_1_9 < 256.5) VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=64, stepLocal_2=64, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=50, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, 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=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=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=64, stepLocal_2=64, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=50, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=50, var_1_39=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0] [L120] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=64, stepLocal_2=64, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=50, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=50, var_1_39=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=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=64, stepLocal_2=64, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=50, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=50, var_1_39=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=128, var_1_47=64, var_1_49=0] [L132] var_1_46 = var_1_40 VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=64, stepLocal_2=64, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=50, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=50, var_1_39=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=63, var_1_47=64, var_1_49=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=64, stepLocal_2=64, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=50, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=50, var_1_39=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=63, var_1_47=32717, var_1_49=0] [L140] var_1_49 = var_1_13 VAL [isInitial=1, last_1_var_1_19=-100, stepLocal_1=64, stepLocal_2=64, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=50, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=50, var_1_39=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=63, var_1_47=32717, var_1_49=64] [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)) ; VAL [\result=0, isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=50, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=50, var_1_39=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=63, var_1_47=32717, var_1_49=64] [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=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=50, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=50, var_1_39=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=63, var_1_47=32717, var_1_49=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=-100, var_1_10=2, var_1_12=64, var_1_13=64, var_1_14=0, var_1_17=50, var_1_18=64, var_1_19=50, var_1_1=0, var_1_20=51, var_1_21=32717, var_1_22=163839, var_1_23=2, var_1_24=127/4, var_1_25=-5, var_1_26=100, var_1_2=1, var_1_36=50, var_1_39=63, var_1_3=0, var_1_40=63, var_1_42=8, var_1_43=-16, var_1_46=63, var_1_47=32717, var_1_49=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.4s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 548 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 548 mSDsluCounter, 1187 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 877 mSDsCounter, 135 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 708 IncrementalHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 135 mSolverCounterUnsat, 310 mSDtfsCounter, 708 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 13.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=3, InterpolantAutomatonStates: 38, 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, 3 MinimizatonAttempts, 155 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 52.9s InterpolantComputationTime, 996 NumberOfCodeBlocks, 996 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 2551 SizeOfPredicates, 7 NumberOfNonLiveVariables, 392 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3541/3600 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-11-16 13:48:32,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/11.0.12-open/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 ../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.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:48:34,185 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:48:34,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:48:34,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:48:34,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:48:34,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:48:34,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:48:34,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:48:34,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:48:34,323 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:48:34,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:48:34,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:48:34,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:48:34,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:48:34,327 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:48:34,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:48:34,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:48:34,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:48:34,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:48:34,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:48:34,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:48:34,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:48:34,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:48:34,334 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:48:34,334 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:48:34,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:48:34,334 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:48:34,335 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:48:34,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:48:34,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:48:34,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:48:34,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:48:34,336 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:48:34,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:48:34,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:48:34,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:48:34,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:48:34,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:48:34,337 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:48:34,337 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:48:34,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:48:34,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:48:34,339 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:48:34,339 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:48:34,339 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-11-16 13:48:34,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:48:34,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:48:34,695 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:48:34,697 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:48:34,698 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:48:34,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-11-16 13:48:36,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:48:36,552 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:48:36,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-11-16 13:48:36,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35a03d70/5245225458eb4055a012fd0b48c0e0c6/FLAG91b81b976 [2024-11-16 13:48:36,577 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35a03d70/5245225458eb4055a012fd0b48c0e0c6 [2024-11-16 13:48:36,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:48:36,582 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:48:36,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:48:36,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:48:36,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:48:36,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,593 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132e3df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:36, skipping insertion in model container [2024-11-16 13:48:36,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:48:36" (1/1) ... [2024-11-16 13:48:36,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:48:36,834 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i[919,932] [2024-11-16 13:48:36,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:48:36,956 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:48:36,969 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i[919,932] [2024-11-16 13:48:37,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:48:37,052 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:48:37,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37 WrapperNode [2024-11-16 13:48:37,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:48:37,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:48:37,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:48:37,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:48:37,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,126 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-16 13:48:37,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:48:37,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:48:37,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:48:37,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:48:37,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,172 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-11-16 13:48:37,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,192 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,198 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:48:37,211 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:48:37,211 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:48:37,211 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:48:37,212 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (1/1) ... [2024-11-16 13:48:37,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:48:37,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:48:37,244 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-11-16 13:48:37,250 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-11-16 13:48:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:48:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:48:37,297 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:48:37,298 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:48:37,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:48:37,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:48:37,405 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:48:37,408 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:48:40,818 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 13:48:40,819 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:48:40,836 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:48:40,837 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:48:40,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:48:40 BoogieIcfgContainer [2024-11-16 13:48:40,837 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:48:40,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:48:40,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:48:40,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:48:40,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:48:36" (1/3) ... [2024-11-16 13:48:40,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b479f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:48:40, skipping insertion in model container [2024-11-16 13:48:40,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:48:37" (2/3) ... [2024-11-16 13:48:40,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b479f97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:48:40, skipping insertion in model container [2024-11-16 13:48:40,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:48:40" (3/3) ... [2024-11-16 13:48:40,847 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-11-16 13:48:40,867 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:48:40,867 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:48:40,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:48:40,936 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;@54bb4272, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:48:40,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:48:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 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-11-16 13:48:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 13:48:40,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:40,959 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:40,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:40,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash -428037915, now seen corresponding path program 1 times [2024-11-16 13:48:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:48:40,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793906489] [2024-11-16 13:48:40,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:40,984 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-11-16 13:48:40,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:48:40,987 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-11-16 13:48:41,007 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-11-16 13:48:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:41,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:48:41,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-11-16 13:48:41,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:48:41,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:48:41,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793906489] [2024-11-16 13:48:41,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793906489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:48:41,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:48:41,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:48:41,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86305411] [2024-11-16 13:48:41,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:48:41,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:48:41,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:48:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:48:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:48:41,601 INFO L87 Difference]: Start difference. First operand has 86 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 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 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-11-16 13:48:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:48:41,639 INFO L93 Difference]: Finished difference Result 164 states and 284 transitions. [2024-11-16 13:48:41,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:48:41,641 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 166 [2024-11-16 13:48:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:48:41,647 INFO L225 Difference]: With dead ends: 164 [2024-11-16 13:48:41,647 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 13:48:41,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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-11-16 13:48:41,653 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:48:41,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:48:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 13:48:41,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-16 13:48:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 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-11-16 13:48:41,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-11-16 13:48:41,691 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 166 [2024-11-16 13:48:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:48:41,691 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-11-16 13:48:41,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-11-16 13:48:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-11-16 13:48:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 13:48:41,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:48:41,695 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:48:41,712 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-11-16 13:48:41,896 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-11-16 13:48:41,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:48:41,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:48:41,897 INFO L85 PathProgramCache]: Analyzing trace with hash 248754142, now seen corresponding path program 1 times [2024-11-16 13:48:41,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:48:41,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [200450863] [2024-11-16 13:48:41,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:48:41,900 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-11-16 13:48:41,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:48:41,902 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-11-16 13:48:41,902 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-11-16 13:48:42,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:48:42,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 13:48:42,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:48:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 514 proven. 51 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-11-16 13:48:44,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:48:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-16 13:48:51,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:48:51,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [200450863] [2024-11-16 13:48:51,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [200450863] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:48:51,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 13:48:51,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-16 13:48:51,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162828338] [2024-11-16 13:48:51,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 13:48:51,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 13:48:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:48:51,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 13:48:51,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-16 13:48:51,059 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 3 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2024-11-16 13:48:56,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 13:48:58,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0]