./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.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 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:53:48,697 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:53:48,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:53:48,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:53:48,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:53:48,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:53:48,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:53:48,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:53:48,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:53:48,789 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:53:48,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:53:48,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:53:48,789 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:53:48,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:53:48,790 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:53:48,790 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:53:48,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:53:48,790 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:53:48,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:53:48,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:53:48,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:53:48,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:53:48,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:53:48,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:53:48,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:53:48,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:53:48,791 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:53:48,791 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:53:48,791 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:53:48,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:53:48,792 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:53:48,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:53:48,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:53:48,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:53:48,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:53:48,792 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:53:48,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:53:48,793 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:53:48,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:53:48,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:53:48,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:53:48,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:53:48,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:53:48,793 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 -> 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 [2025-02-05 22:53:49,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:53:49,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:53:49,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:53:49,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:53:49,088 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:53:49,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2025-02-05 22:53:50,423 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5598d8f7/c7d42c185380421f8fd49c22de10faeb/FLAG6d3e805d4 [2025-02-05 22:53:50,716 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:53:50,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2025-02-05 22:53:50,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5598d8f7/c7d42c185380421f8fd49c22de10faeb/FLAG6d3e805d4 [2025-02-05 22:53:50,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c5598d8f7/c7d42c185380421f8fd49c22de10faeb [2025-02-05 22:53:50,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:53:50,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:53:50,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:53:50,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:53:50,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:53:50,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:53:50" (1/1) ... [2025-02-05 22:53:50,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c42f9dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:50, skipping insertion in model container [2025-02-05 22:53:50,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:53:50" (1/1) ... [2025-02-05 22:53:50,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:53:50,891 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2025-02-05 22:53:50,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:53:50,970 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:53:50,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2025-02-05 22:53:51,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:53:51,047 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:53:51,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51 WrapperNode [2025-02-05 22:53:51,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:53:51,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:53:51,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:53:51,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:53:51,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,102 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-02-05 22:53:51,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:53:51,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:53:51,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:53:51,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:53:51,113 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,140 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 22:53:51,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,143 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,151 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:53:51,171 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:53:51,171 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:53:51,171 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:53:51,172 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (1/1) ... [2025-02-05 22:53:51,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:53:51,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:51,207 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 22:53:51,215 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 22:53:51,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:53:51,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:53:51,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:53:51,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:53:51,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:53:51,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:53:51,318 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:53:51,320 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:53:51,706 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 22:53:51,706 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:53:51,724 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:53:51,724 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:53:51,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:53:51 BoogieIcfgContainer [2025-02-05 22:53:51,725 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:53:51,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:53:51,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:53:51,732 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:53:51,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:53:50" (1/3) ... [2025-02-05 22:53:51,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10eb443b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:53:51, skipping insertion in model container [2025-02-05 22:53:51,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:53:51" (2/3) ... [2025-02-05 22:53:51,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10eb443b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:53:51, skipping insertion in model container [2025-02-05 22:53:51,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:53:51" (3/3) ... [2025-02-05 22:53:51,736 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2025-02-05 22:53:51,750 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:53:51,752 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:53:51,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:53:51,824 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;@4670f50c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:53:51,825 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:53:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 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 22:53:51,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 22:53:51,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:51,847 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] [2025-02-05 22:53:51,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:51,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:51,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1624113305, now seen corresponding path program 1 times [2025-02-05 22:53:51,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:51,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138140262] [2025-02-05 22:53:51,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:51,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:51,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 22:53:52,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 22:53:52,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:52,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:52,252 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 22:53:52,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:52,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138140262] [2025-02-05 22:53:52,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138140262] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:53:52,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623289698] [2025-02-05 22:53:52,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:52,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:52,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:52,259 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 22:53:52,260 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 22:53:52,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 22:53:52,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 22:53:52,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:52,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:52,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:53:52,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:52,508 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 22:53:52,508 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:53:52,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623289698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:52,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:53:52,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:53:52,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570208326] [2025-02-05 22:53:52,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:52,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:53:52,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:52,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:53:52,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:53:52,534 INFO L87 Difference]: Start difference. First operand has 95 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 22:53:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:52,564 INFO L93 Difference]: Finished difference Result 183 states and 322 transitions. [2025-02-05 22:53:52,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:53:52,569 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (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 189 [2025-02-05 22:53:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:52,574 INFO L225 Difference]: With dead ends: 183 [2025-02-05 22:53:52,575 INFO L226 Difference]: Without dead ends: 91 [2025-02-05 22:53:52,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 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 22:53:52,580 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:52,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:53:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-02-05 22:53:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-02-05 22:53:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 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 22:53:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2025-02-05 22:53:52,622 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 189 [2025-02-05 22:53:52,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:52,622 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2025-02-05 22:53:52,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (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 22:53:52,623 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2025-02-05 22:53:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 22:53:52,626 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:52,626 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] [2025-02-05 22:53:52,634 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 22:53:52,827 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 22:53:52,827 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:52,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:52,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2090426974, now seen corresponding path program 1 times [2025-02-05 22:53:52,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:52,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473286951] [2025-02-05 22:53:52,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:52,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:52,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 22:53:52,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 22:53:52,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:52,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:53,220 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 22:53:53,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:53,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473286951] [2025-02-05 22:53:53,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473286951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:53,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:53,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:53:53,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419140225] [2025-02-05 22:53:53,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:53,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:53:53,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:53,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:53:53,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:53:53,226 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 22:53:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:53,299 INFO L93 Difference]: Finished difference Result 238 states and 374 transitions. [2025-02-05 22:53:53,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:53:53,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 189 [2025-02-05 22:53:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:53,302 INFO L225 Difference]: With dead ends: 238 [2025-02-05 22:53:53,302 INFO L226 Difference]: Without dead ends: 150 [2025-02-05 22:53:53,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:53:53,304 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 41 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:53,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 256 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:53:53,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-02-05 22:53:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2025-02-05 22:53:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 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 22:53:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 227 transitions. [2025-02-05 22:53:53,336 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 227 transitions. Word has length 189 [2025-02-05 22:53:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:53,337 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 227 transitions. [2025-02-05 22:53:53,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 22:53:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 227 transitions. [2025-02-05 22:53:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 22:53:53,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:53,344 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 22:53:53,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:53:53,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:53,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:53,347 INFO L85 PathProgramCache]: Analyzing trace with hash -84250117, now seen corresponding path program 1 times [2025-02-05 22:53:53,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:53,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142998948] [2025-02-05 22:53:53,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:53,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:53,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:53:53,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:53:53,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:53,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:54,248 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 22:53:54,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:54,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142998948] [2025-02-05 22:53:54,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142998948] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:54,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:54,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 22:53:54,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729772572] [2025-02-05 22:53:54,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:54,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:53:54,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:54,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:53:54,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:53:54,251 INFO L87 Difference]: Start difference. First operand 146 states and 227 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 22:53:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:55,484 INFO L93 Difference]: Finished difference Result 441 states and 666 transitions. [2025-02-05 22:53:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 22:53:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 191 [2025-02-05 22:53:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:55,488 INFO L225 Difference]: With dead ends: 441 [2025-02-05 22:53:55,489 INFO L226 Difference]: Without dead ends: 353 [2025-02-05 22:53:55,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-02-05 22:53:55,490 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 644 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:55,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 708 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 22:53:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-05 22:53:55,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 311. [2025-02-05 22:53:55,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 211 states have (on average 1.3838862559241707) internal successors, (292), 214 states have internal predecessors, (292), 91 states have call successors, (91), 8 states have call predecessors, (91), 8 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2025-02-05 22:53:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 474 transitions. [2025-02-05 22:53:55,542 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 474 transitions. Word has length 191 [2025-02-05 22:53:55,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:55,543 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 474 transitions. [2025-02-05 22:53:55,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-05 22:53:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 474 transitions. [2025-02-05 22:53:55,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 22:53:55,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:55,547 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 22:53:55,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:53:55,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:55,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash -493074342, now seen corresponding path program 1 times [2025-02-05 22:53:55,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:55,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960469259] [2025-02-05 22:53:55,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:55,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:55,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:53:55,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:53:55,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:55,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:55,696 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 22:53:55,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:55,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960469259] [2025-02-05 22:53:55,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960469259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:55,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:55,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:53:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101139762] [2025-02-05 22:53:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:55,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:53:55,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:55,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:53:55,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:53:55,699 INFO L87 Difference]: Start difference. First operand 311 states and 474 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 22:53:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:55,812 INFO L93 Difference]: Finished difference Result 550 states and 824 transitions. [2025-02-05 22:53:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:53:55,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 22:53:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:55,819 INFO L225 Difference]: With dead ends: 550 [2025-02-05 22:53:55,821 INFO L226 Difference]: Without dead ends: 421 [2025-02-05 22:53:55,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:53:55,823 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 63 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:55,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 266 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:53:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-02-05 22:53:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 359. [2025-02-05 22:53:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 248 states have (on average 1.3911290322580645) internal successors, (345), 252 states have internal predecessors, (345), 101 states have call successors, (101), 9 states have call predecessors, (101), 9 states have return successors, (101), 97 states have call predecessors, (101), 101 states have call successors, (101) [2025-02-05 22:53:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 547 transitions. [2025-02-05 22:53:55,885 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 547 transitions. Word has length 191 [2025-02-05 22:53:55,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:55,886 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 547 transitions. [2025-02-05 22:53:55,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 22:53:55,886 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 547 transitions. [2025-02-05 22:53:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 22:53:55,890 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:55,890 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 22:53:55,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:53:55,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:55,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:55,892 INFO L85 PathProgramCache]: Analyzing trace with hash -492150821, now seen corresponding path program 1 times [2025-02-05 22:53:55,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:55,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040724392] [2025-02-05 22:53:55,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:55,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:55,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:53:55,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:53:55,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:55,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 33 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-02-05 22:53:56,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:56,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040724392] [2025-02-05 22:53:56,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040724392] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:53:56,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830779555] [2025-02-05 22:53:56,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:56,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:56,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:56,238 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 22:53:56,242 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 22:53:56,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:53:56,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:53:56,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:56,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:56,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 22:53:56,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 810 proven. 33 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2025-02-05 22:53:56,866 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:53:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 51 proven. 33 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-02-05 22:53:57,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830779555] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:53:57,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:53:57,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2025-02-05 22:53:57,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329282912] [2025-02-05 22:53:57,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:53:57,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-05 22:53:57,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:57,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-05 22:53:57,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:53:57,191 INFO L87 Difference]: Start difference. First operand 359 states and 547 transitions. Second operand has 17 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 6 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (87), 5 states have call predecessors, (87), 6 states have call successors, (87) [2025-02-05 22:53:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:57,952 INFO L93 Difference]: Finished difference Result 572 states and 873 transitions. [2025-02-05 22:53:57,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 22:53:57,953 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 6 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (87), 5 states have call predecessors, (87), 6 states have call successors, (87) Word has length 191 [2025-02-05 22:53:57,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:57,956 INFO L225 Difference]: With dead ends: 572 [2025-02-05 22:53:57,956 INFO L226 Difference]: Without dead ends: 279 [2025-02-05 22:53:57,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2025-02-05 22:53:57,958 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 220 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:57,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 589 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:53:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-05 22:53:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 205. [2025-02-05 22:53:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 131 states have (on average 1.3358778625954197) internal successors, (175), 132 states have internal predecessors, (175), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 22:53:57,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 311 transitions. [2025-02-05 22:53:57,995 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 311 transitions. Word has length 191 [2025-02-05 22:53:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:57,995 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 311 transitions. [2025-02-05 22:53:57,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 6 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (87), 5 states have call predecessors, (87), 6 states have call successors, (87) [2025-02-05 22:53:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 311 transitions. [2025-02-05 22:53:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 22:53:57,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:57,997 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 22:53:58,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 22:53:58,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:58,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:58,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:58,202 INFO L85 PathProgramCache]: Analyzing trace with hash 127100796, now seen corresponding path program 1 times [2025-02-05 22:53:58,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:58,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090728070] [2025-02-05 22:53:58,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:58,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:58,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:53:58,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:53:58,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:58,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:53:58,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736184651] [2025-02-05 22:53:58,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:58,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:58,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:58,306 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 22:53:58,309 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 22:53:58,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:53:58,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:53:58,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:58,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:58,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 22:53:58,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:58,737 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 22:53:58,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:53:58,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:58,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090728070] [2025-02-05 22:53:58,738 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 22:53:58,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736184651] [2025-02-05 22:53:58,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736184651] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:58,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:58,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:53:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527499849] [2025-02-05 22:53:58,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:58,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:53:58,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:58,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:53:58,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:53:58,740 INFO L87 Difference]: Start difference. First operand 205 states and 311 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) 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 22:53:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:59,038 INFO L93 Difference]: Finished difference Result 416 states and 655 transitions. [2025-02-05 22:53:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:53:59,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) 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 22:53:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:59,041 INFO L225 Difference]: With dead ends: 416 [2025-02-05 22:53:59,041 INFO L226 Difference]: Without dead ends: 280 [2025-02-05 22:53:59,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:53:59,043 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 182 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:59,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 357 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:53:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-05 22:53:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 212. [2025-02-05 22:53:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 139 states have internal predecessors, (185), 68 states have call successors, (68), 5 states have call predecessors, (68), 5 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 22:53:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 321 transitions. [2025-02-05 22:53:59,064 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 321 transitions. Word has length 191 [2025-02-05 22:53:59,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:59,065 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 321 transitions. [2025-02-05 22:53:59,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) 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 22:53:59,065 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 321 transitions. [2025-02-05 22:53:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 22:53:59,067 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:59,067 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 22:53:59,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 22:53:59,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:59,268 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:59,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:59,268 INFO L85 PathProgramCache]: Analyzing trace with hash -869971557, now seen corresponding path program 1 times [2025-02-05 22:53:59,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:59,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369125479] [2025-02-05 22:53:59,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:59,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:59,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:53:59,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:53:59,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:59,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 22:53:59,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79378580] [2025-02-05 22:53:59,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:59,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:59,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:59,332 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 22:53:59,335 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 22:53:59,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:53:59,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:53:59,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:59,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:53:59,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:53:59,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 22:53:59,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 22:53:59,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:59,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:53:59,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:53:59,607 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:53:59,608 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:53:59,618 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 22:53:59,810 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,SelfDestructingSolverStorable6 [2025-02-05 22:53:59,813 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:53:59,940 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:53:59,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:53:59 BoogieIcfgContainer [2025-02-05 22:53:59,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:53:59,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:53:59,948 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:53:59,948 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:53:59,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:53:51" (3/4) ... [2025-02-05 22:53:59,951 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:53:59,952 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:53:59,952 INFO L158 Benchmark]: Toolchain (without parser) took 9198.16ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 154.6MB in the beginning and 118.5MB in the end (delta: 36.1MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2025-02-05 22:53:59,953 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:53:59,953 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.00ms. Allocated memory is still 201.3MB. Free memory was 154.2MB in the beginning and 139.0MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:53:59,953 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.00ms. Allocated memory is still 201.3MB. Free memory was 139.0MB in the beginning and 136.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:53:59,953 INFO L158 Benchmark]: Boogie Preprocessor took 67.46ms. Allocated memory is still 201.3MB. Free memory was 136.2MB in the beginning and 132.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:53:59,953 INFO L158 Benchmark]: IcfgBuilder took 553.66ms. Allocated memory is still 201.3MB. Free memory was 132.8MB in the beginning and 107.9MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 22:53:59,954 INFO L158 Benchmark]: TraceAbstraction took 8220.12ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 107.5MB in the beginning and 121.1MB in the end (delta: -13.6MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2025-02-05 22:53:59,955 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 243.3MB. Free memory was 121.1MB in the beginning and 118.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:53:59,956 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 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.00ms. Allocated memory is still 201.3MB. Free memory was 154.2MB in the beginning and 139.0MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.00ms. Allocated memory is still 201.3MB. Free memory was 139.0MB in the beginning and 136.2MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.46ms. Allocated memory is still 201.3MB. Free memory was 136.2MB in the beginning and 132.8MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 553.66ms. Allocated memory is still 201.3MB. Free memory was 132.8MB in the beginning and 107.9MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8220.12ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 107.5MB in the beginning and 121.1MB in the end (delta: -13.6MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 243.3MB. Free memory was 121.1MB in the beginning and 118.5MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 146, overapproximation of someBinaryFLOATComparisonOperation at line 166, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 162, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 164, overapproximation of someBinaryFLOATComparisonOperation at line 195, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 195, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -1; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 5.5; [L25] float var_1_5 = 255.475; [L26] unsigned char var_1_7 = 0; [L27] signed char var_1_8 = -5; [L28] signed char var_1_9 = 2; [L29] unsigned char var_1_10 = 16; [L30] unsigned char var_1_11 = 16; [L31] float var_1_12 = 10000000.8; [L32] float var_1_13 = 127.7; [L33] float var_1_14 = 199.2; [L34] float var_1_15 = 999999.5; [L35] signed long int var_1_16 = -8; [L36] signed short int var_1_18 = -8; [L37] double var_1_19 = 5.4; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; [L40] signed char var_1_22 = 1; [L41] signed short int var_1_25 = 32; [L42] unsigned char var_1_27 = 0; [L43] unsigned char var_1_28 = 0; [L44] unsigned long int var_1_29 = 5; [L45] unsigned long int var_1_30 = 4; [L46] unsigned char var_1_31 = 2; [L47] unsigned char var_1_34 = 5; [L48] unsigned char var_1_35 = 25; [L49] unsigned char var_1_36 = 10; [L50] unsigned short int var_1_37 = 64; [L51] unsigned short int var_1_38 = 16; [L52] signed long int var_1_39 = -50; [L53] signed char last_1_var_1_1 = -1; [L54] unsigned char last_1_var_1_10 = 16; [L55] signed long int last_1_var_1_16 = -8; VAL [isInitial=0, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_3=162/5, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L190] last_1_var_1_1 = var_1_1 [L191] last_1_var_1_10 = var_1_10 [L192] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_3=162/5, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L202] RET updateLastVariables() [L203] CALL updateVariables() [L142] var_1_3 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L143] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L144] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L144] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_4=11/2, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L145] var_1_4 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L146] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_5=10219/40, var_1_7=0, var_1_8=-5, var_1_9=2] [L147] var_1_5 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L148] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=0, var_1_8=-5, var_1_9=2] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_8=-5, var_1_9=2] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=-5, var_1_9=2] [L152] var_1_8 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L153] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L154] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L154] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=2] [L155] var_1_9 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L156] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L157] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L158] var_1_11 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L159] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L160] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_13=1277/10, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L161] var_1_13 = __VERIFIER_nondet_float() [L162] 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_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L162] 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_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_14=996/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L163] var_1_14 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L164] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_15=1999999/2, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L165] var_1_15 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L166] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L167] var_1_21 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L168] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L169] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=32, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L170] var_1_25 = __VERIFIER_nondet_short() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_25 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L172] RET assume_abort_if_not(var_1_25 <= 32) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L173] var_1_28 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L174] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L175] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L175] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=4, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L176] var_1_30 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L177] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L178] CALL assume_abort_if_not(var_1_30 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L178] RET assume_abort_if_not(var_1_30 <= 8) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=5, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L179] var_1_34 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L180] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L181] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=25, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L182] var_1_35 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L183] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L184] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L184] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=10, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L185] var_1_36 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L186] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L187] CALL assume_abort_if_not(var_1_36 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L187] RET assume_abort_if_not(var_1_36 <= 127) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L203] RET updateVariables() [L204] CALL step() [L59] signed long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_0=-8, var_1_10=16, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L60] COND FALSE !(var_1_9 < stepLocal_0) [L65] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L67] COND TRUE 64 >= (10 * var_1_16) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L68] EXPR var_1_16 >> var_1_30 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=5, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L68] COND FALSE !(var_1_25 <= (var_1_16 >> var_1_30)) [L71] var_1_29 = var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=-8, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L74] COND TRUE \read(var_1_7) [L75] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L79] EXPR var_1_11 >> var_1_25 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L79] COND FALSE !(var_1_1 > ((var_1_11 >> var_1_25) * var_1_10)) [L82] EXPR var_1_30 & var_1_11 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L82] COND FALSE !(var_1_16 < (var_1_30 & var_1_11)) [L87] COND TRUE var_1_9 >= var_1_11 [L88] var_1_37 = ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=-50, var_1_7=1, var_1_8=2, var_1_9=1] [L92] COND TRUE 100.75 >= ((((var_1_4 + var_1_3) < 0 ) ? -(var_1_4 + var_1_3) : (var_1_4 + var_1_3))) [L93] var_1_39 = ((((var_1_11) < (var_1_34)) ? (var_1_11) : (var_1_34))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L95] signed long int stepLocal_2 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_16=2, var_1_18=-8, var_1_19=27/5, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L96] COND TRUE ! (last_1_var_1_1 > last_1_var_1_10) [L97] var_1_19 = ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=50000004/5, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L103] COND TRUE var_1_5 <= (var_1_19 / var_1_3) [L104] var_1_12 = ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L108] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=-1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L109] COND FALSE !((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) [L116] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L118] COND FALSE !((-128 >> 10u) >= var_1_10) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L123] signed char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_1=2, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=-8, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L124] COND FALSE !(stepLocal_1 >= (var_1_16 + var_1_10)) [L135] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=16, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L137] COND TRUE var_1_11 < var_1_16 [L138] var_1_38 = (((((((5) < (var_1_25)) ? (5) : (var_1_25))) < 0 ) ? -((((5) < (var_1_25)) ? (5) : (var_1_25))) : ((((5) < (var_1_25)) ? (5) : (var_1_25))))) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, stepLocal_2=16, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L204] RET step() [L205] CALL, EXPR property() [L195-L196] return (((((((var_1_12 / var_1_3) > ((var_1_4 - var_1_5) * var_1_19)) ? (var_1_7 ? (var_1_1 == ((signed char) var_1_8)) : (var_1_1 == ((signed char) var_1_9))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_9 < last_1_var_1_16) ? (((var_1_4 - var_1_5) > var_1_3) ? (var_1_10 == ((unsigned char) 8)) : 1) : (var_1_10 == ((unsigned char) var_1_11)))) && ((var_1_5 <= (var_1_19 / var_1_3)) ? (var_1_12 == ((float) ((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) : (var_1_12 == ((float) var_1_14)))) && (var_1_7 ? (var_1_16 == ((signed long int) var_1_8)) : (var_1_16 == ((signed long int) (var_1_11 - ((((var_1_10 - var_1_10) < 0 ) ? -(var_1_10 - var_1_10) : (var_1_10 - var_1_10)))))))) && ((var_1_1 >= (var_1_16 + var_1_10)) ? ((var_1_5 < 999.5f) ? (var_1_7 ? (var_1_18 == ((signed short int) (var_1_16 + var_1_16))) : (var_1_18 == ((signed short int) var_1_8))) : (var_1_18 == ((signed short int) var_1_9))) : (var_1_18 == ((signed short int) var_1_8)))) && ((! (last_1_var_1_1 > last_1_var_1_10)) ? (var_1_19 == ((double) ((((var_1_13) > ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14))))) ? (var_1_13) : ((((((0.05 + var_1_15)) < (var_1_14)) ? ((0.05 + var_1_15)) : (var_1_14)))))))) : ((last_1_var_1_10 > var_1_9) ? (var_1_19 == ((double) var_1_15)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=16, last_1_var_1_16=-8, last_1_var_1_1=-1, var_1_10=1, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_16=2, var_1_18=2, var_1_19=2, var_1_1=2, var_1_20=0, var_1_21=0, var_1_22=1, var_1_25=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=2, var_1_34=0, var_1_35=0, var_1_36=0, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=1, var_1_8=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1195 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1150 mSDsluCounter, 2315 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1508 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1916 IncrementalHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 807 mSDtfsCounter, 1916 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 809 GetRequests, 764 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=4, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 250 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2095 NumberOfCodeBlocks, 2095 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1704 ConstructedInterpolants, 0 QuantifiedInterpolants, 4701 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1334 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 14461/14616 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 22:53:59,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.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 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:54:02,268 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:54:02,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:54:02,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:54:02,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:54:02,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:54:02,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:54:02,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:54:02,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:54:02,423 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:54:02,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:54:02,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:54:02,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:54:02,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:54:02,423 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:54:02,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:54:02,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:54:02,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:54:02,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:54:02,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:54:02,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:54:02,427 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 -> 0ddfed299cddd9e32e0c725c50eded2fe88f31aaefb86ca27530d10afeb40c79 [2025-02-05 22:54:02,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:54:02,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:54:02,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:54:02,750 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:54:02,750 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:54:02,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2025-02-05 22:54:04,157 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1065bb0f5/ed89644c93714f189c984a4e614ae1e1/FLAG6b56c00c5 [2025-02-05 22:54:04,414 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:54:04,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2025-02-05 22:54:04,428 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1065bb0f5/ed89644c93714f189c984a4e614ae1e1/FLAG6b56c00c5 [2025-02-05 22:54:04,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1065bb0f5/ed89644c93714f189c984a4e614ae1e1 [2025-02-05 22:54:04,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:54:04,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:54:04,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:54:04,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:54:04,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:54:04,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7199511f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04, skipping insertion in model container [2025-02-05 22:54:04,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:54:04,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2025-02-05 22:54:04,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:54:04,711 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:54:04,720 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i[919,932] [2025-02-05 22:54:04,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:54:04,768 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:54:04,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04 WrapperNode [2025-02-05 22:54:04,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:54:04,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:54:04,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:54:04,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:54:04,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,825 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2025-02-05 22:54:04,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:54:04,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:54:04,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:54:04,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:54:04,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,870 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 22:54:04,870 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,870 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,901 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:54:04,908 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:54:04,909 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:54:04,909 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:54:04,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (1/1) ... [2025-02-05 22:54:04,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:54:04,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:54:04,941 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 22:54:04,948 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 22:54:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:54:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:54:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:54:04,970 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:54:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:54:04,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:54:05,064 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:54:05,067 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:54:30,473 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-02-05 22:54:30,475 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:54:30,489 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:54:30,489 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:54:30,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:54:30 BoogieIcfgContainer [2025-02-05 22:54:30,489 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:54:30,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:54:30,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:54:30,495 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:54:30,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:54:04" (1/3) ... [2025-02-05 22:54:30,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dd617b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:54:30, skipping insertion in model container [2025-02-05 22:54:30,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:54:04" (2/3) ... [2025-02-05 22:54:30,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33dd617b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:54:30, skipping insertion in model container [2025-02-05 22:54:30,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:54:30" (3/3) ... [2025-02-05 22:54:30,498 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i [2025-02-05 22:54:30,511 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:54:30,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-18.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:54:30,563 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:54:30,572 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;@a2aa9cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:54:30,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:54:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 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 22:54:30,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 22:54:30,587 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:54:30,587 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 22:54:30,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:54:30,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:54:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash 660734738, now seen corresponding path program 1 times [2025-02-05 22:54:30,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:54:30,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043902881] [2025-02-05 22:54:30,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:54:30,601 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 22:54:30,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:54:30,604 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 22:54:30,605 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 22:54:30,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 22:54:31,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 22:54:31,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:54:31,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:54:31,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:54:31,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:54:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2025-02-05 22:54:31,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:54:31,967 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:54:31,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043902881] [2025-02-05 22:54:31,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043902881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:54:31,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:54:31,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:54:31,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521261787] [2025-02-05 22:54:31,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:54:31,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:54:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:54:32,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:54:32,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:54:32,007 INFO L87 Difference]: Start difference. First operand has 88 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 57 states have internal predecessors, (81), 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 22:54:32,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:54:32,029 INFO L93 Difference]: Finished difference Result 169 states and 300 transitions. [2025-02-05 22:54:32,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:54:32,031 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (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 187 [2025-02-05 22:54:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:54:32,040 INFO L225 Difference]: With dead ends: 169 [2025-02-05 22:54:32,040 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 22:54:32,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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 22:54:32,047 INFO L435 NwaCegarLoop]: 131 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, 131 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 22:54:32,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:54:32,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 22:54:32,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-05 22:54:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 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 22:54:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2025-02-05 22:54:32,097 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 187 [2025-02-05 22:54:32,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:54:32,097 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2025-02-05 22:54:32,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (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 22:54:32,097 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2025-02-05 22:54:32,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-05 22:54:32,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:54:32,101 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 22:54:32,132 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 22:54:32,301 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 22:54:32,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:54:32,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:54:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 196416023, now seen corresponding path program 1 times [2025-02-05 22:54:32,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:54:32,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113792409] [2025-02-05 22:54:32,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:54:32,303 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 22:54:32,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:54:32,306 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 22:54:32,308 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 22:54:32,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-05 22:54:33,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-05 22:54:33,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:54:33,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:54:33,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:54:33,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:54:40,098 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 22:54:40,098 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:54:40,098 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:54:40,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113792409] [2025-02-05 22:54:40,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113792409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:54:40,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:54:40,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:54:40,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93348618] [2025-02-05 22:54:40,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:54:40,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:54:40,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:54:40,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:54:40,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:54:40,104 INFO L87 Difference]: Start difference. First operand 84 states and 131 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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 22:54:44,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:54:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:54:45,117 INFO L93 Difference]: Finished difference Result 222 states and 349 transitions. [2025-02-05 22:54:45,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:54:45,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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 187 [2025-02-05 22:54:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:54:45,121 INFO L225 Difference]: With dead ends: 222 [2025-02-05 22:54:45,121 INFO L226 Difference]: Without dead ends: 141 [2025-02-05 22:54:45,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:54:45,127 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 6 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:54:45,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 240 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-02-05 22:54:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-05 22:54:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2025-02-05 22:54:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 78 states have internal predecessors, (100), 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 22:54:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 216 transitions. [2025-02-05 22:54:45,162 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 216 transitions. Word has length 187 [2025-02-05 22:54:45,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:54:45,163 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 216 transitions. [2025-02-05 22:54:45,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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 22:54:45,163 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 216 transitions. [2025-02-05 22:54:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 22:54:45,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:54:45,166 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 22:54:45,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-05 22:54:45,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-05 22:54:45,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:54:45,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:54:45,369 INFO L85 PathProgramCache]: Analyzing trace with hash 68468839, now seen corresponding path program 1 times [2025-02-05 22:54:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:54:45,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435843336] [2025-02-05 22:54:45,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:54:45,369 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 22:54:45,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:54:45,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-05 22:54:45,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-05 22:54:45,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 22:54:46,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 22:54:46,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:54:46,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:54:46,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 22:54:46,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:54:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 810 proven. 33 refuted. 0 times theorem prover too weak. 781 trivial. 0 not checked. [2025-02-05 22:54:56,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:54:57,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:54:57,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435843336] [2025-02-05 22:54:57,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435843336] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:54:57,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1015075470] [2025-02-05 22:54:57,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:54:57,444 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:54:57,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:54:57,446 INFO L229 MonitoredProcess]: Starting monitored process 5 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 22:54:57,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-02-05 22:54:57,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 22:54:59,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 22:54:59,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:54:59,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:54:59,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 22:54:59,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:55:06,711 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 22:55:06,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:55:06,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1015075470] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:55:06,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:55:06,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 22:55:06,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891258042] [2025-02-05 22:55:06,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:55:06,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:55:06,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:55:06,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:55:06,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 22:55:06,713 INFO L87 Difference]: Start difference. First operand 139 states and 216 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 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 22:55:10,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:55:15,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []