./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eb615b84715d4e5603f49b8da12039ac524d65195b0f458b0aca18ed675dad9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:28:03,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:28:03,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:28:03,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:28:03,739 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:28:03,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:28:03,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:28:03,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:28:03,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:28:03,760 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:28:03,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:28:03,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:28:03,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:28:03,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:28:03,761 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:28:03,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:28:03,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:28:03,761 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:28:03,761 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:28:03,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:28:03,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:28:03,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:28:03,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:28:03,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:28:03,762 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:28:03,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:28:03,762 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:28:03,762 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:28:03,762 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:28:03,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:28:03,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:28:03,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:28:03,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:03,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:28:03,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:28:03,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:28:03,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:28:03,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:03,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:28:03,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:28:03,763 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:28:03,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:28:03,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:28:03,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:28:03,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:28:03,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:28:03,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:28:03,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:28:03,763 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eb615b84715d4e5603f49b8da12039ac524d65195b0f458b0aca18ed675dad9 [2025-01-09 11:28:04,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:28:04,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:28:04,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:28:04,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:28:04,039 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:28:04,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-01-09 11:28:05,335 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cd2bd8a5/8e0f6e88281448d7a7269ab4a7e48df0/FLAG7ff52d2fb [2025-01-09 11:28:05,662 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:28:05,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-01-09 11:28:05,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cd2bd8a5/8e0f6e88281448d7a7269ab4a7e48df0/FLAG7ff52d2fb [2025-01-09 11:28:05,706 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2cd2bd8a5/8e0f6e88281448d7a7269ab4a7e48df0 [2025-01-09 11:28:05,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:28:05,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:28:05,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:28:05,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:28:05,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:28:05,719 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:28:05" (1/1) ... [2025-01-09 11:28:05,720 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16fd05f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:05, skipping insertion in model container [2025-01-09 11:28:05,720 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:28:05" (1/1) ... [2025-01-09 11:28:05,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:28:05,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i[919,932] [2025-01-09 11:28:05,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:28:05,968 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:28:05,977 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i[919,932] [2025-01-09 11:28:06,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:28:06,027 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:28:06,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06 WrapperNode [2025-01-09 11:28:06,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:28:06,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:28:06,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:28:06,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:28:06,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,087 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-01-09 11:28:06,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:28:06,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:28:06,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:28:06,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:28:06,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,126 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 11:28:06,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,142 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,156 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:28:06,159 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:28:06,159 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:28:06,159 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:28:06,160 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (1/1) ... [2025-01-09 11:28:06,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:06,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:28:06,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:28:06,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:28:06,218 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:28:06,219 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:28:06,220 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:28:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:28:06,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:28:06,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:28:06,309 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:28:06,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:28:06,683 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:28:06,684 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:28:06,695 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:28:06,695 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:28:06,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:28:06 BoogieIcfgContainer [2025-01-09 11:28:06,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:28:06,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:28:06,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:28:06,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:28:06,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:28:05" (1/3) ... [2025-01-09 11:28:06,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a68e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:28:06, skipping insertion in model container [2025-01-09 11:28:06,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:06" (2/3) ... [2025-01-09 11:28:06,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a68e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:28:06, skipping insertion in model container [2025-01-09 11:28:06,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:28:06" (3/3) ... [2025-01-09 11:28:06,707 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-01-09 11:28:06,720 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:28:06,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:28:06,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:28:06,790 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;@f5ac073, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:28:06,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:28:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 66 states have internal predecessors, (94), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 11:28:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 11:28:06,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:06,810 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:06,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:06,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1639450150, now seen corresponding path program 1 times [2025-01-09 11:28:06,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:06,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737132232] [2025-01-09 11:28:06,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:06,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:06,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 11:28:07,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 11:28:07,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:07,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:28:07,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:07,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737132232] [2025-01-09 11:28:07,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737132232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:07,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:07,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:28:07,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327206286] [2025-01-09 11:28:07,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:07,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:28:07,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:07,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:28:07,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:28:07,554 INFO L87 Difference]: Start difference. First operand has 101 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 66 states have internal predecessors, (94), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:07,689 INFO L93 Difference]: Finished difference Result 291 states and 536 transitions. [2025-01-09 11:28:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:28:07,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-01-09 11:28:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:07,701 INFO L225 Difference]: With dead ends: 291 [2025-01-09 11:28:07,701 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 11:28:07,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:28:07,708 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 82 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:07,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 452 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:28:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 11:28:07,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-01-09 11:28:07,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 122 states have (on average 1.3934426229508197) internal successors, (170), 122 states have internal predecessors, (170), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 11:28:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 302 transitions. [2025-01-09 11:28:07,795 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 302 transitions. Word has length 209 [2025-01-09 11:28:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:07,798 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 302 transitions. [2025-01-09 11:28:07,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 302 transitions. [2025-01-09 11:28:07,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 11:28:07,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:07,808 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:07,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 11:28:07,808 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:07,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:07,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1830325554, now seen corresponding path program 1 times [2025-01-09 11:28:07,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:07,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301379231] [2025-01-09 11:28:07,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:07,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:07,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 11:28:07,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 11:28:07,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:07,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:28:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:08,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301379231] [2025-01-09 11:28:08,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301379231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:08,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:08,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:28:08,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081286154] [2025-01-09 11:28:08,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:08,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:28:08,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:08,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:28:08,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:28:08,793 INFO L87 Difference]: Start difference. First operand 191 states and 302 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:09,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:09,235 INFO L93 Difference]: Finished difference Result 470 states and 743 transitions. [2025-01-09 11:28:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 11:28:09,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2025-01-09 11:28:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:09,242 INFO L225 Difference]: With dead ends: 470 [2025-01-09 11:28:09,243 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 11:28:09,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:28:09,247 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 312 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:09,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 687 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:28:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 11:28:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 205. [2025-01-09 11:28:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 136 states have internal predecessors, (195), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 11:28:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 327 transitions. [2025-01-09 11:28:09,299 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 327 transitions. Word has length 210 [2025-01-09 11:28:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:09,300 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 327 transitions. [2025-01-09 11:28:09,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 327 transitions. [2025-01-09 11:28:09,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 11:28:09,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:09,303 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:09,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:28:09,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:09,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:09,304 INFO L85 PathProgramCache]: Analyzing trace with hash 431007674, now seen corresponding path program 1 times [2025-01-09 11:28:09,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:09,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023900322] [2025-01-09 11:28:09,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:09,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:09,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 11:28:09,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 11:28:09,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:09,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:09,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:28:09,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:09,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023900322] [2025-01-09 11:28:09,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023900322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:09,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:09,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:28:09,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692812068] [2025-01-09 11:28:09,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:09,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:28:09,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:09,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:28:09,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:28:09,704 INFO L87 Difference]: Start difference. First operand 205 states and 327 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:10,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:10,057 INFO L93 Difference]: Finished difference Result 689 states and 1107 transitions. [2025-01-09 11:28:10,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 11:28:10,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-01-09 11:28:10,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:10,063 INFO L225 Difference]: With dead ends: 689 [2025-01-09 11:28:10,064 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 11:28:10,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:28:10,065 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 152 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:10,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 569 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:28:10,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 11:28:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 407. [2025-01-09 11:28:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 270 states have (on average 1.4370370370370371) internal successors, (388), 270 states have internal predecessors, (388), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2025-01-09 11:28:10,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 652 transitions. [2025-01-09 11:28:10,166 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 652 transitions. Word has length 211 [2025-01-09 11:28:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:10,166 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 652 transitions. [2025-01-09 11:28:10,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 652 transitions. [2025-01-09 11:28:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 11:28:10,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:10,171 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:10,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:28:10,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:10,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash 649862392, now seen corresponding path program 1 times [2025-01-09 11:28:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:10,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457328680] [2025-01-09 11:28:10,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:10,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:10,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 11:28:10,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 11:28:10,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:10,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:28:10,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:10,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457328680] [2025-01-09 11:28:10,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457328680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:10,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:10,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 11:28:10,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880881686] [2025-01-09 11:28:10,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:10,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 11:28:10,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:10,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 11:28:10,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 11:28:10,671 INFO L87 Difference]: Start difference. First operand 407 states and 652 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:28:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:11,372 INFO L93 Difference]: Finished difference Result 902 states and 1420 transitions. [2025-01-09 11:28:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 11:28:11,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 211 [2025-01-09 11:28:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:11,382 INFO L225 Difference]: With dead ends: 902 [2025-01-09 11:28:11,383 INFO L226 Difference]: Without dead ends: 711 [2025-01-09 11:28:11,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 11:28:11,384 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 645 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:11,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 727 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:28:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-01-09 11:28:11,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 671. [2025-01-09 11:28:11,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 450 states have (on average 1.4266666666666667) internal successors, (642), 454 states have internal predecessors, (642), 212 states have call successors, (212), 8 states have call predecessors, (212), 8 states have return successors, (212), 208 states have call predecessors, (212), 212 states have call successors, (212) [2025-01-09 11:28:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1066 transitions. [2025-01-09 11:28:11,501 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1066 transitions. Word has length 211 [2025-01-09 11:28:11,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:11,501 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 1066 transitions. [2025-01-09 11:28:11,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:28:11,501 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1066 transitions. [2025-01-09 11:28:11,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 11:28:11,505 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:11,505 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:11,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:28:11,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:11,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:11,506 INFO L85 PathProgramCache]: Analyzing trace with hash -938485510, now seen corresponding path program 1 times [2025-01-09 11:28:11,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:11,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561765446] [2025-01-09 11:28:11,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:11,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:11,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 11:28:11,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 11:28:11,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:11,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:28:11,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:11,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561765446] [2025-01-09 11:28:11,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561765446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:11,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:11,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:28:11,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935378927] [2025-01-09 11:28:11,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:11,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:28:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:11,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:28:11,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:28:11,778 INFO L87 Difference]: Start difference. First operand 671 states and 1066 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:12,229 INFO L93 Difference]: Finished difference Result 1432 states and 2268 transitions. [2025-01-09 11:28:12,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:28:12,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-01-09 11:28:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:12,237 INFO L225 Difference]: With dead ends: 1432 [2025-01-09 11:28:12,237 INFO L226 Difference]: Without dead ends: 764 [2025-01-09 11:28:12,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:28:12,240 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 204 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:12,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 667 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:28:12,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2025-01-09 11:28:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 695. [2025-01-09 11:28:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 460 states have (on average 1.4130434782608696) internal successors, (650), 464 states have internal predecessors, (650), 225 states have call successors, (225), 9 states have call predecessors, (225), 9 states have return successors, (225), 221 states have call predecessors, (225), 225 states have call successors, (225) [2025-01-09 11:28:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1100 transitions. [2025-01-09 11:28:12,363 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1100 transitions. Word has length 211 [2025-01-09 11:28:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:12,366 INFO L471 AbstractCegarLoop]: Abstraction has 695 states and 1100 transitions. [2025-01-09 11:28:12,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:12,366 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1100 transitions. [2025-01-09 11:28:12,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 11:28:12,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:12,369 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:12,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:28:12,369 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:12,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1814886066, now seen corresponding path program 1 times [2025-01-09 11:28:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241194643] [2025-01-09 11:28:12,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:12,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 11:28:12,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 11:28:12,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:12,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-01-09 11:28:12,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241194643] [2025-01-09 11:28:12,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241194643] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:28:12,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294917980] [2025-01-09 11:28:12,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:12,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:28:12,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:28:12,703 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:28:12,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 11:28:12,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 11:28:12,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 11:28:12,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:12,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:12,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 11:28:12,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:28:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-01-09 11:28:13,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 11:28:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-01-09 11:28:13,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294917980] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 11:28:13,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 11:28:13,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-01-09 11:28:13,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405940737] [2025-01-09 11:28:13,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 11:28:13,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 11:28:13,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:13,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 11:28:13,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2025-01-09 11:28:13,944 INFO L87 Difference]: Start difference. First operand 695 states and 1100 transitions. Second operand has 16 states, 16 states have (on average 6.875) internal successors, (110), 16 states have internal predecessors, (110), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) [2025-01-09 11:28:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:15,370 INFO L93 Difference]: Finished difference Result 2326 states and 3613 transitions. [2025-01-09 11:28:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 11:28:15,371 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 16 states have internal predecessors, (110), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) Word has length 212 [2025-01-09 11:28:15,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:15,387 INFO L225 Difference]: With dead ends: 2326 [2025-01-09 11:28:15,387 INFO L226 Difference]: Without dead ends: 1634 [2025-01-09 11:28:15,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=392, Invalid=1090, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 11:28:15,392 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 694 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 1288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:15,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 818 Invalid, 1288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 11:28:15,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-01-09 11:28:15,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1295. [2025-01-09 11:28:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 888 states have (on average 1.4166666666666667) internal successors, (1258), 898 states have internal predecessors, (1258), 384 states have call successors, (384), 22 states have call predecessors, (384), 22 states have return successors, (384), 374 states have call predecessors, (384), 384 states have call successors, (384) [2025-01-09 11:28:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 2026 transitions. [2025-01-09 11:28:15,576 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 2026 transitions. Word has length 212 [2025-01-09 11:28:15,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:15,577 INFO L471 AbstractCegarLoop]: Abstraction has 1295 states and 2026 transitions. [2025-01-09 11:28:15,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.875) internal successors, (110), 16 states have internal predecessors, (110), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) [2025-01-09 11:28:15,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 2026 transitions. [2025-01-09 11:28:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 11:28:15,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:15,584 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:15,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 11:28:15,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:28:15,788 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:15,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:15,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1411079368, now seen corresponding path program 1 times [2025-01-09 11:28:15,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:15,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953717412] [2025-01-09 11:28:15,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:15,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:15,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 11:28:15,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 11:28:15,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:15,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:28:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:16,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953717412] [2025-01-09 11:28:16,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953717412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:16,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:16,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:28:16,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530212039] [2025-01-09 11:28:16,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:16,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:28:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:16,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:28:16,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:28:16,335 INFO L87 Difference]: Start difference. First operand 1295 states and 2026 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:17,026 INFO L93 Difference]: Finished difference Result 1886 states and 2916 transitions. [2025-01-09 11:28:17,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 11:28:17,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-01-09 11:28:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:17,038 INFO L225 Difference]: With dead ends: 1886 [2025-01-09 11:28:17,039 INFO L226 Difference]: Without dead ends: 1541 [2025-01-09 11:28:17,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-01-09 11:28:17,042 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 470 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:17,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 779 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 11:28:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2025-01-09 11:28:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1049. [2025-01-09 11:28:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 721 states have (on average 1.420249653259362) internal successors, (1024), 728 states have internal predecessors, (1024), 308 states have call successors, (308), 19 states have call predecessors, (308), 19 states have return successors, (308), 301 states have call predecessors, (308), 308 states have call successors, (308) [2025-01-09 11:28:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1640 transitions. [2025-01-09 11:28:17,178 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1640 transitions. Word has length 212 [2025-01-09 11:28:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:17,178 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1640 transitions. [2025-01-09 11:28:17,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:17,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1640 transitions. [2025-01-09 11:28:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 11:28:17,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:17,182 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:17,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 11:28:17,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:17,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:17,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1295540026, now seen corresponding path program 1 times [2025-01-09 11:28:17,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921323412] [2025-01-09 11:28:17,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:17,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:17,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 11:28:17,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 11:28:17,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:17,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:28:17,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:28:17,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921323412] [2025-01-09 11:28:17,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921323412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:17,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:17,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 11:28:17,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164821103] [2025-01-09 11:28:17,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:17,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:28:17,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:28:17,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:28:17,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:28:17,587 INFO L87 Difference]: Start difference. First operand 1049 states and 1640 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:17,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:17,914 INFO L93 Difference]: Finished difference Result 2061 states and 3223 transitions. [2025-01-09 11:28:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:28:17,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 212 [2025-01-09 11:28:17,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:17,925 INFO L225 Difference]: With dead ends: 2061 [2025-01-09 11:28:17,925 INFO L226 Difference]: Without dead ends: 1051 [2025-01-09 11:28:17,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:28:17,929 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 208 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:17,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 596 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:28:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2025-01-09 11:28:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 973. [2025-01-09 11:28:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 645 states have (on average 1.3767441860465117) internal successors, (888), 652 states have internal predecessors, (888), 308 states have call successors, (308), 19 states have call predecessors, (308), 19 states have return successors, (308), 301 states have call predecessors, (308), 308 states have call successors, (308) [2025-01-09 11:28:18,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1504 transitions. [2025-01-09 11:28:18,065 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1504 transitions. Word has length 212 [2025-01-09 11:28:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:18,065 INFO L471 AbstractCegarLoop]: Abstraction has 973 states and 1504 transitions. [2025-01-09 11:28:18,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1504 transitions. [2025-01-09 11:28:18,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-09 11:28:18,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:18,068 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:18,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 11:28:18,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:18,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:18,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1944766350, now seen corresponding path program 1 times [2025-01-09 11:28:18,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:28:18,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074385711] [2025-01-09 11:28:18,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:18,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:28:18,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 11:28:18,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 11:28:18,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:18,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:28:18,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [830843812] [2025-01-09 11:28:18,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:18,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:28:18,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:28:18,140 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 11:28:18,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 11:28:18,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 11:28:18,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 11:28:18,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:18,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:28:18,355 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:28:18,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 11:28:18,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 11:28:18,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:18,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:28:18,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:28:18,576 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:28:18,577 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:28:18,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 11:28:18,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:28:18,782 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:18,936 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:28:18,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:28:18 BoogieIcfgContainer [2025-01-09 11:28:18,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:28:18,941 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:28:18,941 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:28:18,941 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:28:18,942 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:28:06" (3/4) ... [2025-01-09 11:28:18,944 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:28:18,945 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:28:18,947 INFO L158 Benchmark]: Toolchain (without parser) took 13234.40ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 122.9MB in the beginning and 261.1MB in the end (delta: -138.2MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2025-01-09 11:28:18,947 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:28:18,947 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.06ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 107.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:28:18,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.14ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 104.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:28:18,948 INFO L158 Benchmark]: Boogie Preprocessor took 69.00ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 100.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:28:18,948 INFO L158 Benchmark]: RCFGBuilder took 537.82ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 75.7MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:28:18,949 INFO L158 Benchmark]: TraceAbstraction took 12241.05ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 75.1MB in the beginning and 261.2MB in the end (delta: -186.0MB). Peak memory consumption was 150.3MB. Max. memory is 16.1GB. [2025-01-09 11:28:18,949 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 335.5MB. Free memory was 261.2MB in the beginning and 261.1MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:28:18,950 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.22ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.06ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 107.3MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.14ms. Allocated memory is still 167.8MB. Free memory was 107.3MB in the beginning and 104.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.00ms. Allocated memory is still 167.8MB. Free memory was 104.0MB in the beginning and 100.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 537.82ms. Allocated memory is still 167.8MB. Free memory was 100.6MB in the beginning and 75.7MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 12241.05ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 75.1MB in the beginning and 261.2MB in the end (delta: -186.0MB). Peak memory consumption was 150.3MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 335.5MB. Free memory was 261.2MB in the beginning and 261.1MB in the end (delta: 69.1kB). 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 shiftRight at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 194, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 120, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned char var_1_27 = 32; [L41] unsigned char var_1_31 = 32; [L42] unsigned char var_1_32 = 25; [L43] unsigned char var_1_33 = 128; [L44] double var_1_34 = 499.6; [L45] double var_1_35 = 3.5; [L46] unsigned char var_1_36 = 200; [L47] unsigned short int var_1_37 = 2; [L48] unsigned short int var_1_41 = 36532; [L49] unsigned short int var_1_42 = 32367; [L50] signed char var_1_43 = -2; [L51] signed char var_1_44 = 1; [L52] unsigned short int last_1_var_1_8 = 4; [L53] signed short int last_1_var_1_21 = -64; [L54] signed char last_1_var_1_25 = -128; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L198] isInitial = 1 [L199] FCALL initially() [L201] CALL updateLastVariables() [L189] last_1_var_1_8 = var_1_8 [L190] last_1_var_1_21 = var_1_21 [L191] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L201] RET updateLastVariables() [L202] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L137] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L138] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L138] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L139] var_1_6 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_7=0, var_1_8=4] [L140] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_7=0, var_1_8=4] [L141] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L141] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L142] var_1_11 = __VERIFIER_nondet_long() [L143] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L143] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L145] var_1_12 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L146] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L148] var_1_13 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L149] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L151] var_1_15 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L152] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] var_1_16 = __VERIFIER_nondet_long() [L156] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L156] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L159] var_1_17 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L160] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L161] var_1_18 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L162] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L163] var_1_19 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L164] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L165] var_1_20 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L166] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L167] var_1_26 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L168] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L171] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L173] var_1_32 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L174] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L175] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L175] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L176] var_1_35 = __VERIFIER_nondet_double() [L177] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L177] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L178] var_1_41 = __VERIFIER_nondet_ushort() [L179] CALL assume_abort_if_not(var_1_41 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L179] RET assume_abort_if_not(var_1_41 >= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L180] CALL assume_abort_if_not(var_1_41 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L180] RET assume_abort_if_not(var_1_41 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L181] var_1_42 = __VERIFIER_nondet_ushort() [L182] CALL assume_abort_if_not(var_1_42 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L182] RET assume_abort_if_not(var_1_42 >= 16383) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L183] CALL assume_abort_if_not(var_1_42 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L183] RET assume_abort_if_not(var_1_42 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L184] var_1_44 = __VERIFIER_nondet_char() [L185] CALL assume_abort_if_not(var_1_44 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L185] RET assume_abort_if_not(var_1_44 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L186] CALL assume_abort_if_not(var_1_44 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L186] RET assume_abort_if_not(var_1_44 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L202] RET updateVariables() [L203] CALL step() [L58] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L58] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L59] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L63] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L64] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=0, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L65] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L70] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L72] COND FALSE !(var_1_14 >= var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L77] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L78] COND TRUE \read(var_1_4) [L79] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L82] COND TRUE var_1_14 >= ((((var_1_14) < (var_1_14)) ? (var_1_14) : (var_1_14))) [L83] var_1_33 = ((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L85] var_1_34 = var_1_35 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L86] COND FALSE !(var_1_42 > var_1_41) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=129/2, var_1_15=4, var_1_16=32, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L93] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L100] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=3, var_1_15=4, var_1_16=32, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L102] COND TRUE (- var_1_14) <= var_1_14 [L103] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=3, var_1_15=4, var_1_16=32, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=32, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L111] COND FALSE !(var_1_14 >= (((((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14))) < 0 ) ? -((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14))) : ((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14)))))) [L118] var_1_27 = var_1_32 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=3, var_1_15=4, var_1_16=32, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L120] COND TRUE var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))) [L121] var_1_7 = (var_1_1 && (! 1)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=3, var_1_15=4, var_1_16=32, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L123] EXPR ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) | (-10 * var_1_25) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=3, var_1_15=4, var_1_16=32, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L123] COND FALSE !(-2 > (((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) | (-10 * var_1_25))) [L126] COND FALSE !(((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) <= ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21)))) [L131] var_1_37 = (var_1_41 - (var_1_42 - var_1_32)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=3, var_1_15=4, var_1_16=32, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L203] RET step() [L204] CALL, EXPR property() [L194] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=3, var_1_15=4, var_1_16=32, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L194-L195] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=3, var_1_15=4, var_1_16=32, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=257, var_1_14=3, var_1_15=4, var_1_16=32, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=0, var_1_26=0, var_1_27=0, var_1_31=-255, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=16384, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=257] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 9, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2797 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2767 mSDsluCounter, 5295 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3702 mSDsCounter, 1394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1992 IncrementalHoareTripleChecker+Invalid, 3386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1394 mSolverCounterUnsat, 1593 mSDtfsCounter, 1992 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 528 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1295occurred in iteration=6, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 8 MinimizatonAttempts, 1177 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2326 NumberOfCodeBlocks, 2326 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2102 ConstructedInterpolants, 0 QuantifiedInterpolants, 8206 SizeOfPredicates, 2 NumberOfNonLiveVariables, 481 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 20940/21120 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 11:28:18,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eb615b84715d4e5603f49b8da12039ac524d65195b0f458b0aca18ed675dad9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:28:21,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:28:21,306 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:28:21,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:28:21,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:28:21,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:28:21,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:28:21,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:28:21,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:28:21,348 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:28:21,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:28:21,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:28:21,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:28:21,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:28:21,349 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:28:21,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:28:21,349 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:28:21,349 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:28:21,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:28:21,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:28:21,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:28:21,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:28:21,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:28:21,349 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:28:21,349 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:28:21,350 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:21,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:28:21,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:28:21,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:21,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:28:21,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:28:21,351 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:28:21,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:28:21,351 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:28:21,351 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:28:21,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:28:21,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:28:21,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:28:21,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:28:21,351 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8eb615b84715d4e5603f49b8da12039ac524d65195b0f458b0aca18ed675dad9 [2025-01-09 11:28:21,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:28:21,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:28:21,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:28:21,688 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:28:21,688 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:28:21,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-01-09 11:28:22,969 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2198e3a2b/86e326804ce14edf9cf215e6296eadc9/FLAG1659fd9ab [2025-01-09 11:28:23,229 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:28:23,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-01-09 11:28:23,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2198e3a2b/86e326804ce14edf9cf215e6296eadc9/FLAG1659fd9ab [2025-01-09 11:28:23,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2198e3a2b/86e326804ce14edf9cf215e6296eadc9 [2025-01-09 11:28:23,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:28:23,266 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:28:23,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:28:23,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:28:23,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:28:23,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2bcf6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23, skipping insertion in model container [2025-01-09 11:28:23,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,297 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:28:23,432 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i[919,932] [2025-01-09 11:28:23,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:28:23,551 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:28:23,562 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i[919,932] [2025-01-09 11:28:23,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:28:23,641 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:28:23,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23 WrapperNode [2025-01-09 11:28:23,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:28:23,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:28:23,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:28:23,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:28:23,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,702 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2025-01-09 11:28:23,702 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:28:23,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:28:23,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:28:23,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:28:23,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,739 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 11:28:23,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,760 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,761 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:28:23,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:28:23,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:28:23,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:28:23,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (1/1) ... [2025-01-09 11:28:23,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:28:23,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:28:23,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 11:28:23,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 11:28:23,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:28:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:28:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:28:23,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:28:23,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:28:23,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:28:23,920 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:28:23,921 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:28:29,462 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 11:28:29,462 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:28:29,475 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:28:29,475 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:28:29,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:28:29 BoogieIcfgContainer [2025-01-09 11:28:29,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:28:29,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:28:29,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:28:29,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:28:29,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:28:23" (1/3) ... [2025-01-09 11:28:29,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368ee119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:28:29, skipping insertion in model container [2025-01-09 11:28:29,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:28:23" (2/3) ... [2025-01-09 11:28:29,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368ee119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:28:29, skipping insertion in model container [2025-01-09 11:28:29,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:28:29" (3/3) ... [2025-01-09 11:28:29,485 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i [2025-01-09 11:28:29,498 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:28:29,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-38.i that has 2 procedures, 91 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:28:29,558 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:28:29,571 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;@54d39a4b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:28:29,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:28:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 11:28:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 11:28:29,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:29,593 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:29,593 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:29,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2090276338, now seen corresponding path program 1 times [2025-01-09 11:28:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:28:29,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623158913] [2025-01-09 11:28:29,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:29,615 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 [2025-01-09 11:28:29,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:28:29,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:28:29,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:29,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 11:28:30,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 11:28:30,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:30,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:30,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:28:30,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:28:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2025-01-09 11:28:30,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:28:30,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:28:30,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623158913] [2025-01-09 11:28:30,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623158913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:30,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:30,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:28:30,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575146627] [2025-01-09 11:28:30,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:30,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:28:30,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:28:30,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:28:30,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:28:30,213 INFO L87 Difference]: Start difference. First operand has 91 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:28:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:30,245 INFO L93 Difference]: Finished difference Result 176 states and 318 transitions. [2025-01-09 11:28:30,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:28:30,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 205 [2025-01-09 11:28:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:30,256 INFO L225 Difference]: With dead ends: 176 [2025-01-09 11:28:30,256 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 11:28:30,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:28:30,261 INFO L435 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:30,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:28:30,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 11:28:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 11:28:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 11:28:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2025-01-09 11:28:30,305 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 205 [2025-01-09 11:28:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:30,305 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2025-01-09 11:28:30,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 11:28:30,308 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2025-01-09 11:28:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 11:28:30,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:30,313 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:30,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:30,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:30,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:30,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash 104334078, now seen corresponding path program 1 times [2025-01-09 11:28:30,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:28:30,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411418104] [2025-01-09 11:28:30,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:30,517 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 [2025-01-09 11:28:30,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:28:30,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:28:30,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:30,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 11:28:31,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 11:28:31,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:31,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:31,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:28:31,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:28:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:28:33,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:28:33,639 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:28:33,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411418104] [2025-01-09 11:28:33,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411418104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:33,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:33,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:28:33,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018368350] [2025-01-09 11:28:33,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:33,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:28:33,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:28:33,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:28:33,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:28:33,644 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:35,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 11:28:39,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-01-09 11:28:39,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:28:39,210 INFO L93 Difference]: Finished difference Result 244 states and 386 transitions. [2025-01-09 11:28:39,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:28:39,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-01-09 11:28:39,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:28:39,214 INFO L225 Difference]: With dead ends: 244 [2025-01-09 11:28:39,214 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 11:28:39,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:28:39,215 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 16 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:28:39,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 253 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-01-09 11:28:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 11:28:39,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 154. [2025-01-09 11:28:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 85 states have internal predecessors, (108), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 11:28:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 240 transitions. [2025-01-09 11:28:39,244 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 240 transitions. Word has length 205 [2025-01-09 11:28:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:28:39,244 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 240 transitions. [2025-01-09 11:28:39,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 240 transitions. [2025-01-09 11:28:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 11:28:39,247 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:28:39,248 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:28:39,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-01-09 11:28:39,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 [2025-01-09 11:28:39,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:28:39,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:28:39,449 INFO L85 PathProgramCache]: Analyzing trace with hash 509880779, now seen corresponding path program 1 times [2025-01-09 11:28:39,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:28:39,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473175693] [2025-01-09 11:28:39,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:28:39,450 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 [2025-01-09 11:28:39,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:28:39,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:28:39,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (4)] Waiting until timeout for monitored process [2025-01-09 11:28:39,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 11:28:39,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 11:28:39,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:28:39,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:28:39,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 11:28:39,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:28:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 11:28:42,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:28:42,068 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:28:42,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473175693] [2025-01-09 11:28:42,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473175693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:28:42,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:28:42,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:28:42,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830497966] [2025-01-09 11:28:42,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:28:42,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 11:28:42,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:28:42,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 11:28:42,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:28:42,070 INFO L87 Difference]: Start difference. First operand 154 states and 240 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:28:46,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:28:48,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:28:52,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:28:56,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:29:00,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 11:29:00,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:29:00,797 INFO L93 Difference]: Finished difference Result 404 states and 635 transitions. [2025-01-09 11:29:00,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:29:00,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2025-01-09 11:29:00,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:29:00,807 INFO L225 Difference]: With dead ends: 404 [2025-01-09 11:29:00,808 INFO L226 Difference]: Without dead ends: 318 [2025-01-09 11:29:00,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 11:29:00,812 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 242 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 68 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2025-01-09 11:29:00,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 718 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 18.5s Time] [2025-01-09 11:29:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-01-09 11:29:00,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 238. [2025-01-09 11:29:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 135 states have (on average 1.288888888888889) internal successors, (174), 135 states have internal predecessors, (174), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-01-09 11:29:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 372 transitions. [2025-01-09 11:29:00,873 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 372 transitions. Word has length 206 [2025-01-09 11:29:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:29:00,874 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 372 transitions. [2025-01-09 11:29:00,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 11:29:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 372 transitions. [2025-01-09 11:29:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 11:29:00,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:29:00,877 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:29:00,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (4)] Ended with exit code 0 [2025-01-09 11:29:01,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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 [2025-01-09 11:29:01,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:29:01,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:29:01,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1595511162, now seen corresponding path program 1 times [2025-01-09 11:29:01,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:29:01,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367540783] [2025-01-09 11:29:01,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:29:01,079 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 [2025-01-09 11:29:01,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:29:01,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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) [2025-01-09 11:29:01,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (5)] Waiting until timeout for monitored process [2025-01-09 11:29:01,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 11:29:01,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 11:29:01,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:29:01,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:29:01,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 11:29:01,549 INFO L279 TraceCheckSpWp]: Computing forward predicates...