./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.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-47.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 bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:24:30,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:24:30,390 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:30,394 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:24:30,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:24:30,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:24:30,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:24:30,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:24:30,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:24:30,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:24:30,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:24:30,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:24:30,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:24:30,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:24:30,418 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:24:30,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:24:30,418 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:24:30,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:24:30,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:24:30,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:24:30,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:24:30,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:24:30,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:24:30,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:24:30,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:24:30,419 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:24:30,419 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:24:30,419 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:24:30,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:24:30,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:24:30,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:24:30,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:24:30,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:24:30,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:24:30,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:24:30,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:24:30,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:24:30,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:24:30,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:24:30,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:24:30,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:24:30,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:24:30,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:24:30,421 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 -> bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 [2025-02-05 21:24:30,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:24:30,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:24:30,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:24:30,668 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:24:30,668 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:24:30,670 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-47.i [2025-02-05 21:24:31,871 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6d59f112/333ad2ca64084928be3b74384e275119/FLAG4de52770b [2025-02-05 21:24:32,149 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:24:32,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-02-05 21:24:32,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6d59f112/333ad2ca64084928be3b74384e275119/FLAG4de52770b [2025-02-05 21:24:32,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6d59f112/333ad2ca64084928be3b74384e275119 [2025-02-05 21:24:32,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:24:32,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:24:32,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:24:32,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:24:32,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:24:32,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d7f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32, skipping insertion in model container [2025-02-05 21:24:32,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:24:32,574 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-47.i[915,928] [2025-02-05 21:24:32,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:24:32,629 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:24:32,636 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-47.i[915,928] [2025-02-05 21:24:32,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:24:32,695 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:24:32,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32 WrapperNode [2025-02-05 21:24:32,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:24:32,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:24:32,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:24:32,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:24:32,701 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:24:32" (1/1) ... [2025-02-05 21:24:32,713 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:24:32" (1/1) ... [2025-02-05 21:24:32,743 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2025-02-05 21:24:32,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:24:32,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:24:32,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:24:32,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:24:32,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,782 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:24:32,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:24:32,806 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:24:32,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:24:32,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:24:32,811 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32" (1/1) ... [2025-02-05 21:24:32,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:24:32,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:24:32,834 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:24:32,840 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:24:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:24:32,853 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:24:32,853 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:24:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:24:32,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:24:32,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:24:32,923 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:24:32,924 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:24:33,207 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L165: havoc property_#t~bitwise24#1;havoc property_#t~ite26#1;havoc property_#t~bitwise25#1;havoc property_#t~short27#1; [2025-02-05 21:24:33,230 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-05 21:24:33,231 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:24:33,247 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:24:33,248 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:24:33,248 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:24:33 BoogieIcfgContainer [2025-02-05 21:24:33,248 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:24:33,250 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:24:33,250 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:24:33,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:24:33,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:24:32" (1/3) ... [2025-02-05 21:24:33,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75df7be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:24:33, skipping insertion in model container [2025-02-05 21:24:33,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:32" (2/3) ... [2025-02-05 21:24:33,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75df7be2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:24:33, skipping insertion in model container [2025-02-05 21:24:33,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:24:33" (3/3) ... [2025-02-05 21:24:33,255 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-02-05 21:24:33,264 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:24:33,265 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:24:33,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:24:33,306 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6765b964, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:24:33,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:24:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 21:24:33,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 21:24:33,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:24:33,319 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:33,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:24:33,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:24:33,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1122147310, now seen corresponding path program 1 times [2025-02-05 21:24:33,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:24:33,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875365928] [2025-02-05 21:24:33,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:24:33,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 21:24:33,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 21:24:33,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:33,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-02-05 21:24:33,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:24:33,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875365928] [2025-02-05 21:24:33,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875365928] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:24:33,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017104004] [2025-02-05 21:24:33,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:33,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:24:33,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:24:33,527 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:24:33,529 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:24:33,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 21:24:33,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 21:24:33,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:33,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:33,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:24:33,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:24:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-02-05 21:24:33,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:24:33,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017104004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:24:33,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:24:33,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:24:33,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675329759] [2025-02-05 21:24:33,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:24:33,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:24:33,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:24:33,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:24:33,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:24:33,740 INFO L87 Difference]: Start difference. First operand has 103 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 21:24:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:24:33,772 INFO L93 Difference]: Finished difference Result 200 states and 344 transitions. [2025-02-05 21:24:33,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:24:33,774 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2025-02-05 21:24:33,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:24:33,779 INFO L225 Difference]: With dead ends: 200 [2025-02-05 21:24:33,780 INFO L226 Difference]: Without dead ends: 100 [2025-02-05 21:24:33,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 188 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:24:33,786 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:24:33,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:24:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-05 21:24:33,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-05 21:24:33,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 21:24:33,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2025-02-05 21:24:33,825 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 187 [2025-02-05 21:24:33,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:24:33,826 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2025-02-05 21:24:33,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 21:24:33,826 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2025-02-05 21:24:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 21:24:33,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:24:33,831 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:33,839 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:24:34,031 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:24:34,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:24:34,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:24:34,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2008135058, now seen corresponding path program 1 times [2025-02-05 21:24:34,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:24:34,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483572419] [2025-02-05 21:24:34,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:34,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:24:34,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:24:34,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:24:34,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:34,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 21:24:34,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:24:34,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483572419] [2025-02-05 21:24:34,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483572419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:24:34,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:24:34,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:24:34,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123439370] [2025-02-05 21:24:34,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:24:34,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:24:34,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:24:34,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:24:34,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:24:34,779 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:24:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:24:35,153 INFO L93 Difference]: Finished difference Result 423 states and 639 transitions. [2025-02-05 21:24:35,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:24:35,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2025-02-05 21:24:35,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:24:35,156 INFO L225 Difference]: With dead ends: 423 [2025-02-05 21:24:35,159 INFO L226 Difference]: Without dead ends: 326 [2025-02-05 21:24:35,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:24:35,160 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 316 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:24:35,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 570 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:24:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2025-02-05 21:24:35,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 207. [2025-02-05 21:24:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.3493150684931507) internal successors, (197), 146 states have internal predecessors, (197), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 21:24:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 313 transitions. [2025-02-05 21:24:35,199 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 313 transitions. Word has length 188 [2025-02-05 21:24:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:24:35,199 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 313 transitions. [2025-02-05 21:24:35,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:24:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 313 transitions. [2025-02-05 21:24:35,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 21:24:35,203 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:24:35,204 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:35,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:24:35,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:24:35,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:24:35,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1163663187, now seen corresponding path program 1 times [2025-02-05 21:24:35,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:24:35,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935234797] [2025-02-05 21:24:35,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:35,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:24:35,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 21:24:35,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 21:24:35,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:35,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:35,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 21:24:35,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:24:35,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935234797] [2025-02-05 21:24:35,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935234797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:24:35,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:24:35,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:24:35,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666095456] [2025-02-05 21:24:35,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:24:35,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:24:35,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:24:35,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:24:35,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:24:35,619 INFO L87 Difference]: Start difference. First operand 207 states and 313 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:24:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:24:35,842 INFO L93 Difference]: Finished difference Result 402 states and 605 transitions. [2025-02-05 21:24:35,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:24:35,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 188 [2025-02-05 21:24:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:24:35,845 INFO L225 Difference]: With dead ends: 402 [2025-02-05 21:24:35,845 INFO L226 Difference]: Without dead ends: 198 [2025-02-05 21:24:35,846 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:24:35,846 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 97 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:24:35,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 405 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:24:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-05 21:24:35,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 167. [2025-02-05 21:24:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 106 states have (on average 1.2735849056603774) internal successors, (135), 106 states have internal predecessors, (135), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 21:24:35,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 251 transitions. [2025-02-05 21:24:35,889 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 251 transitions. Word has length 188 [2025-02-05 21:24:35,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:24:35,889 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 251 transitions. [2025-02-05 21:24:35,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:24:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 251 transitions. [2025-02-05 21:24:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 21:24:35,891 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:24:35,891 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:35,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:24:35,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:24:35,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:24:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -200014287, now seen corresponding path program 1 times [2025-02-05 21:24:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:24:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764813516] [2025-02-05 21:24:35,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:24:35,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 21:24:35,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 21:24:35,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:35,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 21:24:36,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:24:36,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764813516] [2025-02-05 21:24:36,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764813516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:24:36,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:24:36,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:24:36,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987242778] [2025-02-05 21:24:36,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:24:36,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:24:36,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:24:36,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:24:36,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:24:36,185 INFO L87 Difference]: Start difference. First operand 167 states and 251 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:24:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:24:36,649 INFO L93 Difference]: Finished difference Result 473 states and 715 transitions. [2025-02-05 21:24:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:24:36,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2025-02-05 21:24:36,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:24:36,653 INFO L225 Difference]: With dead ends: 473 [2025-02-05 21:24:36,654 INFO L226 Difference]: Without dead ends: 376 [2025-02-05 21:24:36,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:24:36,657 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 179 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:24:36,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 643 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:24:36,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-05 21:24:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 304. [2025-02-05 21:24:36,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 213 states have (on average 1.3145539906103287) internal successors, (280), 213 states have internal predecessors, (280), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-02-05 21:24:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 454 transitions. [2025-02-05 21:24:36,718 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 454 transitions. Word has length 190 [2025-02-05 21:24:36,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:24:36,718 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 454 transitions. [2025-02-05 21:24:36,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:24:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 454 transitions. [2025-02-05 21:24:36,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 21:24:36,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:24:36,721 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:36,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:24:36,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:24:36,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:24:36,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1605475855, now seen corresponding path program 1 times [2025-02-05 21:24:36,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:24:36,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608179817] [2025-02-05 21:24:36,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:24:36,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 21:24:36,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 21:24:36,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:36,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 21:24:36,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:24:36,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608179817] [2025-02-05 21:24:36,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608179817] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:24:36,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:24:36,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:24:36,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255838670] [2025-02-05 21:24:36,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:24:36,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:24:36,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:24:36,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:24:36,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:24:36,963 INFO L87 Difference]: Start difference. First operand 304 states and 454 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:24:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:24:37,282 INFO L93 Difference]: Finished difference Result 821 states and 1231 transitions. [2025-02-05 21:24:37,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:24:37,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2025-02-05 21:24:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:24:37,287 INFO L225 Difference]: With dead ends: 821 [2025-02-05 21:24:37,287 INFO L226 Difference]: Without dead ends: 602 [2025-02-05 21:24:37,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:24:37,288 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 294 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:24:37,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 662 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:24:37,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-02-05 21:24:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 431. [2025-02-05 21:24:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 328 states have (on average 1.353658536585366) internal successors, (444), 329 states have internal predecessors, (444), 97 states have call successors, (97), 5 states have call predecessors, (97), 5 states have return successors, (97), 96 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 21:24:37,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 638 transitions. [2025-02-05 21:24:37,357 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 638 transitions. Word has length 191 [2025-02-05 21:24:37,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:24:37,357 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 638 transitions. [2025-02-05 21:24:37,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:24:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 638 transitions. [2025-02-05 21:24:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 21:24:37,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:24:37,359 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:37,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:24:37,361 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:24:37,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:24:37,363 INFO L85 PathProgramCache]: Analyzing trace with hash 331576460, now seen corresponding path program 1 times [2025-02-05 21:24:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:24:37,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090304900] [2025-02-05 21:24:37,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:37,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:24:37,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 21:24:37,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 21:24:37,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:37,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 114 proven. 120 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2025-02-05 21:24:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:24:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090304900] [2025-02-05 21:24:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090304900] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:24:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940279853] [2025-02-05 21:24:38,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:38,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:24:38,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:24:38,311 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:24:38,312 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:24:38,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 21:24:38,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 21:24:38,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:38,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:38,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 21:24:38,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:24:39,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 885 proven. 186 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-02-05 21:24:39,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:24:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 114 proven. 129 refuted. 0 times theorem prover too weak. 1381 trivial. 0 not checked. [2025-02-05 21:24:41,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940279853] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:24:41,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:24:41,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 36 [2025-02-05 21:24:41,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854811656] [2025-02-05 21:24:41,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:24:41,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 21:24:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:24:41,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 21:24:41,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 21:24:41,011 INFO L87 Difference]: Start difference. First operand 431 states and 638 transitions. Second operand has 36 states, 34 states have (on average 4.705882352941177) internal successors, (160), 32 states have internal predecessors, (160), 13 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 13 states have call predecessors, (87), 13 states have call successors, (87) [2025-02-05 21:24:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:24:45,314 INFO L93 Difference]: Finished difference Result 1159 states and 1632 transitions. [2025-02-05 21:24:45,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-02-05 21:24:45,315 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 4.705882352941177) internal successors, (160), 32 states have internal predecessors, (160), 13 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 13 states have call predecessors, (87), 13 states have call successors, (87) Word has length 191 [2025-02-05 21:24:45,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:24:45,322 INFO L225 Difference]: With dead ends: 1159 [2025-02-05 21:24:45,322 INFO L226 Difference]: Without dead ends: 815 [2025-02-05 21:24:45,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3639 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2515, Invalid=9041, Unknown=0, NotChecked=0, Total=11556 [2025-02-05 21:24:45,326 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 1292 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 3415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 763 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:24:45,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1737 Invalid, 3415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [763 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 21:24:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-02-05 21:24:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 611. [2025-02-05 21:24:45,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 456 states have (on average 1.2675438596491229) internal successors, (578), 459 states have internal predecessors, (578), 128 states have call successors, (128), 26 states have call predecessors, (128), 26 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-05 21:24:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 834 transitions. [2025-02-05 21:24:45,392 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 834 transitions. Word has length 191 [2025-02-05 21:24:45,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:24:45,393 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 834 transitions. [2025-02-05 21:24:45,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 4.705882352941177) internal successors, (160), 32 states have internal predecessors, (160), 13 states have call successors, (87), 6 states have call predecessors, (87), 12 states have return successors, (87), 13 states have call predecessors, (87), 13 states have call successors, (87) [2025-02-05 21:24:45,393 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 834 transitions. [2025-02-05 21:24:45,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 21:24:45,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:24:45,396 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:45,403 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:24:45,597 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:24:45,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:24:45,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:24:45,598 INFO L85 PathProgramCache]: Analyzing trace with hash -352332815, now seen corresponding path program 1 times [2025-02-05 21:24:45,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:24:45,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940050941] [2025-02-05 21:24:45,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:24:45,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 21:24:45,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 21:24:45,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:45,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 21:24:45,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:24:45,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940050941] [2025-02-05 21:24:45,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940050941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:24:45,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:24:45,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:24:45,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30925917] [2025-02-05 21:24:45,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:24:45,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:24:45,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:24:45,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:24:45,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:24:45,739 INFO L87 Difference]: Start difference. First operand 611 states and 834 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:24:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:24:45,893 INFO L93 Difference]: Finished difference Result 1138 states and 1570 transitions. [2025-02-05 21:24:45,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:24:45,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2025-02-05 21:24:45,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:24:45,900 INFO L225 Difference]: With dead ends: 1138 [2025-02-05 21:24:45,900 INFO L226 Difference]: Without dead ends: 896 [2025-02-05 21:24:45,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:24:45,902 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 129 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:24:45,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 575 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:24:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2025-02-05 21:24:45,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 678. [2025-02-05 21:24:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 523 states have (on average 1.2638623326959848) internal successors, (661), 526 states have internal predecessors, (661), 128 states have call successors, (128), 26 states have call predecessors, (128), 26 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-05 21:24:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 917 transitions. [2025-02-05 21:24:45,965 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 917 transitions. Word has length 192 [2025-02-05 21:24:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:24:45,966 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 917 transitions. [2025-02-05 21:24:45,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:24:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 917 transitions. [2025-02-05 21:24:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-05 21:24:45,967 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:24:45,967 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:45,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:24:45,968 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:24:45,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:24:45,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1514404679, now seen corresponding path program 1 times [2025-02-05 21:24:45,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:24:45,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310831658] [2025-02-05 21:24:45,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:45,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:24:45,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 21:24:46,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 21:24:46,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:46,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-02-05 21:24:46,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:24:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310831658] [2025-02-05 21:24:46,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310831658] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:24:46,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535308310] [2025-02-05 21:24:46,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:46,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:24:46,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:24:46,285 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:24:46,287 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:24:46,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-05 21:24:46,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-05 21:24:46,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:46,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:46,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 21:24:46,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:24:47,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 268 proven. 150 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2025-02-05 21:24:47,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:24:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-02-05 21:24:47,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535308310] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:24:47,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:24:47,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 6] total 19 [2025-02-05 21:24:47,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963773859] [2025-02-05 21:24:47,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:24:47,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 21:24:47,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:24:47,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 21:24:47,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-02-05 21:24:47,415 INFO L87 Difference]: Start difference. First operand 678 states and 917 transitions. Second operand has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) [2025-02-05 21:24:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:24:48,145 INFO L93 Difference]: Finished difference Result 1185 states and 1603 transitions. [2025-02-05 21:24:48,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 21:24:48,146 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) Word has length 192 [2025-02-05 21:24:48,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:24:48,149 INFO L225 Difference]: With dead ends: 1185 [2025-02-05 21:24:48,150 INFO L226 Difference]: Without dead ends: 610 [2025-02-05 21:24:48,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=517, Unknown=0, NotChecked=0, Total=702 [2025-02-05 21:24:48,152 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 155 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:24:48,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1083 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:24:48,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-02-05 21:24:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 585. [2025-02-05 21:24:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 430 states have (on average 1.241860465116279) internal successors, (534), 433 states have internal predecessors, (534), 128 states have call successors, (128), 26 states have call predecessors, (128), 26 states have return successors, (128), 125 states have call predecessors, (128), 128 states have call successors, (128) [2025-02-05 21:24:48,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 790 transitions. [2025-02-05 21:24:48,205 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 790 transitions. Word has length 192 [2025-02-05 21:24:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:24:48,206 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 790 transitions. [2025-02-05 21:24:48,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 18 states have internal predecessors, (126), 7 states have call successors, (87), 4 states have call predecessors, (87), 7 states have return successors, (87), 7 states have call predecessors, (87), 7 states have call successors, (87) [2025-02-05 21:24:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 790 transitions. [2025-02-05 21:24:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 21:24:48,207 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:24:48,207 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:48,217 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:24:48,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:24:48,408 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:24:48,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:24:48,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1279269518, now seen corresponding path program 1 times [2025-02-05 21:24:48,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:24:48,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380789438] [2025-02-05 21:24:48,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:48,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:24:48,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 21:24:48,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 21:24:48,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:48,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 66 proven. 168 refuted. 0 times theorem prover too weak. 1390 trivial. 0 not checked. [2025-02-05 21:24:48,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:24:48,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380789438] [2025-02-05 21:24:48,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380789438] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:24:48,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111200997] [2025-02-05 21:24:48,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:48,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:24:48,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:24:48,902 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:24:48,904 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:24:48,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 21:24:48,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 21:24:48,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:48,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:48,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-05 21:24:49,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:24:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 885 proven. 186 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-02-05 21:24:49,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:24:50,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111200997] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:24:50,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:24:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 18 [2025-02-05 21:24:50,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630514548] [2025-02-05 21:24:50,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 21:24:50,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-05 21:24:50,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:24:50,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-05 21:24:50,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2025-02-05 21:24:50,372 INFO L87 Difference]: Start difference. First operand 585 states and 790 transitions. Second operand has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2025-02-05 21:24:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:24:51,793 INFO L93 Difference]: Finished difference Result 1204 states and 1603 transitions. [2025-02-05 21:24:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-02-05 21:24:51,793 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) Word has length 193 [2025-02-05 21:24:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:24:51,797 INFO L225 Difference]: With dead ends: 1204 [2025-02-05 21:24:51,797 INFO L226 Difference]: Without dead ends: 955 [2025-02-05 21:24:51,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=2679, Unknown=0, NotChecked=0, Total=3540 [2025-02-05 21:24:51,799 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 726 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:24:51,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 753 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:24:51,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2025-02-05 21:24:51,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 678. [2025-02-05 21:24:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 485 states have (on average 1.1958762886597938) internal successors, (580), 488 states have internal predecessors, (580), 155 states have call successors, (155), 37 states have call predecessors, (155), 37 states have return successors, (155), 152 states have call predecessors, (155), 155 states have call successors, (155) [2025-02-05 21:24:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 890 transitions. [2025-02-05 21:24:51,864 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 890 transitions. Word has length 193 [2025-02-05 21:24:51,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:24:51,864 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 890 transitions. [2025-02-05 21:24:51,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.166666666666667) internal successors, (93), 16 states have internal predecessors, (93), 6 states have call successors, (55), 5 states have call predecessors, (55), 7 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2025-02-05 21:24:51,864 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 890 transitions. [2025-02-05 21:24:51,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 21:24:51,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:24:51,866 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:51,874 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:24:52,070 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,SelfDestructingSolverStorable8 [2025-02-05 21:24:52,070 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:24:52,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:24:52,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1272004322, now seen corresponding path program 1 times [2025-02-05 21:24:52,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:24:52,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451337443] [2025-02-05 21:24:52,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:52,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:24:52,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 21:24:52,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 21:24:52,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:52,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:24:52,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824672792] [2025-02-05 21:24:52,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:52,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:24:52,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:24:52,138 INFO L229 MonitoredProcess]: Starting monitored process 6 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:24:52,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 21:24:52,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 21:24:52,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 21:24:52,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:52,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:24:52,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 21:24:52,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:24:52,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-02-05 21:24:52,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:24:53,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:24:53,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451337443] [2025-02-05 21:24:53,042 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 21:24:53,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824672792] [2025-02-05 21:24:53,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824672792] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:24:53,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:24:53,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-02-05 21:24:53,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030442014] [2025-02-05 21:24:53,042 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 21:24:53,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:24:53,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:24:53,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:24:53,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:24:53,043 INFO L87 Difference]: Start difference. First operand 678 states and 890 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 21:24:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:24:53,318 INFO L93 Difference]: Finished difference Result 1271 states and 1669 transitions. [2025-02-05 21:24:53,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:24:53,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 193 [2025-02-05 21:24:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:24:53,322 INFO L225 Difference]: With dead ends: 1271 [2025-02-05 21:24:53,322 INFO L226 Difference]: Without dead ends: 696 [2025-02-05 21:24:53,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:24:53,324 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 95 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:24:53,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 456 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:24:53,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-02-05 21:24:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 680. [2025-02-05 21:24:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 487 states have (on average 1.1950718685831623) internal successors, (582), 490 states have internal predecessors, (582), 155 states have call successors, (155), 37 states have call predecessors, (155), 37 states have return successors, (155), 152 states have call predecessors, (155), 155 states have call successors, (155) [2025-02-05 21:24:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 892 transitions. [2025-02-05 21:24:53,388 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 892 transitions. Word has length 193 [2025-02-05 21:24:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:24:53,389 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 892 transitions. [2025-02-05 21:24:53,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (29), 2 states have call predecessors, (29), 3 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 21:24:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 892 transitions. [2025-02-05 21:24:53,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-05 21:24:53,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:24:53,392 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:53,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 21:24:53,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 21:24:53,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:24:53,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:24:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2135459293, now seen corresponding path program 1 times [2025-02-05 21:24:53,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:24:53,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958226886] [2025-02-05 21:24:53,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:53,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:24:53,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 21:24:53,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 21:24:53,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:53,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 21:24:53,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [359515430] [2025-02-05 21:24:53,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:24:53,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:24:53,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:24:53,673 INFO L229 MonitoredProcess]: Starting monitored process 7 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:24:53,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 21:24:53,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 21:24:53,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 21:24:53,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:53,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:24:53,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 21:24:53,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-05 21:24:53,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-05 21:24:53,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:24:53,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 21:24:53,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 21:24:53,941 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 21:24:53,942 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 21:24:53,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 21:24:54,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 21:24:54,147 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 21:24:54,263 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 21:24:54,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 09:24:54 BoogieIcfgContainer [2025-02-05 21:24:54,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 21:24:54,268 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 21:24:54,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 21:24:54,269 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 21:24:54,269 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:24:33" (3/4) ... [2025-02-05 21:24:54,271 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 21:24:54,271 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 21:24:54,272 INFO L158 Benchmark]: Toolchain (without parser) took 21815.88ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 122.9MB in the beginning and 382.5MB in the end (delta: -259.6MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2025-02-05 21:24:54,272 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 209.7MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:24:54,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.18ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 107.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 21:24:54,273 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.55ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 102.6MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:24:54,273 INFO L158 Benchmark]: Boogie Preprocessor took 57.49ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 97.0MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 21:24:54,273 INFO L158 Benchmark]: IcfgBuilder took 442.46ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 66.5MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-05 21:24:54,273 INFO L158 Benchmark]: TraceAbstraction took 21018.47ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 65.6MB in the beginning and 382.6MB in the end (delta: -317.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:24:54,273 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 478.2MB. Free memory was 382.6MB in the beginning and 382.5MB in the end (delta: 152.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 21:24:54,275 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 209.7MB. Free memory is still 128.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.18ms. Allocated memory is still 167.8MB. Free memory was 122.5MB in the beginning and 107.2MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.55ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 102.6MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.49ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 97.0MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 442.46ms. Allocated memory is still 167.8MB. Free memory was 97.0MB in the beginning and 66.5MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 21018.47ms. Allocated memory was 167.8MB in the beginning and 478.2MB in the end (delta: 310.4MB). Free memory was 65.6MB in the beginning and 382.6MB in the end (delta: -317.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 478.2MB. Free memory was 382.6MB in the beginning and 382.5MB in the end (delta: 152.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of bitwiseOr at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 113, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] double var_1_23 = 100.75; [L42] double var_1_24 = 128.8; [L43] signed short int var_1_25 = -4; [L44] signed short int var_1_26 = 256; [L45] unsigned long int var_1_27 = 100000000; [L46] unsigned long int var_1_28 = 5; [L47] unsigned char var_1_29 = 8; [L48] unsigned char var_1_30 = 8; [L49] signed long int var_1_31 = 200; [L50] double var_1_32 = 8.25; [L51] double var_1_33 = 15.5; [L52] unsigned char last_1_var_1_8 = 64; [L53] unsigned char last_1_var_1_19 = 1; [L54] unsigned short int last_1_var_1_20 = 256; [L55] unsigned long int last_1_var_1_22 = 64; VAL [isInitial=0, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L159] last_1_var_1_8 = var_1_8 [L160] last_1_var_1_19 = var_1_19 [L161] last_1_var_1_20 = var_1_20 [L162] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_3=7/8, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L172] RET updateLastVariables() [L173] CALL updateVariables() [L111] var_1_3 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L112] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L113] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L113] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L114] var_1_4 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L115] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L116] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L116] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L117] var_1_5 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L118] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_6=10, var_1_8=64, var_1_9=5] [L119] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L119] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L120] var_1_6 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_8=64, var_1_9=5] [L121] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_8=64, var_1_9=5] [L122] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=5] [L122] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=5] [L123] var_1_9 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64] [L124] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64] [L125] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L125] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L126] var_1_11 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L127] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L128] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L128] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L129] var_1_13 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L130] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L131] var_1_14 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L132] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L133] var_1_15 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L134] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L135] var_1_17 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L136] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L137] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L137] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L138] var_1_18 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L139] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L140] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L140] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L141] var_1_21 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L142] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L143] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L143] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_24=644/5, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L144] var_1_24 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L145] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=256, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L146] var_1_26 = __VERIFIER_nondet_short() [L147] CALL assume_abort_if_not(var_1_26 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L147] RET assume_abort_if_not(var_1_26 >= -32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L148] CALL assume_abort_if_not(var_1_26 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L148] RET assume_abort_if_not(var_1_26 <= 32766) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=5, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L149] var_1_28 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L150] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L151] CALL assume_abort_if_not(var_1_28 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L151] RET assume_abort_if_not(var_1_28 <= 4294967294) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L152] var_1_30 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L153] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L154] CALL assume_abort_if_not(var_1_30 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L154] RET assume_abort_if_not(var_1_30 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_32=33/4, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L155] var_1_32 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L156] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=403/4, var_1_25=-4, var_1_26=-32767, var_1_27=100000000, var_1_28=0, var_1_29=8, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L173] RET updateVariables() [L174] CALL step() [L59] var_1_23 = var_1_24 [L60] var_1_25 = var_1_26 [L61] var_1_27 = var_1_28 [L62] var_1_29 = var_1_30 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=200, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L63] COND TRUE (var_1_23 + (- var_1_24)) == var_1_32 [L64] var_1_31 = var_1_26 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=31/2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L66] var_1_33 = var_1_24 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L67] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L68] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L72] unsigned short int stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_0=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L73] COND FALSE !(stepLocal_0 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L78] unsigned short int stepLocal_2 = var_1_4; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_2=114686, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L79] COND TRUE var_1_8 <= stepLocal_2 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L80] COND TRUE \read(var_1_16) [L81] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L88] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L89] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L95] COND TRUE var_1_12 >= (1.3 / var_1_3) [L96] var_1_1 = ((var_1_4 - var_1_8) - var_1_8) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L100] unsigned char stepLocal_1 = var_1_1 < 64; VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L101] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, stepLocal_1=0, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L102] COND TRUE stepLocal_1 || var_1_16 [L103] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L106] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L106] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L106] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L165-L166] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=49022, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_23=2, var_1_24=2, var_1_25=-32767, var_1_26=-32767, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32767, var_1_33=2, var_1_4=114686, var_1_5=0, var_1_6=32767, var_1_8=64, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.9s, OverallIterations: 11, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3297 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3283 mSDsluCounter, 7031 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5293 mSDsCounter, 1419 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5678 IncrementalHoareTripleChecker+Invalid, 7097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1419 mSolverCounterUnsat, 1738 mSDtfsCounter, 5678 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1809 GetRequests, 1587 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4733 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=680occurred in iteration=10, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 1133 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 3247 NumberOfCodeBlocks, 3247 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3035 ConstructedInterpolants, 0 QuantifiedInterpolants, 19116 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2221 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 24755/25984 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:24:54,321 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-47.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 bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:24:56,213 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:24:56,298 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:24:56,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:24:56,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:24:56,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:24:56,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:24:56,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:24:56,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:24:56,326 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:24:56,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:24:56,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:24:56,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:24:56,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:24:56,327 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:24:56,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:24:56,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:24:56,328 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:24:56,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:24:56,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:24:56,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:24:56,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:24:56,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:24:56,328 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 21:24:56,328 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 21:24:56,328 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 21:24:56,328 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:24:56,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:24:56,329 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:24:56,329 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:24:56,329 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:24:56,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:24:56,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:24:56,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:24:56,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:24:56,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:24:56,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:24:56,330 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:24:56,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:24:56,330 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 21:24:56,330 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 21:24:56,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:24:56,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:24:56,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:24:56,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:24:56,331 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 -> bf9f09673f1bfd740897bdbd2592cb1cb4e782c40f9cb252e0019f5976520119 [2025-02-05 21:24:56,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:24:56,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:24:56,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:24:56,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:24:56,620 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:24:56,621 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-47.i [2025-02-05 21:24:57,872 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75a773e31/1d5f99505e844e2094c62af56e9ed6ac/FLAGa68f564e7 [2025-02-05 21:24:58,134 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:24:58,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-02-05 21:24:58,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75a773e31/1d5f99505e844e2094c62af56e9ed6ac/FLAGa68f564e7 [2025-02-05 21:24:58,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75a773e31/1d5f99505e844e2094c62af56e9ed6ac [2025-02-05 21:24:58,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:24:58,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:24:58,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:24:58,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:24:58,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:24:58,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@446d0070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58, skipping insertion in model container [2025-02-05 21:24:58,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:24:58,556 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-47.i[915,928] [2025-02-05 21:24:58,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:24:58,603 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:24:58,610 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-47.i[915,928] [2025-02-05 21:24:58,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:24:58,641 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:24:58,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58 WrapperNode [2025-02-05 21:24:58,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:24:58,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:24:58,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:24:58,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:24:58,647 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:24:58" (1/1) ... [2025-02-05 21:24:58,654 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:24:58" (1/1) ... [2025-02-05 21:24:58,670 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2025-02-05 21:24:58,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:24:58,671 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:24:58,671 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:24:58,671 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:24:58,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,689 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:24:58,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,695 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,701 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:24:58,702 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:24:58,702 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:24:58,702 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:24:58,702 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58" (1/1) ... [2025-02-05 21:24:58,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:24:58,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:24:58,732 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:24:58,739 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:24:58,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:24:58,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 21:24:58,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:24:58,753 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:24:58,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:24:58,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:24:58,845 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:24:58,847 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:25:12,402 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 21:25:12,402 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:25:12,410 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:25:12,410 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:25:12,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:25:12 BoogieIcfgContainer [2025-02-05 21:25:12,411 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:25:12,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:25:12,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:25:12,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:25:12,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:24:58" (1/3) ... [2025-02-05 21:25:12,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d96e9d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:25:12, skipping insertion in model container [2025-02-05 21:25:12,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:24:58" (2/3) ... [2025-02-05 21:25:12,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d96e9d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:25:12, skipping insertion in model container [2025-02-05 21:25:12,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:25:12" (3/3) ... [2025-02-05 21:25:12,418 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i [2025-02-05 21:25:12,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:25:12,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-47.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:25:12,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:25:12,476 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;@70a1c1a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:25:12,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:25:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 21:25:12,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 21:25:12,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:12,489 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:12,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:12,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1067707309, now seen corresponding path program 1 times [2025-02-05 21:25:12,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:25:12,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164006002] [2025-02-05 21:25:12,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:12,503 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:12,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:25:12,509 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:12,512 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:12,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 21:25:13,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 21:25:13,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:13,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:13,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:25:13,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:25:13,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2025-02-05 21:25:13,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:25:13,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:25:13,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164006002] [2025-02-05 21:25:13,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164006002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:25:13,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:25:13,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 21:25:13,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453816248] [2025-02-05 21:25:13,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:25:13,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:25:13,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:25:13,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:25:13,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:25:13,525 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 21:25:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:25:13,554 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2025-02-05 21:25:13,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:25:13,556 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 183 [2025-02-05 21:25:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:25:13,562 INFO L225 Difference]: With dead ends: 154 [2025-02-05 21:25:13,563 INFO L226 Difference]: Without dead ends: 77 [2025-02-05 21:25:13,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 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:13,569 INFO L435 NwaCegarLoop]: 117 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, 117 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:13,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 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:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-05 21:25:13,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-05 21:25:13,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-05 21:25:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-02-05 21:25:13,615 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 183 [2025-02-05 21:25:13,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:25:13,617 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-02-05 21:25:13,617 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, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 21:25:13,617 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-02-05 21:25:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 21:25:13,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:13,622 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,654 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:13,823 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:13,824 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:13,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:13,826 INFO L85 PathProgramCache]: Analyzing trace with hash 335890794, now seen corresponding path program 1 times [2025-02-05 21:25:13,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:25:13,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628254860] [2025-02-05 21:25:13,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:13,828 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:13,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:25:13,833 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:13,835 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:13,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 21:25:14,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 21:25:14,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:14,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:14,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 21:25:14,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:25:18,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2025-02-05 21:25:18,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:25:18,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:25:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628254860] [2025-02-05 21:25:18,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628254860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:25:18,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [944440038] [2025-02-05 21:25:18,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:18,679 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 21:25:18,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 21:25:18,702 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 21:25:18,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-02-05 21:25:18,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 21:25:20,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 21:25:20,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:20,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:20,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 21:25:20,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:25:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 21:25:24,431 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:25:24,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [944440038] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:25:24,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:25:24,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-02-05 21:25:24,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626078786] [2025-02-05 21:25:24,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:25:24,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:25:24,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:25:24,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:25:24,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-05 21:25:24,435 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:25:29,422 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:25:33,425 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:37,435 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:39,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 21:25:43,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s 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:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:25:43,846 INFO L93 Difference]: Finished difference Result 362 states and 553 transitions. [2025-02-05 21:25:43,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:25:43,847 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 183 [2025-02-05 21:25:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:25:43,852 INFO L225 Difference]: With dead ends: 362 [2025-02-05 21:25:43,853 INFO L226 Difference]: Without dead ends: 288 [2025-02-05 21:25:43,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:25:43,857 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 275 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 181 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:25:43,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 616 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 34 Invalid, 4 Unknown, 0 Unchecked, 18.9s Time] [2025-02-05 21:25:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-05 21:25:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 161. [2025-02-05 21:25:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 21:25:43,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 245 transitions. [2025-02-05 21:25:43,890 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 245 transitions. Word has length 183 [2025-02-05 21:25:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:25:43,890 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 245 transitions. [2025-02-05 21:25:43,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:25:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 245 transitions. [2025-02-05 21:25:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 21:25:43,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:25:43,892 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,916 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:44,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-02-05 21:25:44,297 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 21:25:44,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:25:44,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:25:44,299 INFO L85 PathProgramCache]: Analyzing trace with hash -169667831, now seen corresponding path program 1 times [2025-02-05 21:25:44,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 21:25:44,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425928893] [2025-02-05 21:25:44,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:25:44,300 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:44,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 21:25:44,302 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:25:44,303 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:25:44,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 21:25:45,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 21:25:45,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:25:45,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:25:45,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:25:45,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:25:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-05 21:25:54,540 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:25:54,541 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 21:25:54,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425928893] [2025-02-05 21:25:54,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425928893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:25:54,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:25:54,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:25:54,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015565634] [2025-02-05 21:25:54,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:25:54,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:25:54,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 21:25:54,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:25:54,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:25:54,542 INFO L87 Difference]: Start difference. First operand 161 states and 245 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-05 21:25:59,054 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 []