./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.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_fillercodesize_ps-cn-10_file-51.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 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:24:58,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:24:58,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:24:58,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:24:58,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:24:58,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:24:58,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:24:58,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:24:58,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:24:58,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:24:58,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:24:58,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:24:58,096 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:24:58,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:24:58,096 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:24:58,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:24:58,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:24:58,097 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:24:58,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:24:58,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:24:58,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:24:58,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:24:58,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:24:58,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:24:58,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:24:58,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:24:58,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:24:58,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:24:58,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:24:58,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:24:58,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:24:58,098 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 -> 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 [2025-02-05 21:24:58,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:24:58,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:24:58,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:24:58,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:24:58,297 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:24:58,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2025-02-05 21:24:59,462 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2866c10b5/f90ccebf26ff40cba6ecf4b558dbab67/FLAG9d68c646d [2025-02-05 21:24:59,760 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:24:59,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2025-02-05 21:24:59,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2866c10b5/f90ccebf26ff40cba6ecf4b558dbab67/FLAG9d68c646d [2025-02-05 21:25:00,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2866c10b5/f90ccebf26ff40cba6ecf4b558dbab67 [2025-02-05 21:25:00,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:25:00,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:25:00,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:25:00,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:25:00,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:25:00,044 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1308b4bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00, skipping insertion in model container [2025-02-05 21:25:00,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:25:00,161 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2025-02-05 21:25:00,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:25:00,222 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:25:00,234 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2025-02-05 21:25:00,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:25:00,264 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:25:00,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00 WrapperNode [2025-02-05 21:25:00,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:25:00,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:25:00,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:25:00,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:25:00,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,294 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2025-02-05 21:25:00,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:25:00,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:25:00,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:25:00,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:25:00,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,312 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 21:25:00,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,317 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,318 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:25:00,322 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:25:00,322 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:25:00,322 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:25:00,322 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (1/1) ... [2025-02-05 21:25:00,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:25:00,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:25:00,349 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 21:25:00,358 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 21:25:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:25:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:25:00,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:25:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:25:00,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:25:00,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:25:00,440 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:25:00,442 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:25:00,674 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 21:25:00,675 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:25:00,682 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:25:00,682 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:25:00,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:25:00 BoogieIcfgContainer [2025-02-05 21:25:00,682 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:25:00,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:25:00,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:25:00,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:25:00,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:25:00" (1/3) ... [2025-02-05 21:25:00,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3777f604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:25:00, skipping insertion in model container [2025-02-05 21:25:00,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:00" (2/3) ... [2025-02-05 21:25:00,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3777f604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:25:00, skipping insertion in model container [2025-02-05 21:25:00,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:25:00" (3/3) ... [2025-02-05 21:25:00,689 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2025-02-05 21:25:00,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:25:00,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-51.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:25:00,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:25:00,758 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;@7fdc7435, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:25:00,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:25:00,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 52 states have internal predecessors, (69), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 21:25:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:25:00,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:00,772 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:00,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:00,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:00,776 INFO L85 PathProgramCache]: Analyzing trace with hash 402816907, now seen corresponding path program 1 times [2025-02-05 21:25:00,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:25:00,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814209153] [2025-02-05 21:25:00,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:00,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:25:00,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:25:00,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:25:00,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:00,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-02-05 21:25:01,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:25:01,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814209153] [2025-02-05 21:25:01,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814209153] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:25:01,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832486292] [2025-02-05 21:25:01,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:01,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:25:01,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:25:01,074 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 21:25:01,080 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 21:25:01,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:25:01,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:25:01,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:01,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:01,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:25:01,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:25:01,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-02-05 21:25:01,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:25:01,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832486292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:25:01,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:25:01,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:25:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007092184] [2025-02-05 21:25:01,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:25:01,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:25:01,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:25:01,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:25:01,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:25:01,327 INFO L87 Difference]: Start difference. First operand has 87 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 52 states have internal predecessors, (69), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-05 21:25:01,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:25:01,356 INFO L93 Difference]: Finished difference Result 168 states and 298 transitions. [2025-02-05 21:25:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:25:01,357 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 203 [2025-02-05 21:25:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:25:01,363 INFO L225 Difference]: With dead ends: 168 [2025-02-05 21:25:01,364 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 21:25:01,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:25:01,370 INFO L435 NwaCegarLoop]: 130 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, 130 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 21:25:01,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:25:01,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 21:25:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-05 21:25:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 21:25:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2025-02-05 21:25:01,409 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 203 [2025-02-05 21:25:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:25:01,409 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2025-02-05 21:25:01,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-05 21:25:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2025-02-05 21:25:01,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:25:01,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:01,413 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:01,420 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 21:25:01,613 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 21:25:01,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:01,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:01,615 INFO L85 PathProgramCache]: Analyzing trace with hash 503980360, now seen corresponding path program 1 times [2025-02-05 21:25:01,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:25:01,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194989223] [2025-02-05 21:25:01,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:01,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:25:01,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:25:01,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:25:01,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:01,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 21:25:02,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:25:02,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194989223] [2025-02-05 21:25:02,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194989223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:25:02,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:25:02,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:25:02,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415714707] [2025-02-05 21:25:02,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:25:02,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:25:02,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:25:02,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:25:02,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:25:02,070 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 21:25:02,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:25:02,236 INFO L93 Difference]: Finished difference Result 247 states and 385 transitions. [2025-02-05 21:25:02,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:25:02,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 203 [2025-02-05 21:25:02,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:25:02,239 INFO L225 Difference]: With dead ends: 247 [2025-02-05 21:25:02,239 INFO L226 Difference]: Without dead ends: 166 [2025-02-05 21:25:02,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 21:25:02,240 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 85 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:25:02,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 366 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:25:02,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-05 21:25:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 145. [2025-02-05 21:25:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 21:25:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 225 transitions. [2025-02-05 21:25:02,263 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 225 transitions. Word has length 203 [2025-02-05 21:25:02,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:25:02,264 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 225 transitions. [2025-02-05 21:25:02,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 21:25:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 225 transitions. [2025-02-05 21:25:02,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 21:25:02,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:02,266 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:02,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:25:02,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:02,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:02,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1549111488, now seen corresponding path program 1 times [2025-02-05 21:25:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:25:02,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394907286] [2025-02-05 21:25:02,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:02,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:25:02,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 21:25:02,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 21:25:02,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:02,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:02,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 21:25:02,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:25:02,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394907286] [2025-02-05 21:25:02,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394907286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:25:02,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:25:02,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:25:02,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144581080] [2025-02-05 21:25:02,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:25:02,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:25:02,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:25:02,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:25:02,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:25:02,699 INFO L87 Difference]: Start difference. First operand 145 states and 225 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 21:25:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:25:02,964 INFO L93 Difference]: Finished difference Result 314 states and 486 transitions. [2025-02-05 21:25:02,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:25:02,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-02-05 21:25:02,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:25:02,967 INFO L225 Difference]: With dead ends: 314 [2025-02-05 21:25:02,967 INFO L226 Difference]: Without dead ends: 233 [2025-02-05 21:25:02,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:25:02,968 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 96 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:25:02,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 434 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:25:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-05 21:25:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2025-02-05 21:25:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 121 states have (on average 1.256198347107438) internal successors, (152), 121 states have internal predecessors, (152), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:25:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 350 transitions. [2025-02-05 21:25:03,023 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 350 transitions. Word has length 204 [2025-02-05 21:25:03,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:25:03,024 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 350 transitions. [2025-02-05 21:25:03,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 21:25:03,025 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 350 transitions. [2025-02-05 21:25:03,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 21:25:03,026 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:03,026 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:03,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:25:03,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:03,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:03,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2055268360, now seen corresponding path program 1 times [2025-02-05 21:25:03,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:25:03,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426415388] [2025-02-05 21:25:03,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:03,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:25:03,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 21:25:03,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 21:25:03,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:03,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:03,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 21:25:03,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:25:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426415388] [2025-02-05 21:25:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426415388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:25:03,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:25:03,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:25:03,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449528458] [2025-02-05 21:25:03,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:25:03,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:25:03,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:25:03,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:25:03,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:25:03,254 INFO L87 Difference]: Start difference. First operand 224 states and 350 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-05 21:25:03,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:25:03,491 INFO L93 Difference]: Finished difference Result 544 states and 854 transitions. [2025-02-05 21:25:03,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:25:03,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 205 [2025-02-05 21:25:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:25:03,498 INFO L225 Difference]: With dead ends: 544 [2025-02-05 21:25:03,498 INFO L226 Difference]: Without dead ends: 384 [2025-02-05 21:25:03,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 21:25:03,499 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 91 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:25:03,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 349 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:25:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-02-05 21:25:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 382. [2025-02-05 21:25:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 211 states have (on average 1.2748815165876777) internal successors, (269), 211 states have internal predecessors, (269), 165 states have call successors, (165), 5 states have call predecessors, (165), 5 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2025-02-05 21:25:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 599 transitions. [2025-02-05 21:25:03,601 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 599 transitions. Word has length 205 [2025-02-05 21:25:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:25:03,603 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 599 transitions. [2025-02-05 21:25:03,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-05 21:25:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 599 transitions. [2025-02-05 21:25:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 21:25:03,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:03,606 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:03,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:25:03,607 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:03,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:03,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1858754855, now seen corresponding path program 1 times [2025-02-05 21:25:03,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:25:03,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54608832] [2025-02-05 21:25:03,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:25:03,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 21:25:03,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 21:25:03,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:03,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 21:25:03,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:25:03,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54608832] [2025-02-05 21:25:03,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54608832] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:25:03,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:25:03,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:25:03,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268443600] [2025-02-05 21:25:03,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:25:03,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:25:03,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:25:03,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:25:03,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:25:03,792 INFO L87 Difference]: Start difference. First operand 382 states and 599 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 21:25:03,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:25:03,867 INFO L93 Difference]: Finished difference Result 710 states and 1117 transitions. [2025-02-05 21:25:03,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:25:03,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2025-02-05 21:25:03,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:25:03,871 INFO L225 Difference]: With dead ends: 710 [2025-02-05 21:25:03,872 INFO L226 Difference]: Without dead ends: 392 [2025-02-05 21:25:03,873 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 21:25:03,874 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 17 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:25:03,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 263 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:25:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-02-05 21:25:03,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 382. [2025-02-05 21:25:03,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 211 states have (on average 1.2559241706161137) internal successors, (265), 211 states have internal predecessors, (265), 165 states have call successors, (165), 5 states have call predecessors, (165), 5 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2025-02-05 21:25:03,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 595 transitions. [2025-02-05 21:25:03,933 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 595 transitions. Word has length 205 [2025-02-05 21:25:03,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:25:03,935 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 595 transitions. [2025-02-05 21:25:03,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 21:25:03,936 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 595 transitions. [2025-02-05 21:25:03,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 21:25:03,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:03,938 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:03,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:25:03,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:03,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1403983551, now seen corresponding path program 1 times [2025-02-05 21:25:03,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:25:03,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806705151] [2025-02-05 21:25:03,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:03,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:25:03,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 21:25:04,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 21:25:04,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:04,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-02-05 21:25:04,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:25:04,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806705151] [2025-02-05 21:25:04,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806705151] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:25:04,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681635851] [2025-02-05 21:25:04,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:04,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:25:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:25:04,169 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 21:25:04,172 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 21:25:04,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 21:25:04,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 21:25:04,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:04,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:04,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 21:25:04,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:25:04,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 816 proven. 72 refuted. 0 times theorem prover too weak. 1224 trivial. 0 not checked. [2025-02-05 21:25:04,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:25:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 24 proven. 72 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-02-05 21:25:04,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681635851] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:25:04,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:25:04,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-05 21:25:04,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339437932] [2025-02-05 21:25:04,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:25:04,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:25:04,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:25:04,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:25:04,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:25:04,707 INFO L87 Difference]: Start difference. First operand 382 states and 595 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) [2025-02-05 21:25:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:25:04,896 INFO L93 Difference]: Finished difference Result 572 states and 870 transitions. [2025-02-05 21:25:04,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:25:04,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) Word has length 206 [2025-02-05 21:25:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:25:04,899 INFO L225 Difference]: With dead ends: 572 [2025-02-05 21:25:04,900 INFO L226 Difference]: Without dead ends: 412 [2025-02-05 21:25:04,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:25:04,901 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 81 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:25:04,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 198 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:25:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-05 21:25:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 236. [2025-02-05 21:25:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 130 states have (on average 1.2076923076923076) internal successors, (157), 130 states have internal predecessors, (157), 99 states have call successors, (99), 6 states have call predecessors, (99), 6 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:25:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 355 transitions. [2025-02-05 21:25:04,952 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 355 transitions. Word has length 206 [2025-02-05 21:25:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:25:04,953 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 355 transitions. [2025-02-05 21:25:04,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (81), 2 states have call predecessors, (81), 4 states have return successors, (82), 3 states have call predecessors, (82), 3 states have call successors, (82) [2025-02-05 21:25:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 355 transitions. [2025-02-05 21:25:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 21:25:04,954 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:04,954 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:04,963 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 21:25:05,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:25:05,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:05,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:05,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1207470046, now seen corresponding path program 1 times [2025-02-05 21:25:05,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:25:05,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5435648] [2025-02-05 21:25:05,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:05,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:25:05,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 21:25:05,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 21:25:05,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:05,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-02-05 21:25:05,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:25:05,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5435648] [2025-02-05 21:25:05,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5435648] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:25:05,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913679426] [2025-02-05 21:25:05,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:05,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:25:05,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:25:05,635 INFO L229 MonitoredProcess]: Starting monitored process 4 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 21:25:05,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 21:25:05,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 21:25:05,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 21:25:05,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:05,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:05,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 21:25:05,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:25:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1076 proven. 42 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2025-02-05 21:25:05,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:25:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 54 proven. 42 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2025-02-05 21:25:06,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913679426] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:25:06,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:25:06,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-02-05 21:25:06,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010368270] [2025-02-05 21:25:06,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:25:06,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 21:25:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:25:06,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 21:25:06,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:25:06,126 INFO L87 Difference]: Start difference. First operand 236 states and 355 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 21:25:06,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:25:06,598 INFO L93 Difference]: Finished difference Result 452 states and 661 transitions. [2025-02-05 21:25:06,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 21:25:06,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 206 [2025-02-05 21:25:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:25:06,602 INFO L225 Difference]: With dead ends: 452 [2025-02-05 21:25:06,602 INFO L226 Difference]: Without dead ends: 367 [2025-02-05 21:25:06,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 408 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-02-05 21:25:06,604 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 155 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:25:06,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 482 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:25:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-02-05 21:25:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 254. [2025-02-05 21:25:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 145 states have (on average 1.186206896551724) internal successors, (172), 145 states have internal predecessors, (172), 99 states have call successors, (99), 9 states have call predecessors, (99), 9 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:25:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 370 transitions. [2025-02-05 21:25:06,644 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 370 transitions. Word has length 206 [2025-02-05 21:25:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:25:06,644 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 370 transitions. [2025-02-05 21:25:06,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-05 21:25:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 370 transitions. [2025-02-05 21:25:06,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-02-05 21:25:06,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:06,647 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:06,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 21:25:06,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:25:06,851 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:06,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1134414681, now seen corresponding path program 1 times [2025-02-05 21:25:06,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:25:06,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487786582] [2025-02-05 21:25:06,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:06,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:25:06,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 21:25:06,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 21:25:06,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:06,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:25:06,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732010391] [2025-02-05 21:25:06,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:06,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:25:06,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:25:06,928 INFO L229 MonitoredProcess]: Starting monitored process 5 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 21:25:06,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 21:25:06,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 21:25:07,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 21:25:07,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:07,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:25:07,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 21:25:07,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-02-05 21:25:07,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-02-05 21:25:07,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:07,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:25:07,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 21:25:07,192 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 21:25:07,193 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 21:25:07,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 21:25:07,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 21:25:07,399 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:07,497 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 21:25:07,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 09:25:07 BoogieIcfgContainer [2025-02-05 21:25:07,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 21:25:07,504 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 21:25:07,504 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 21:25:07,504 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 21:25:07,505 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:25:00" (3/4) ... [2025-02-05 21:25:07,507 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 21:25:07,507 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 21:25:07,509 INFO L158 Benchmark]: Toolchain (without parser) took 7468.95ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 131.6MB in the beginning and 176.3MB in the end (delta: -44.7MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2025-02-05 21:25:07,509 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:25:07,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.96ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 116.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 21:25:07,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.36ms. Allocated memory is still 167.8MB. Free memory was 116.7MB in the beginning and 113.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:25:07,509 INFO L158 Benchmark]: Boogie Preprocessor took 26.22ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 111.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:25:07,509 INFO L158 Benchmark]: IcfgBuilder took 360.96ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 88.8MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 21:25:07,509 INFO L158 Benchmark]: TraceAbstraction took 6819.78ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 87.9MB in the beginning and 176.4MB in the end (delta: -88.5MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2025-02-05 21:25:07,510 INFO L158 Benchmark]: Witness Printer took 3.08ms. Allocated memory is still 318.8MB. Free memory was 176.4MB in the beginning and 176.3MB in the end (delta: 97.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 21:25:07,510 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.18ms. Allocated memory is still 226.5MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 225.96ms. Allocated memory is still 167.8MB. Free memory was 131.1MB in the beginning and 116.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.36ms. Allocated memory is still 167.8MB. Free memory was 116.7MB in the beginning and 113.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.22ms. Allocated memory is still 167.8MB. Free memory was 113.9MB in the beginning and 111.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 360.96ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 88.8MB in the end (delta: 22.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6819.78ms. Allocated memory was 167.8MB in the beginning and 318.8MB in the end (delta: 151.0MB). Free memory was 87.9MB in the beginning and 176.4MB in the end (delta: -88.5MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. * Witness Printer took 3.08ms. Allocated memory is still 318.8MB. Free memory was 176.4MB in the beginning and 176.3MB in the end (delta: 97.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someUnaryDOUBLEoperation at line 37, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 83, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 181, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] float var_1_25 = -0.575; [L41] float var_1_26 = 1.5; [L42] unsigned long int var_1_27 = 64; [L43] unsigned long int var_1_28 = 2; [L44] unsigned long int var_1_29 = 25; [L45] signed long int var_1_30 = 128; [L46] signed long int var_1_31 = -5; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 64; [L49] signed char var_1_34 = -8; [L50] signed long int var_1_35 = 5; [L51] signed char var_1_36 = 10; [L52] unsigned char last_1_var_1_1 = 128; [L53] unsigned long int last_1_var_1_12 = 8; [L54] double last_1_var_1_17 = 256.8; [L55] unsigned char last_1_var_1_21 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L185] isInitial = 1 [L186] FCALL initially() [L187] COND TRUE 1 [L188] CALL updateLastVariables() [L175] last_1_var_1_1 = var_1_1 [L176] last_1_var_1_12 = var_1_12 [L177] last_1_var_1_17 = var_1_17 [L178] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L188] RET updateLastVariables() [L189] CALL updateVariables() [L122] var_1_4 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_4 >= 0.0F && 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_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L123] RET assume_abort_if_not((var_1_4 >= 0.0F && 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_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L124] var_1_5 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=2, var_1_8=-10, var_1_9=5] [L125] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=2, var_1_8=-10, var_1_9=5] [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_8=-10, var_1_9=5] [L127] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_8=-10, var_1_9=5] [L128] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=5] [L128] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=5] [L129] var_1_9 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L130] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L131] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L132] var_1_10 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L133] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L134] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L134] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L135] var_1_11 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L136] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L137] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L137] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L138] var_1_13 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L139] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L140] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L141] var_1_15 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L143] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L144] var_1_18 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L145] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L146] var_1_22 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L147] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L148] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L149] var_1_23 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L150] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L151] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L153] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L154] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L155] var_1_26 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L156] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L157] var_1_28 = __VERIFIER_nondet_ulong() [L158] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L158] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_28 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L159] RET assume_abort_if_not(var_1_28 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=-5, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L160] var_1_31 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_31 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L161] RET assume_abort_if_not(var_1_31 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L162] CALL assume_abort_if_not(var_1_31 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L162] RET assume_abort_if_not(var_1_31 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=64, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L163] var_1_33 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L164] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L165] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=5, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L166] var_1_35 = __VERIFIER_nondet_long() [L167] CALL assume_abort_if_not(var_1_35 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L167] RET assume_abort_if_not(var_1_35 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_35 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L168] RET assume_abort_if_not(var_1_35 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_35 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L169] RET assume_abort_if_not(var_1_35 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=10, var_1_7=0, var_1_8=-10, var_1_9=0] [L170] var_1_36 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_36 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L171] RET assume_abort_if_not(var_1_36 >= -127) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_36 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L172] RET assume_abort_if_not(var_1_36 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=0, var_1_29=25, var_1_30=128, var_1_31=1, var_1_32=1, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L189] RET updateVariables() [L190] CALL step() [L59] var_1_25 = var_1_26 [L60] var_1_27 = var_1_28 [L61] var_1_29 = var_1_28 [L62] var_1_30 = var_1_31 [L63] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L64] COND FALSE !(var_1_30 < (var_1_31 % var_1_35)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L69] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L70] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L71] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L72] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L79] unsigned long int stepLocal_1 = last_1_var_1_12; [L80] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L81] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L82] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L83] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L84] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L90] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=-10, var_1_9=0] [L93] COND TRUE ! (var_1_17 > var_1_5) [L94] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=0, var_1_9=0] [L98] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=0, var_1_9=0] [L99] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L110] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=0, var_1_9=0] [L112] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=0, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=0, var_1_9=0] [L113] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=0, var_1_9=0] [L116] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=0, var_1_9=0] [L190] RET step() [L191] CALL, EXPR property() [L181-L182] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=0, var_1_9=0] [L191] RET, EXPR property() [L191] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=-3221225473, var_1_17=1284/5, var_1_19=128, var_1_1=0, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2, var_1_26=2, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=-8, var_1_35=2, var_1_36=-127, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 8, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 525 mSDsluCounter, 2222 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1324 mSDsCounter, 332 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 853 IncrementalHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 332 mSolverCounterUnsat, 898 mSDtfsCounter, 853 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1076 GetRequests, 1036 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=4, InterpolantAutomatonStates: 42, 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, 7 MinimizatonAttempts, 331 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2461 NumberOfCodeBlocks, 2461 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2447 ConstructedInterpolants, 0 QuantifiedInterpolants, 5312 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1423 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 24938/25344 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 21:25:07,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercodesize_ps-cn-10_file-51.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 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:25:09,852 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:25:09,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 21:25:09,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:25:09,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:25:09,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:25:09,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:25:09,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:25:09,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:25:09,972 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:25:09,972 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:25:09,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:25:09,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:25:09,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:25:09,973 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:25:09,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:25:09,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:25:09,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:25:09,975 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:25:09,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:25:09,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:25:09,975 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 -> 31ebc7aab32916bad3f1682a2356b41139150eb4d3e5667a296140fbcfedcac2 [2025-02-05 21:25:10,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:25:10,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:25:10,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:25:10,248 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:25:10,249 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:25:10,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2025-02-05 21:25:11,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3040c40cc/a4eaf962096b4194b0d1673fedf6ff7b/FLAG1d993f1dc [2025-02-05 21:25:11,740 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:25:11,741 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2025-02-05 21:25:11,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3040c40cc/a4eaf962096b4194b0d1673fedf6ff7b/FLAG1d993f1dc [2025-02-05 21:25:11,763 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3040c40cc/a4eaf962096b4194b0d1673fedf6ff7b [2025-02-05 21:25:11,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:25:11,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:25:11,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:25:11,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:25:11,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:25:11,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:25:11" (1/1) ... [2025-02-05 21:25:11,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ce58be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:11, skipping insertion in model container [2025-02-05 21:25:11,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:25:11" (1/1) ... [2025-02-05 21:25:11,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:25:11,897 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2025-02-05 21:25:11,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:25:11,973 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:25:11,983 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_fillercodesize_ps-cn-10_file-51.i[915,928] [2025-02-05 21:25:12,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:25:12,025 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:25:12,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12 WrapperNode [2025-02-05 21:25:12,027 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:25:12,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:25:12,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:25:12,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:25:12,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,074 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-02-05 21:25:12,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:25:12,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:25:12,078 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:25:12,078 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:25:12,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,104 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 21:25:12,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:25:12,131 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:25:12,131 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:25:12,131 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:25:12,132 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (1/1) ... [2025-02-05 21:25:12,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:25:12,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:25:12,157 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 21:25:12,161 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 21:25:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:25:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 21:25:12,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:25:12,177 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:25:12,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:25:12,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:25:12,236 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:25:12,238 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:25:25,889 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 21:25:25,889 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:25:25,896 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:25:25,897 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:25:25,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:25:25 BoogieIcfgContainer [2025-02-05 21:25:25,897 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:25:25,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:25:25,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:25:25,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:25:25,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:25:11" (1/3) ... [2025-02-05 21:25:25,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a610620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:25:25, skipping insertion in model container [2025-02-05 21:25:25,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:25:12" (2/3) ... [2025-02-05 21:25:25,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a610620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:25:25, skipping insertion in model container [2025-02-05 21:25:25,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:25:25" (3/3) ... [2025-02-05 21:25:25,905 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-51.i [2025-02-05 21:25:25,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:25:25,918 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-51.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:25:25,954 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:25:25,963 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;@257a7b37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:25:25,963 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:25:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 52 states have internal predecessors, (69), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 21:25:25,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:25:25,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:25,977 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:25,977 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:25,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:25,981 INFO L85 PathProgramCache]: Analyzing trace with hash 402816907, now seen corresponding path program 1 times [2025-02-05 21:25:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:25:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270579464] [2025-02-05 21:25:25,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:25,990 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 21:25:25,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:25:25,996 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 21:25:25,997 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 21:25:26,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:25:26,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:25:26,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:26,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:26,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:25:26,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:25:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 604 proven. 0 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2025-02-05 21:25:26,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:25:26,879 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:25:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270579464] [2025-02-05 21:25:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270579464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:25:26,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:25:26,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 21:25:26,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506523460] [2025-02-05 21:25:26,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:25:26,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:25:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:25:26,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:25:26,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:25:26,894 INFO L87 Difference]: Start difference. First operand has 87 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 52 states have internal predecessors, (69), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-05 21:25:26,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:25:26,911 INFO L93 Difference]: Finished difference Result 168 states and 298 transitions. [2025-02-05 21:25:26,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:25:26,912 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 203 [2025-02-05 21:25:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:25:26,919 INFO L225 Difference]: With dead ends: 168 [2025-02-05 21:25:26,919 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 21:25:26,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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 21:25:26,923 INFO L435 NwaCegarLoop]: 130 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, 130 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 21:25:26,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:25:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 21:25:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-05 21:25:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-02-05 21:25:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2025-02-05 21:25:26,950 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 203 [2025-02-05 21:25:26,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:25:26,950 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2025-02-05 21:25:26,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-02-05 21:25:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2025-02-05 21:25:26,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-02-05 21:25:26,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:26,952 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:26,973 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 21:25:27,153 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 21:25:27,153 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:27,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:27,154 INFO L85 PathProgramCache]: Analyzing trace with hash 503980360, now seen corresponding path program 1 times [2025-02-05 21:25:27,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:25:27,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927669750] [2025-02-05 21:25:27,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:27,155 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 21:25:27,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:25:27,159 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 21:25:27,160 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 21:25:27,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-02-05 21:25:28,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-02-05 21:25:28,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:28,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:28,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 21:25:28,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:25:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 21:25:31,794 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:25:31,794 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:25:31,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927669750] [2025-02-05 21:25:31,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927669750] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:25:31,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:25:31,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:25:31,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951035262] [2025-02-05 21:25:31,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:25:31,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:25:31,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:25:31,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:25:31,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:25:31,796 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 21:25:36,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:25:40,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:25:44,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:25:48,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:25:53,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:25:57,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:25:57,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:25:57,152 INFO L93 Difference]: Finished difference Result 247 states and 385 transitions. [2025-02-05 21:25:57,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:25:57,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 203 [2025-02-05 21:25:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:25:57,238 INFO L225 Difference]: With dead ends: 247 [2025-02-05 21:25:57,238 INFO L226 Difference]: Without dead ends: 166 [2025-02-05 21:25:57,239 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:25:57,239 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 82 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 67 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:25:57,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 367 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 25.3s Time] [2025-02-05 21:25:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-02-05 21:25:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 145. [2025-02-05 21:25:57,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-05 21:25:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 225 transitions. [2025-02-05 21:25:57,274 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 225 transitions. Word has length 203 [2025-02-05 21:25:57,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:25:57,275 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 225 transitions. [2025-02-05 21:25:57,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 21:25:57,275 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 225 transitions. [2025-02-05 21:25:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-02-05 21:25:57,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:57,277 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:25:57,300 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 21:25:57,478 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 21:25:57,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:57,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1549111488, now seen corresponding path program 1 times [2025-02-05 21:25:57,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:25:57,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289129828] [2025-02-05 21:25:57,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:57,480 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 21:25:57,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:25:57,485 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 21:25:57,487 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 21:25:57,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-02-05 21:25:58,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-02-05 21:25:58,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:58,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:58,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 21:25:58,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:26:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 21:26:02,278 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:26:02,278 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:26:02,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289129828] [2025-02-05 21:26:02,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289129828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:26:02,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:26:02,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:26:02,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745332362] [2025-02-05 21:26:02,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:26:02,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:26:02,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:26:02,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:26:02,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:26:02,281 INFO L87 Difference]: Start difference. First operand 145 states and 225 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 21:26:07,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:26:11,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:26:15,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:26:19,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:26:23,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:26:28,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:26:32,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:26:36,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:26:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:26:36,449 INFO L93 Difference]: Finished difference Result 314 states and 486 transitions. [2025-02-05 21:26:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:26:36,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 204 [2025-02-05 21:26:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:26:36,533 INFO L225 Difference]: With dead ends: 314 [2025-02-05 21:26:36,533 INFO L226 Difference]: Without dead ends: 233 [2025-02-05 21:26:36,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:26:36,534 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 92 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 67 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:26:36,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 434 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 86 Invalid, 8 Unknown, 0 Unchecked, 33.9s Time] [2025-02-05 21:26:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-05 21:26:36,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2025-02-05 21:26:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 121 states have (on average 1.256198347107438) internal successors, (152), 121 states have internal predecessors, (152), 99 states have call successors, (99), 3 states have call predecessors, (99), 3 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-02-05 21:26:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 350 transitions. [2025-02-05 21:26:36,569 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 350 transitions. Word has length 204 [2025-02-05 21:26:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:26:36,569 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 350 transitions. [2025-02-05 21:26:36,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 21:26:36,570 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 350 transitions. [2025-02-05 21:26:36,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 21:26:36,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:26:36,571 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:26:36,597 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 21:26:36,772 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 21:26:36,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:26:36,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:26:36,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2055268360, now seen corresponding path program 1 times [2025-02-05 21:26:36,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:26:36,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587276980] [2025-02-05 21:26:36,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:26:36,774 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 21:26:36,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:26:36,775 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 21:26:36,777 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 21:26:36,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 21:26:37,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 21:26:37,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:26:37,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:26:37,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 21:26:37,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:26:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-02-05 21:26:37,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:26:37,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:26:37,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587276980] [2025-02-05 21:26:37,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587276980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:26:37,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:26:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:26:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278382176] [2025-02-05 21:26:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:26:37,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:26:37,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:26:37,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:26:37,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:26:37,697 INFO L87 Difference]: Start difference. First operand 224 states and 350 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-02-05 21:26:40,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []