./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-15.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 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:18:15,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:18:15,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 23:18:15,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:18:15,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:18:15,221 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:18:15,222 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:18:15,222 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:18:15,223 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:18:15,223 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:18:15,223 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:18:15,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:18:15,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:18:15,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:18:15,224 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:18:15,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:18:15,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:18:15,225 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:18:15,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 23:18:15,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:18:15,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:18:15,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:18:15,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:18:15,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:18:15,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:18:15,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:18:15,226 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:18:15,226 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:18:15,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:18:15,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:18:15,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:18:15,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:18:15,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:18:15,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:18:15,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:18:15,227 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:18:15,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:18:15,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 23:18:15,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 23:18:15,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:18:15,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:18:15,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:18:15,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:18:15,228 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 -> 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 [2025-02-05 23:18:15,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:18:15,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:18:15,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:18:15,510 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:18:15,510 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:18:15,511 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-15.i [2025-02-05 23:18:16,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6f9fcf24/73fc5f3310de4b4ab6318d0909f87609/FLAGcb674f022 [2025-02-05 23:18:17,011 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:18:17,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2025-02-05 23:18:17,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6f9fcf24/73fc5f3310de4b4ab6318d0909f87609/FLAGcb674f022 [2025-02-05 23:18:17,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d6f9fcf24/73fc5f3310de4b4ab6318d0909f87609 [2025-02-05 23:18:17,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:18:17,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:18:17,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:18:17,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:18:17,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:18:17,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425c826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17, skipping insertion in model container [2025-02-05 23:18:17,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:18:17,193 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-15.i[919,932] [2025-02-05 23:18:17,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:18:17,297 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:18:17,307 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-15.i[919,932] [2025-02-05 23:18:17,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:18:17,382 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:18:17,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17 WrapperNode [2025-02-05 23:18:17,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:18:17,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:18:17,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:18:17,386 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:18:17,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,421 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2025-02-05 23:18:17,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:18:17,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:18:17,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:18:17,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:18:17,432 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,450 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-02-05 23:18:17,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:18:17,465 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:18:17,465 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:18:17,466 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:18:17,466 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (1/1) ... [2025-02-05 23:18:17,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:18:17,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:18:17,496 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-02-05 23:18:17,501 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-02-05 23:18:17,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:18:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:18:17,524 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:18:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 23:18:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:18:17,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:18:17,614 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:18:17,615 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:18:17,946 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 23:18:17,948 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:18:17,960 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:18:17,961 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:18:17,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:18:17 BoogieIcfgContainer [2025-02-05 23:18:17,961 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:18:17,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:18:17,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:18:17,966 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:18:17,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:18:17" (1/3) ... [2025-02-05 23:18:17,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3ac08b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:18:17, skipping insertion in model container [2025-02-05 23:18:17,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:17" (2/3) ... [2025-02-05 23:18:17,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3ac08b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:18:17, skipping insertion in model container [2025-02-05 23:18:17,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:18:17" (3/3) ... [2025-02-05 23:18:17,968 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2025-02-05 23:18:17,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:18:17,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:18:18,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:18:18,052 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;@3684120, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:18:18,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:18:18,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 23:18:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 23:18:18,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:18,071 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:18:18,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:18,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash -228890672, now seen corresponding path program 1 times [2025-02-05 23:18:18,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:18,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656309842] [2025-02-05 23:18:18,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:18,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 23:18:18,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 23:18:18,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:18,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:18,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 23:18:18,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:18:18,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656309842] [2025-02-05 23:18:18,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656309842] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:18:18,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672450045] [2025-02-05 23:18:18,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:18,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:18:18,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:18:18,425 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-02-05 23:18:18,427 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-02-05 23:18:18,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 23:18:18,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 23:18:18,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:18,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:18,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:18:18,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:18:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 23:18:18,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:18:18,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672450045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:18,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:18:18,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 23:18:18,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045112485] [2025-02-05 23:18:18,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:18,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:18:18,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:18:18,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:18:18,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:18:18,729 INFO L87 Difference]: Start difference. First operand has 94 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 23:18:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:18,766 INFO L93 Difference]: Finished difference Result 180 states and 315 transitions. [2025-02-05 23:18:18,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:18:18,769 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 194 [2025-02-05 23:18:18,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:18,776 INFO L225 Difference]: With dead ends: 180 [2025-02-05 23:18:18,777 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 23:18:18,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 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-02-05 23:18:18,785 INFO L435 NwaCegarLoop]: 137 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, 137 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-02-05 23:18:18,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:18:18,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 23:18:18,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-05 23:18:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 23:18:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2025-02-05 23:18:18,843 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 194 [2025-02-05 23:18:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:18,844 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2025-02-05 23:18:18,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 23:18:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2025-02-05 23:18:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 23:18:18,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:18,849 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:18:18,858 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-02-05 23:18:19,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 23:18:19,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:19,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:19,051 INFO L85 PathProgramCache]: Analyzing trace with hash 973408500, now seen corresponding path program 1 times [2025-02-05 23:18:19,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:19,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383468147] [2025-02-05 23:18:19,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:19,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:19,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 23:18:19,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 23:18:19,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:19,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 23:18:19,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:18:19,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383468147] [2025-02-05 23:18:19,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383468147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:19,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:19,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:18:19,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981231913] [2025-02-05 23:18:19,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:19,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:18:19,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:18:19,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:18:19,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:18:19,584 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:18:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:19,844 INFO L93 Difference]: Finished difference Result 263 states and 407 transitions. [2025-02-05 23:18:19,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:18:19,845 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2025-02-05 23:18:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:19,848 INFO L225 Difference]: With dead ends: 263 [2025-02-05 23:18:19,848 INFO L226 Difference]: Without dead ends: 177 [2025-02-05 23:18:19,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:18:19,850 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 84 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:18:19,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 379 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:18:19,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-02-05 23:18:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 145. [2025-02-05 23:18:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:18:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 222 transitions. [2025-02-05 23:18:19,884 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 222 transitions. Word has length 194 [2025-02-05 23:18:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:19,885 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 222 transitions. [2025-02-05 23:18:19,885 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:18:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 222 transitions. [2025-02-05 23:18:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 23:18:19,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:19,888 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:18:19,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 23:18:19,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:19,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:19,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1131733292, now seen corresponding path program 1 times [2025-02-05 23:18:19,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:19,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255480937] [2025-02-05 23:18:19,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:19,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:19,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 23:18:20,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 23:18:20,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:20,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 23:18:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:18:20,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255480937] [2025-02-05 23:18:20,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255480937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:20,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:20,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 23:18:20,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315187039] [2025-02-05 23:18:20,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:20,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:18:20,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:18:20,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:18:20,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:18:20,433 INFO L87 Difference]: Start difference. First operand 145 states and 222 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:18:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:20,688 INFO L93 Difference]: Finished difference Result 335 states and 505 transitions. [2025-02-05 23:18:20,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:18:20,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2025-02-05 23:18:20,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:20,696 INFO L225 Difference]: With dead ends: 335 [2025-02-05 23:18:20,697 INFO L226 Difference]: Without dead ends: 249 [2025-02-05 23:18:20,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:18:20,702 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 136 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 23:18:20,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 314 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 23:18:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-05 23:18:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 210. [2025-02-05 23:18:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 132 states have internal predecessors, (166), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 23:18:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 314 transitions. [2025-02-05 23:18:20,764 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 314 transitions. Word has length 195 [2025-02-05 23:18:20,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:20,764 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 314 transitions. [2025-02-05 23:18:20,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:18:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 314 transitions. [2025-02-05 23:18:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 23:18:20,772 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:20,772 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:18:20,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 23:18:20,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:20,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:20,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1540557517, now seen corresponding path program 1 times [2025-02-05 23:18:20,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:20,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153300198] [2025-02-05 23:18:20,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:20,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:20,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 23:18:20,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 23:18:20,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:20,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 23:18:21,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:18:21,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153300198] [2025-02-05 23:18:21,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153300198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:21,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:21,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:18:21,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372377177] [2025-02-05 23:18:21,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:21,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:18:21,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:18:21,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:18:21,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:18:21,121 INFO L87 Difference]: Start difference. First operand 210 states and 314 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:18:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:21,239 INFO L93 Difference]: Finished difference Result 449 states and 677 transitions. [2025-02-05 23:18:21,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:18:21,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2025-02-05 23:18:21,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:21,247 INFO L225 Difference]: With dead ends: 449 [2025-02-05 23:18:21,247 INFO L226 Difference]: Without dead ends: 302 [2025-02-05 23:18:21,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:18:21,251 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 64 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 23:18:21,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 271 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 23:18:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-02-05 23:18:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2025-02-05 23:18:21,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 186 states have (on average 1.2526881720430108) internal successors, (233), 187 states have internal predecessors, (233), 104 states have call successors, (104), 6 states have call predecessors, (104), 6 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-02-05 23:18:21,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 441 transitions. [2025-02-05 23:18:21,325 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 441 transitions. Word has length 195 [2025-02-05 23:18:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:21,327 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 441 transitions. [2025-02-05 23:18:21,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:18:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 441 transitions. [2025-02-05 23:18:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 23:18:21,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:21,331 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:18:21,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 23:18:21,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:21,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 336269965, now seen corresponding path program 1 times [2025-02-05 23:18:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:21,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52477957] [2025-02-05 23:18:21,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:21,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:21,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 23:18:21,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 23:18:21,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:21,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:21,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 23:18:21,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:18:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52477957] [2025-02-05 23:18:21,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52477957] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:18:21,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126636904] [2025-02-05 23:18:21,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:21,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:18:21,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:18:21,654 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-02-05 23:18:21,656 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-02-05 23:18:21,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 23:18:21,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 23:18:21,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:21,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:21,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 23:18:21,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:18:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-02-05 23:18:22,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:18:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 23:18:22,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126636904] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:18:22,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 23:18:22,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 19 [2025-02-05 23:18:22,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731111783] [2025-02-05 23:18:22,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 23:18:22,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 23:18:22,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:18:22,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 23:18:22,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-02-05 23:18:22,760 INFO L87 Difference]: Start difference. First operand 297 states and 441 transitions. Second operand has 19 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 19 states have internal predecessors, (137), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-02-05 23:18:24,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:24,815 INFO L93 Difference]: Finished difference Result 1176 states and 1706 transitions. [2025-02-05 23:18:24,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-02-05 23:18:24,815 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 19 states have internal predecessors, (137), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) Word has length 196 [2025-02-05 23:18:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:24,823 INFO L225 Difference]: With dead ends: 1176 [2025-02-05 23:18:24,823 INFO L226 Difference]: Without dead ends: 907 [2025-02-05 23:18:24,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=690, Invalid=2390, Unknown=0, NotChecked=0, Total=3080 [2025-02-05 23:18:24,826 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 938 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 529 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 23:18:24,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 915 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [529 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 23:18:24,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2025-02-05 23:18:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 573. [2025-02-05 23:18:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 356 states have (on average 1.1601123595505618) internal successors, (413), 360 states have internal predecessors, (413), 192 states have call successors, (192), 24 states have call predecessors, (192), 24 states have return successors, (192), 188 states have call predecessors, (192), 192 states have call successors, (192) [2025-02-05 23:18:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 797 transitions. [2025-02-05 23:18:24,968 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 797 transitions. Word has length 196 [2025-02-05 23:18:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:24,969 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 797 transitions. [2025-02-05 23:18:24,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.2105263157894735) internal successors, (137), 19 states have internal predecessors, (137), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-02-05 23:18:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 797 transitions. [2025-02-05 23:18:24,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 23:18:24,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:24,972 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:18:24,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 23:18:25,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 23:18:25,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:25,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:25,174 INFO L85 PathProgramCache]: Analyzing trace with hash -436865040, now seen corresponding path program 1 times [2025-02-05 23:18:25,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:25,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917121843] [2025-02-05 23:18:25,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:25,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:25,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 23:18:25,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 23:18:25,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:25,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 23:18:25,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 23:18:25,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917121843] [2025-02-05 23:18:25,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917121843] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:25,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:25,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:18:25,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004049726] [2025-02-05 23:18:25,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:25,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 23:18:25,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 23:18:25,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 23:18:25,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:18:25,271 INFO L87 Difference]: Start difference. First operand 573 states and 797 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:18:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:25,370 INFO L93 Difference]: Finished difference Result 847 states and 1173 transitions. [2025-02-05 23:18:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 23:18:25,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2025-02-05 23:18:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:25,375 INFO L225 Difference]: With dead ends: 847 [2025-02-05 23:18:25,375 INFO L226 Difference]: Without dead ends: 508 [2025-02-05 23:18:25,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 23:18:25,395 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 112 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:18:25,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 131 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:18:25,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-02-05 23:18:25,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 336. [2025-02-05 23:18:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 205 states have (on average 1.1121951219512196) internal successors, (228), 206 states have internal predecessors, (228), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 23:18:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 452 transitions. [2025-02-05 23:18:25,474 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 452 transitions. Word has length 197 [2025-02-05 23:18:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:25,475 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 452 transitions. [2025-02-05 23:18:25,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:18:25,475 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 452 transitions. [2025-02-05 23:18:25,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 23:18:25,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:25,478 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:18:25,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 23:18:25,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:25,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash -435941519, now seen corresponding path program 1 times [2025-02-05 23:18:25,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 23:18:25,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415645300] [2025-02-05 23:18:25,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:25,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 23:18:25,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 23:18:25,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 23:18:25,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:25,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:18:25,602 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 23:18:25,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 23:18:25,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 23:18:25,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:25,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 23:18:25,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 23:18:25,800 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 23:18:25,801 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 23:18:25,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 23:18:25,806 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-05 23:18:25,974 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 23:18:25,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:18:25 BoogieIcfgContainer [2025-02-05 23:18:25,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 23:18:25,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 23:18:25,980 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 23:18:25,982 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 23:18:25,982 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:18:17" (3/4) ... [2025-02-05 23:18:25,985 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 23:18:25,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 23:18:25,987 INFO L158 Benchmark]: Toolchain (without parser) took 8946.98ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 112.0MB in the beginning and 86.3MB in the end (delta: 25.7MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. [2025-02-05 23:18:25,988 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:18:25,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.49ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 96.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 23:18:25,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:18:25,989 INFO L158 Benchmark]: Boogie Preprocessor took 38.97ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:18:25,989 INFO L158 Benchmark]: IcfgBuilder took 496.03ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 68.8MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 23:18:25,989 INFO L158 Benchmark]: TraceAbstraction took 8016.54ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 67.9MB in the beginning and 86.4MB in the end (delta: -18.4MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2025-02-05 23:18:25,990 INFO L158 Benchmark]: Witness Printer took 5.59ms. Allocated memory is still 218.1MB. Free memory was 86.4MB in the beginning and 86.3MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 23:18:25,991 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.24ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.49ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 96.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 94.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.97ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 91.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 496.03ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 68.8MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8016.54ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 67.9MB in the beginning and 86.4MB in the end (delta: -18.4MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. * Witness Printer took 5.59ms. Allocated memory is still 218.1MB. Free memory was 86.4MB in the beginning and 86.3MB in the end (delta: 33.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 someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 211, overapproximation of someBinaryFLOATComparisonOperation at line 174, overapproximation of someUnaryDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 195, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 197, overapproximation of someBinaryDOUBLEComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 211. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed short int var_1_26 = 10; [L43] signed short int var_1_32 = 0; [L44] signed short int var_1_33 = 10; [L45] signed long int var_1_34 = -10; [L46] double var_1_36 = 4.85; [L47] double var_1_37 = 2.5; [L48] double var_1_38 = 15.75; [L49] signed char var_1_39 = -100; [L50] signed char var_1_40 = 1; [L51] signed short int var_1_41 = -32; [L52] signed char var_1_42 = 4; [L53] signed char var_1_43 = -8; [L54] signed short int var_1_44 = -25; [L55] signed char last_1_var_1_10 = -5; [L56] signed long int last_1_var_1_21 = 1; [L57] signed long int last_1_var_1_25 = -4; VAL [isInitial=0, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L215] isInitial = 1 [L216] FCALL initially() [L217] COND TRUE 1 [L218] CALL updateLastVariables() [L206] last_1_var_1_10 = var_1_10 [L207] last_1_var_1_21 = var_1_21 [L208] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L218] RET updateLastVariables() [L219] CALL updateVariables() [L155] var_1_3 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L156] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L157] var_1_4 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L158] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L159] var_1_7 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L160] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L161] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L161] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L162] var_1_8 = __VERIFIER_nondet_short() [L163] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L163] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L164] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L164] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L165] var_1_9 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L166] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L167] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L167] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L168] var_1_11 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L169] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L170] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L170] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L171] var_1_13 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L172] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L173] var_1_14 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L174] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L175] var_1_15 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L176] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L177] var_1_16 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L178] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L179] var_1_20 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L180] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L181] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L181] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L182] var_1_22 = __VERIFIER_nondet_short() [L183] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L183] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L184] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L184] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L185] var_1_23 = __VERIFIER_nondet_short() [L186] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L186] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L187] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L187] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L188] var_1_32 = __VERIFIER_nondet_short() [L189] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L189] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L190] CALL assume_abort_if_not(var_1_32 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L190] RET assume_abort_if_not(var_1_32 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L191] var_1_33 = __VERIFIER_nondet_short() [L192] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L192] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L193] CALL assume_abort_if_not(var_1_33 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L193] RET assume_abort_if_not(var_1_33 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L194] var_1_37 = __VERIFIER_nondet_double() [L195] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L195] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L196] var_1_38 = __VERIFIER_nondet_double() [L197] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L197] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L198] var_1_40 = __VERIFIER_nondet_char() [L199] CALL assume_abort_if_not(var_1_40 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L199] RET assume_abort_if_not(var_1_40 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L200] CALL assume_abort_if_not(var_1_40 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L200] RET assume_abort_if_not(var_1_40 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L201] var_1_43 = __VERIFIER_nondet_char() [L202] CALL assume_abort_if_not(var_1_43 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L202] RET assume_abort_if_not(var_1_43 >= -126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L203] CALL assume_abort_if_not(var_1_43 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L203] RET assume_abort_if_not(var_1_43 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L219] RET updateVariables() [L220] CALL step() [L61] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L62] COND TRUE var_1_11 <= last_1_var_1_25 [L63] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L66] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-10, var_1_11=-10, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L67] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L68] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=9] [L72] COND TRUE (! var_1_19) || var_1_19 [L73] var_1_44 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L85] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L86] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L93] var_1_34 = ((((128) < (((((var_1_10) > ((-5 + var_1_17))) ? (var_1_10) : ((-5 + var_1_17)))))) ? (128) : (((((var_1_10) > ((-5 + var_1_17))) ? (var_1_10) : ((-5 + var_1_17))))))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L94] COND FALSE !(var_1_33 <= var_1_10) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L97] COND FALSE !(\read(var_1_19)) [L100] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L102] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L103] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=10, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L106] COND FALSE !(var_1_17 >= 25) [L117] var_1_26 = var_1_17 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=-5, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L121] COND FALSE !(\read(var_1_19)) [L124] var_1_36 = ((((var_1_37) > (var_1_38)) ? (var_1_37) : (var_1_38))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=-5, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=-100, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L126] var_1_39 = var_1_40 [L127] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=-5, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L128] COND TRUE var_1_19 || stepLocal_0 [L129] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=-5, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L133] signed long int stepLocal_3 = var_1_22 + var_1_11; [L134] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-10, stepLocal_3=16373, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=-5, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L135] COND FALSE !(\read(var_1_20)) [L148] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-10, stepLocal_3=16373, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=9, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=-5, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L150] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-10, stepLocal_3=16373, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=9, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=-5, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L220] RET step() [L221] CALL, EXPR property() [L211-L212] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=9, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=-5, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L221] RET, EXPR property() [L221] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=9, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=-5, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-10, var_1_11=-10, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=9, var_1_22=16383, var_1_23=16384, var_1_25=-10, var_1_26=-5, var_1_32=-1, var_1_33=0, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=-127, var_1_40=-127, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-10, var_1_7=0, var_1_8=1, var_1_9=9] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1352 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1334 mSDsluCounter, 2147 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1322 mSDsCounter, 649 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1444 IncrementalHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 649 mSolverCounterUnsat, 825 mSDtfsCounter, 1444 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 653 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=573occurred in iteration=5, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 582 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1758 NumberOfCodeBlocks, 1758 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1748 ConstructedInterpolants, 0 QuantifiedInterpolants, 4113 SizeOfPredicates, 7 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 15518/15660 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-02-05 23:18:26,017 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-15.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 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 23:18:28,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 23:18:28,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 23:18:28,516 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 23:18:28,517 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 23:18:28,548 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 23:18:28,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 23:18:28,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 23:18:28,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 23:18:28,551 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 23:18:28,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 23:18:28,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 23:18:28,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 23:18:28,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 23:18:28,552 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 23:18:28,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 23:18:28,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 23:18:28,554 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 23:18:28,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 23:18:28,554 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 23:18:28,554 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 23:18:28,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 23:18:28,554 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 23:18:28,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 23:18:28,554 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 23:18:28,554 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 23:18:28,555 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:18:28,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 23:18:28,555 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 23:18:28,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 23:18:28,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 23:18:28,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 23:18:28,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 23:18:28,556 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 -> 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 [2025-02-05 23:18:28,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 23:18:28,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 23:18:28,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 23:18:28,861 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 23:18:28,861 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 23:18:28,863 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-15.i [2025-02-05 23:18:30,143 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a263bf334/bfea4269ac5d4fe695eebe864522683d/FLAG103bc2dc8 [2025-02-05 23:18:30,410 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 23:18:30,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2025-02-05 23:18:30,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a263bf334/bfea4269ac5d4fe695eebe864522683d/FLAG103bc2dc8 [2025-02-05 23:18:30,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a263bf334/bfea4269ac5d4fe695eebe864522683d [2025-02-05 23:18:30,441 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 23:18:30,442 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 23:18:30,443 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 23:18:30,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 23:18:30,447 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 23:18:30,448 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f5bb3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30, skipping insertion in model container [2025-02-05 23:18:30,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 23:18:30,599 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-15.i[919,932] [2025-02-05 23:18:30,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:18:30,697 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 23:18:30,707 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-15.i[919,932] [2025-02-05 23:18:30,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 23:18:30,758 INFO L204 MainTranslator]: Completed translation [2025-02-05 23:18:30,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30 WrapperNode [2025-02-05 23:18:30,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 23:18:30,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 23:18:30,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 23:18:30,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 23:18:30,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,821 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2025-02-05 23:18:30,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 23:18:30,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 23:18:30,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 23:18:30,822 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 23:18:30,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,868 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-02-05 23:18:30,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 23:18:30,904 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 23:18:30,904 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 23:18:30,904 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 23:18:30,905 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (1/1) ... [2025-02-05 23:18:30,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 23:18:30,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 23:18:30,935 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-02-05 23:18:30,938 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-02-05 23:18:30,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 23:18:30,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 23:18:30,961 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 23:18:30,961 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 23:18:30,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 23:18:30,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 23:18:31,039 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 23:18:31,041 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 23:18:37,976 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 23:18:37,977 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 23:18:37,989 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 23:18:37,991 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 23:18:37,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:18:37 BoogieIcfgContainer [2025-02-05 23:18:37,991 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 23:18:37,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 23:18:37,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 23:18:37,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 23:18:38,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:18:30" (1/3) ... [2025-02-05 23:18:38,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519de4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:18:38, skipping insertion in model container [2025-02-05 23:18:38,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:18:30" (2/3) ... [2025-02-05 23:18:38,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519de4e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:18:38, skipping insertion in model container [2025-02-05 23:18:38,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:18:37" (3/3) ... [2025-02-05 23:18:38,003 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2025-02-05 23:18:38,015 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 23:18:38,018 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 23:18:38,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 23:18:38,077 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;@747454c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 23:18:38,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 23:18:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 23:18:38,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 23:18:38,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:38,094 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:18:38,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:38,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:38,099 INFO L85 PathProgramCache]: Analyzing trace with hash -228890672, now seen corresponding path program 1 times [2025-02-05 23:18:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:18:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973161890] [2025-02-05 23:18:38,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:38,110 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-02-05 23:18:38,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:18:38,112 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-02-05 23:18:38,113 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-02-05 23:18:38,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 23:18:38,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 23:18:38,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:38,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:38,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 23:18:38,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:18:38,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2025-02-05 23:18:38,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:18:38,723 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:18:38,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973161890] [2025-02-05 23:18:38,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973161890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:38,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:38,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 23:18:38,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205018203] [2025-02-05 23:18:38,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:38,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 23:18:38,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:18:38,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 23:18:38,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 23:18:38,752 INFO L87 Difference]: Start difference. First operand has 94 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 23:18:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:38,784 INFO L93 Difference]: Finished difference Result 180 states and 315 transitions. [2025-02-05 23:18:38,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 23:18:38,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 194 [2025-02-05 23:18:38,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:38,790 INFO L225 Difference]: With dead ends: 180 [2025-02-05 23:18:38,790 INFO L226 Difference]: Without dead ends: 89 [2025-02-05 23:18:38,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 193 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-02-05 23:18:38,796 INFO L435 NwaCegarLoop]: 137 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, 137 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-02-05 23:18:38,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 23:18:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-02-05 23:18:38,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-02-05 23:18:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-05 23:18:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2025-02-05 23:18:38,842 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 194 [2025-02-05 23:18:38,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:38,842 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2025-02-05 23:18:38,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 23:18:38,843 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2025-02-05 23:18:38,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-05 23:18:38,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:38,847 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:18:38,866 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-02-05 23:18:39,048 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-02-05 23:18:39,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:39,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:39,049 INFO L85 PathProgramCache]: Analyzing trace with hash 973408500, now seen corresponding path program 1 times [2025-02-05 23:18:39,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:18:39,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304882632] [2025-02-05 23:18:39,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:39,050 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-02-05 23:18:39,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:18:39,053 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-02-05 23:18:39,054 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-02-05 23:18:39,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-05 23:18:39,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-05 23:18:39,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:39,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:39,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 23:18:39,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:18:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 23:18:41,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:18:41,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:18:41,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304882632] [2025-02-05 23:18:41,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304882632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:41,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:41,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:18:41,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293920293] [2025-02-05 23:18:41,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:41,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:18:41,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:18:41,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:18:41,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:18:41,214 INFO L87 Difference]: Start difference. First operand 89 states and 137 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:18:42,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:18:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:18:43,813 INFO L93 Difference]: Finished difference Result 262 states and 406 transitions. [2025-02-05 23:18:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:18:43,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2025-02-05 23:18:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:18:43,831 INFO L225 Difference]: With dead ends: 262 [2025-02-05 23:18:43,831 INFO L226 Difference]: Without dead ends: 176 [2025-02-05 23:18:43,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 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-02-05 23:18:43,833 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 78 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 23:18:43,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 381 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 23:18:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-05 23:18:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 145. [2025-02-05 23:18:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:18:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 222 transitions. [2025-02-05 23:18:43,869 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 222 transitions. Word has length 194 [2025-02-05 23:18:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:18:43,870 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 222 transitions. [2025-02-05 23:18:43,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:18:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 222 transitions. [2025-02-05 23:18:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 23:18:43,872 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:18:43,873 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:18:43,892 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-02-05 23:18:44,073 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-02-05 23:18:44,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:18:44,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:18:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1131733292, now seen corresponding path program 1 times [2025-02-05 23:18:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:18:44,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928045230] [2025-02-05 23:18:44,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:18:44,076 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-02-05 23:18:44,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:18:44,078 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-02-05 23:18:44,079 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-02-05 23:18:44,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 23:18:44,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 23:18:44,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:18:44,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:18:44,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 23:18:44,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:18:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 23:18:46,789 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:18:46,789 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:18:46,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928045230] [2025-02-05 23:18:46,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928045230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:18:46,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 23:18:46,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 23:18:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436671442] [2025-02-05 23:18:46,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:18:46,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:18:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:18:46,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:18:46,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 23:18:46,792 INFO L87 Difference]: Start difference. First operand 145 states and 222 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:18:48,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:18:52,978 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 [] [2025-02-05 23:18:56,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 23:18:58,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:18:59,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 23:19:04,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 23:19:11,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 23:19:12,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 23:19:12,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:19:12,288 INFO L93 Difference]: Finished difference Result 317 states and 490 transitions. [2025-02-05 23:19:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:19:12,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2025-02-05 23:19:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:19:12,304 INFO L225 Difference]: With dead ends: 317 [2025-02-05 23:19:12,304 INFO L226 Difference]: Without dead ends: 231 [2025-02-05 23:19:12,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 23:19:12,308 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 121 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2025-02-05 23:19:12,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 352 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 25.0s Time] [2025-02-05 23:19:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-02-05 23:19:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 148. [2025-02-05 23:19:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:19:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 225 transitions. [2025-02-05 23:19:12,367 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 225 transitions. Word has length 195 [2025-02-05 23:19:12,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:19:12,369 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 225 transitions. [2025-02-05 23:19:12,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:19:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 225 transitions. [2025-02-05 23:19:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 23:19:12,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:19:12,374 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:19:12,397 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-02-05 23:19:12,574 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-02-05 23:19:12,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:19:12,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:19:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2128805645, now seen corresponding path program 1 times [2025-02-05 23:19:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:19:12,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550403301] [2025-02-05 23:19:12,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:19:12,576 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-02-05 23:19:12,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:19:12,580 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-02-05 23:19:12,582 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-02-05 23:19:12,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 23:19:13,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 23:19:13,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:19:13,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:19:13,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 23:19:13,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:19:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 896 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-02-05 23:19:14,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:19:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 23:19:15,794 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:19:15,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550403301] [2025-02-05 23:19:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550403301] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:19:15,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:19:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-05 23:19:15,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467765470] [2025-02-05 23:19:15,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 23:19:15,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 23:19:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:19:15,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 23:19:15,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 23:19:15,799 INFO L87 Difference]: Start difference. First operand 148 states and 225 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-02-05 23:19:18,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:19:22,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:19:25,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:19:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:19:26,346 INFO L93 Difference]: Finished difference Result 338 states and 507 transitions. [2025-02-05 23:19:26,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 23:19:26,358 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 195 [2025-02-05 23:19:26,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:19:26,361 INFO L225 Difference]: With dead ends: 338 [2025-02-05 23:19:26,361 INFO L226 Difference]: Without dead ends: 249 [2025-02-05 23:19:26,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-02-05 23:19:26,363 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 365 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-02-05 23:19:26,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 416 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 9.8s Time] [2025-02-05 23:19:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-05 23:19:26,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 153. [2025-02-05 23:19:26,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 88 states have internal predecessors, (107), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:19:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 227 transitions. [2025-02-05 23:19:26,405 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 227 transitions. Word has length 195 [2025-02-05 23:19:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:19:26,405 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 227 transitions. [2025-02-05 23:19:26,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-02-05 23:19:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 227 transitions. [2025-02-05 23:19:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 23:19:26,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:19:26,408 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:19:26,430 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 (5)] Ended with exit code 0 [2025-02-05 23:19:26,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-02-05 23:19:26,609 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:19:26,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:19:26,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1470036824, now seen corresponding path program 1 times [2025-02-05 23:19:26,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:19:26,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925297191] [2025-02-05 23:19:26,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:19:26,610 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-02-05 23:19:26,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:19:26,612 INFO L229 MonitoredProcess]: Starting monitored process 6 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-02-05 23:19:26,613 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 (6)] Waiting until timeout for monitored process [2025-02-05 23:19:26,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 23:19:27,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 23:19:27,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:19:27,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:19:27,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 23:19:27,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:19:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 899 proven. 42 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2025-02-05 23:19:27,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:19:27,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 23:19:27,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:19:27,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925297191] [2025-02-05 23:19:27,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925297191] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 23:19:27,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:19:27,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-02-05 23:19:27,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119577057] [2025-02-05 23:19:27,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 23:19:27,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:19:27,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:19:27,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:19:27,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 23:19:27,972 INFO L87 Difference]: Start difference. First operand 153 states and 227 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-05 23:19:30,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:19:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:19:30,664 INFO L93 Difference]: Finished difference Result 256 states and 371 transitions. [2025-02-05 23:19:30,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 23:19:30,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 196 [2025-02-05 23:19:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:19:30,693 INFO L225 Difference]: With dead ends: 256 [2025-02-05 23:19:30,693 INFO L226 Difference]: Without dead ends: 166 [2025-02-05 23:19:30,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 23:19:30,694 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 205 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 23:19:30,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 207 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 23:19:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-05 23:19:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2025-02-05 23:19:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 91 states have (on average 1.0879120879120878) internal successors, (99), 91 states have internal predecessors, (99), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:19:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 219 transitions. [2025-02-05 23:19:30,723 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 219 transitions. Word has length 196 [2025-02-05 23:19:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:19:30,725 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 219 transitions. [2025-02-05 23:19:30,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-05 23:19:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 219 transitions. [2025-02-05 23:19:30,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 23:19:30,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:19:30,727 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:19:30,750 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 (6)] Ended with exit code 0 [2025-02-05 23:19:30,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-02-05 23:19:30,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:19:30,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:19:30,928 INFO L85 PathProgramCache]: Analyzing trace with hash 39931573, now seen corresponding path program 1 times [2025-02-05 23:19:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:19:30,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397844534] [2025-02-05 23:19:30,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:19:30,929 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-02-05 23:19:30,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:19:30,931 INFO L229 MonitoredProcess]: Starting monitored process 7 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-02-05 23:19:30,932 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 (7)] Waiting until timeout for monitored process [2025-02-05 23:19:30,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 23:19:31,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 23:19:31,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:19:31,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:19:31,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 23:19:31,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:19:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-02-05 23:19:32,460 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:19:32,696 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:19:32,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397844534] [2025-02-05 23:19:32,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397844534] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:19:32,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1889442467] [2025-02-05 23:19:32,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:19:32,697 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 23:19:32,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 23:19:32,700 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 23:19:32,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-02-05 23:19:32,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 23:19:33,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 23:19:33,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:19:33,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:19:33,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 23:19:33,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:19:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 23:19:33,250 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 23:19:33,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1889442467] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 23:19:33,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 23:19:33,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2025-02-05 23:19:33,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937193153] [2025-02-05 23:19:33,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 23:19:33,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 23:19:33,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:19:33,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 23:19:33,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:19:33,252 INFO L87 Difference]: Start difference. First operand 158 states and 219 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:19:35,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 23:19:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 23:19:35,841 INFO L93 Difference]: Finished difference Result 252 states and 347 transitions. [2025-02-05 23:19:35,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 23:19:35,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2025-02-05 23:19:35,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 23:19:35,864 INFO L225 Difference]: With dead ends: 252 [2025-02-05 23:19:35,864 INFO L226 Difference]: Without dead ends: 158 [2025-02-05 23:19:35,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 23:19:35,865 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 23:19:35,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 23:19:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-05 23:19:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-05 23:19:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 91 states have (on average 1.0769230769230769) internal successors, (98), 91 states have internal predecessors, (98), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 23:19:35,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 218 transitions. [2025-02-05 23:19:35,894 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 218 transitions. Word has length 198 [2025-02-05 23:19:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 23:19:35,894 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 218 transitions. [2025-02-05 23:19:35,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-05 23:19:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 218 transitions. [2025-02-05 23:19:35,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 23:19:35,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 23:19:35,896 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 23:19:35,912 INFO L540 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 (7)] Forceful destruction successful, exit code 0 [2025-02-05 23:19:36,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-02-05 23:19:36,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 23:19:36,297 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 23:19:36,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 23:19:36,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1782741908, now seen corresponding path program 1 times [2025-02-05 23:19:36,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 23:19:36,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745461597] [2025-02-05 23:19:36,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:19:36,299 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-02-05 23:19:36,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 23:19:36,301 INFO L229 MonitoredProcess]: Starting monitored process 9 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-02-05 23:19:36,302 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 (9)] Waiting until timeout for monitored process [2025-02-05 23:19:36,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 23:19:36,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 23:19:36,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:19:36,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:19:36,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 23:19:36,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:19:37,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-02-05 23:19:37,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:19:38,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 23:19:38,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745461597] [2025-02-05 23:19:38,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745461597] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:19:38,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1238972214] [2025-02-05 23:19:38,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 23:19:38,042 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 23:19:38,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 23:19:38,043 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 23:19:38,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-02-05 23:19:38,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 23:19:39,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 23:19:39,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 23:19:39,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 23:19:39,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 23:19:39,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 23:19:40,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-02-05 23:19:40,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 23:19:40,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1238972214] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 23:19:40,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 23:19:40,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-02-05 23:19:40,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130445564] [2025-02-05 23:19:40,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 23:19:40,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 23:19:40,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 23:19:40,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 23:19:40,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-05 23:19:40,240 INFO L87 Difference]: Start difference. First operand 158 states and 218 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 23:19:44,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []