./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-53.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 8077ea0a7b69b238ec123c66b3e265976e596d9fa67f90c1cfc30532a2641db9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:53:18,882 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:53:18,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:53:18,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:53:18,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:53:18,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:53:18,962 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:53:18,962 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:53:18,963 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:53:18,963 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:53:18,963 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:53:18,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:53:18,963 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:53:18,963 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:53:18,963 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:53:18,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:53:18,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:53:18,964 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:53:18,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:53:18,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:53:18,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:53:18,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:53:18,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:53:18,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:53:18,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:53:18,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:53:18,964 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:53:18,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:53:18,965 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:53:18,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:53:18,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:53:18,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:53:18,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:53:18,965 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:53:18,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:53:18,965 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:53:18,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:53:18,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:53:18,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:53:18,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:53:18,966 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:53:18,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:53:18,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:53:18,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:53:18,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:53:18,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:53:18,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:53:18,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:53:18,967 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 -> 8077ea0a7b69b238ec123c66b3e265976e596d9fa67f90c1cfc30532a2641db9 [2025-01-09 10:53:19,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:53:19,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:53:19,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:53:19,188 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:53:19,188 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:53:19,189 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-pe-co_file-53.i [2025-01-09 10:53:20,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59437880b/1461206bdca042a4b9af7a16fd46989a/FLAGf5afe89ed [2025-01-09 10:53:20,528 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:53:20,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i [2025-01-09 10:53:20,536 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59437880b/1461206bdca042a4b9af7a16fd46989a/FLAGf5afe89ed [2025-01-09 10:53:20,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59437880b/1461206bdca042a4b9af7a16fd46989a [2025-01-09 10:53:20,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:53:20,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:53:20,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:53:20,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:53:20,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:53:20,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:53:20" (1/1) ... [2025-01-09 10:53:20,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603465f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:20, skipping insertion in model container [2025-01-09 10:53:20,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:53:20" (1/1) ... [2025-01-09 10:53:20,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:53:20,961 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-pe-co_file-53.i[919,932] [2025-01-09 10:53:21,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:53:21,050 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:53:21,059 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-pe-co_file-53.i[919,932] [2025-01-09 10:53:21,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:53:21,113 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:53:21,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21 WrapperNode [2025-01-09 10:53:21,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:53:21,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:53:21,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:53:21,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:53:21,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,178 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2025-01-09 10:53:21,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:53:21,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:53:21,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:53:21,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:53:21,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,201 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:53:21,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:53:21,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:53:21,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:53:21,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:53:21,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (1/1) ... [2025-01-09 10:53:21,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:53:21,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:53:21,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:53:21,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:53:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:53:21,270 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:53:21,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:53:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:53:21,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:53:21,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:53:21,346 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:53:21,350 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:53:21,703 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-01-09 10:53:21,704 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:53:21,712 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:53:21,715 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:53:21,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:53:21 BoogieIcfgContainer [2025-01-09 10:53:21,716 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:53:21,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:53:21,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:53:21,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:53:21,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:53:20" (1/3) ... [2025-01-09 10:53:21,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c77470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:53:21, skipping insertion in model container [2025-01-09 10:53:21,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:21" (2/3) ... [2025-01-09 10:53:21,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c77470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:53:21, skipping insertion in model container [2025-01-09 10:53:21,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:53:21" (3/3) ... [2025-01-09 10:53:21,725 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i [2025-01-09 10:53:21,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:53:21,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:53:21,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:53:21,800 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;@17239c67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:53:21,800 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:53:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 10:53:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 10:53:21,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:21,817 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:21,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:21,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:21,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2114077143, now seen corresponding path program 1 times [2025-01-09 10:53:21,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:53:21,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170072026] [2025-01-09 10:53:21,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:21,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:53:21,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 10:53:21,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 10:53:21,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:21,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:53:22,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:53:22,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170072026] [2025-01-09 10:53:22,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170072026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:53:22,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:53:22,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:53:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197014844] [2025-01-09 10:53:22,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:53:22,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:53:22,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:53:22,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:53:22,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:22,250 INFO L87 Difference]: Start difference. First operand has 110 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:22,344 INFO L93 Difference]: Finished difference Result 307 states and 549 transitions. [2025-01-09 10:53:22,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:53:22,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-01-09 10:53:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:22,355 INFO L225 Difference]: With dead ends: 307 [2025-01-09 10:53:22,355 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 10:53:22,359 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-01-09 10:53:22,362 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 139 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:22,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 435 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:53:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 10:53:22,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2025-01-09 10:53:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 133 states have internal predecessors, (181), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 10:53:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 305 transitions. [2025-01-09 10:53:22,430 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 305 transitions. Word has length 204 [2025-01-09 10:53:22,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:22,431 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 305 transitions. [2025-01-09 10:53:22,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 305 transitions. [2025-01-09 10:53:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 10:53:22,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:22,434 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:22,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 10:53:22,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:22,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:22,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1314861769, now seen corresponding path program 1 times [2025-01-09 10:53:22,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:53:22,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025064980] [2025-01-09 10:53:22,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:22,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:53:22,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 10:53:22,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 10:53:22,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:22,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:53:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:53:22,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025064980] [2025-01-09 10:53:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025064980] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:53:22,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:53:22,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:53:22,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220199017] [2025-01-09 10:53:22,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:53:22,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:53:22,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:53:22,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:53:22,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:22,703 INFO L87 Difference]: Start difference. First operand 198 states and 305 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:22,857 INFO L93 Difference]: Finished difference Result 584 states and 904 transitions. [2025-01-09 10:53:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:53:22,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 10:53:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:22,860 INFO L225 Difference]: With dead ends: 584 [2025-01-09 10:53:22,860 INFO L226 Difference]: Without dead ends: 389 [2025-01-09 10:53:22,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:22,865 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 157 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:22,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 436 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:53:22,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-01-09 10:53:22,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 200. [2025-01-09 10:53:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 135 states have (on average 1.3555555555555556) internal successors, (183), 135 states have internal predecessors, (183), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 10:53:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 307 transitions. [2025-01-09 10:53:22,904 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 307 transitions. Word has length 206 [2025-01-09 10:53:22,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:22,905 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 307 transitions. [2025-01-09 10:53:22,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:22,906 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 307 transitions. [2025-01-09 10:53:22,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 10:53:22,910 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:22,910 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:22,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:53:22,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:22,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:22,911 INFO L85 PathProgramCache]: Analyzing trace with hash 497213319, now seen corresponding path program 1 times [2025-01-09 10:53:22,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:53:22,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77601094] [2025-01-09 10:53:22,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:22,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:53:22,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 10:53:22,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 10:53:22,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:22,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:53:23,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:53:23,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77601094] [2025-01-09 10:53:23,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77601094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:53:23,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:53:23,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:53:23,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829802519] [2025-01-09 10:53:23,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:53:23,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:53:23,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:53:23,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:53:23,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:23,036 INFO L87 Difference]: Start difference. First operand 200 states and 307 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:23,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:23,072 INFO L93 Difference]: Finished difference Result 397 states and 611 transitions. [2025-01-09 10:53:23,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:53:23,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 10:53:23,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:23,074 INFO L225 Difference]: With dead ends: 397 [2025-01-09 10:53:23,074 INFO L226 Difference]: Without dead ends: 200 [2025-01-09 10:53:23,075 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-01-09 10:53:23,076 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:23,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 147 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:53:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-01-09 10:53:23,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-01-09 10:53:23,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 135 states have (on average 1.3407407407407408) internal successors, (181), 135 states have internal predecessors, (181), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 10:53:23,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 305 transitions. [2025-01-09 10:53:23,090 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 305 transitions. Word has length 206 [2025-01-09 10:53:23,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:23,090 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 305 transitions. [2025-01-09 10:53:23,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:23,091 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 305 transitions. [2025-01-09 10:53:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-09 10:53:23,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:23,092 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:23,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:53:23,093 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:23,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:23,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1302949007, now seen corresponding path program 1 times [2025-01-09 10:53:23,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:53:23,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016608042] [2025-01-09 10:53:23,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:23,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:53:23,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 10:53:23,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 10:53:23,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:23,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:23,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:53:23,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:53:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016608042] [2025-01-09 10:53:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016608042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:53:23,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:53:23,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:53:23,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505839300] [2025-01-09 10:53:23,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:53:23,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:53:23,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:53:23,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:53:23,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:53:23,327 INFO L87 Difference]: Start difference. First operand 200 states and 305 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:23,520 INFO L93 Difference]: Finished difference Result 673 states and 1025 transitions. [2025-01-09 10:53:23,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:53:23,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 207 [2025-01-09 10:53:23,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:23,524 INFO L225 Difference]: With dead ends: 673 [2025-01-09 10:53:23,524 INFO L226 Difference]: Without dead ends: 476 [2025-01-09 10:53:23,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:53:23,525 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 176 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:23,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 498 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:53:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-01-09 10:53:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 458. [2025-01-09 10:53:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 329 states have (on average 1.3708206686930091) internal successors, (451), 329 states have internal predecessors, (451), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 10:53:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 699 transitions. [2025-01-09 10:53:23,556 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 699 transitions. Word has length 207 [2025-01-09 10:53:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:23,557 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 699 transitions. [2025-01-09 10:53:23,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 699 transitions. [2025-01-09 10:53:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 10:53:23,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:23,559 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:23,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:53:23,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:23,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:23,559 INFO L85 PathProgramCache]: Analyzing trace with hash -375759631, now seen corresponding path program 1 times [2025-01-09 10:53:23,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:53:23,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959383780] [2025-01-09 10:53:23,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:23,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:53:23,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 10:53:23,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 10:53:23,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:23,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 10:53:23,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:53:23,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959383780] [2025-01-09 10:53:23,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959383780] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:53:23,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645709799] [2025-01-09 10:53:23,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:23,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:53:23,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:53:23,908 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:53:23,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:53:23,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 10:53:24,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 10:53:24,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:24,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:24,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 10:53:24,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:53:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-01-09 10:53:24,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:53:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 10:53:24,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645709799] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:53:24,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:53:24,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 9] total 21 [2025-01-09 10:53:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284611818] [2025-01-09 10:53:24,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:53:24,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 10:53:24,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:53:24,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 10:53:24,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-01-09 10:53:24,907 INFO L87 Difference]: Start difference. First operand 458 states and 699 transitions. Second operand has 21 states, 21 states have (on average 5.571428571428571) internal successors, (117), 21 states have internal predecessors, (117), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-01-09 10:53:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:27,106 INFO L93 Difference]: Finished difference Result 1504 states and 2249 transitions. [2025-01-09 10:53:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 10:53:27,107 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.571428571428571) internal successors, (117), 21 states have internal predecessors, (117), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) Word has length 208 [2025-01-09 10:53:27,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:27,115 INFO L225 Difference]: With dead ends: 1504 [2025-01-09 10:53:27,115 INFO L226 Difference]: Without dead ends: 1049 [2025-01-09 10:53:27,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 405 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=2681, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 10:53:27,120 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 892 mSDsluCounter, 3056 mSDsCounter, 0 mSdLazyCounter, 2912 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 3429 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 2912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:27,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 3429 Invalid, 3427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 2912 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 10:53:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-01-09 10:53:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 468. [2025-01-09 10:53:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 335 states have (on average 1.355223880597015) internal successors, (454), 335 states have internal predecessors, (454), 124 states have call successors, (124), 8 states have call predecessors, (124), 8 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 10:53:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 702 transitions. [2025-01-09 10:53:27,191 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 702 transitions. Word has length 208 [2025-01-09 10:53:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:27,193 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 702 transitions. [2025-01-09 10:53:27,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.571428571428571) internal successors, (117), 21 states have internal predecessors, (117), 5 states have call successors, (77), 3 states have call predecessors, (77), 6 states have return successors, (78), 5 states have call predecessors, (78), 5 states have call successors, (78) [2025-01-09 10:53:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 702 transitions. [2025-01-09 10:53:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 10:53:27,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:27,196 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:27,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:53:27,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:53:27,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:27,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:27,408 INFO L85 PathProgramCache]: Analyzing trace with hash 739343798, now seen corresponding path program 1 times [2025-01-09 10:53:27,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:53:27,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027923940] [2025-01-09 10:53:27,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:27,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:53:27,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 10:53:27,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 10:53:27,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:27,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:53:27,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:53:27,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027923940] [2025-01-09 10:53:27,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027923940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:53:27,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:53:27,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:53:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234375476] [2025-01-09 10:53:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:53:27,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:53:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:53:27,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:53:27,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:27,560 INFO L87 Difference]: Start difference. First operand 468 states and 702 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:27,618 INFO L93 Difference]: Finished difference Result 1174 states and 1769 transitions. [2025-01-09 10:53:27,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:53:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 209 [2025-01-09 10:53:27,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:27,622 INFO L225 Difference]: With dead ends: 1174 [2025-01-09 10:53:27,622 INFO L226 Difference]: Without dead ends: 709 [2025-01-09 10:53:27,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:27,623 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 92 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:27,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 307 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:53:27,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-01-09 10:53:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 707. [2025-01-09 10:53:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 508 states have (on average 1.3425196850393701) internal successors, (682), 508 states have internal predecessors, (682), 186 states have call successors, (186), 12 states have call predecessors, (186), 12 states have return successors, (186), 186 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 10:53:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1054 transitions. [2025-01-09 10:53:27,689 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1054 transitions. Word has length 209 [2025-01-09 10:53:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:27,690 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1054 transitions. [2025-01-09 10:53:27,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1054 transitions. [2025-01-09 10:53:27,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 10:53:27,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:27,695 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:27,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:53:27,695 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:27,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2137267135, now seen corresponding path program 1 times [2025-01-09 10:53:27,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:53:27,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551140598] [2025-01-09 10:53:27,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:27,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:53:27,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 10:53:27,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 10:53:27,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:27,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:53:27,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1452610457] [2025-01-09 10:53:27,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:27,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:53:27,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:53:27,813 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:53:27,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 10:53:27,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 10:53:27,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 10:53:27,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:27,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:53:27,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 10:53:27,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 10:53:27,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 10:53:27,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:27,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:53:28,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 10:53:28,081 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 10:53:28,081 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 10:53:28,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 10:53:28,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:53:28,286 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:28,397 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 10:53:28,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:53:28 BoogieIcfgContainer [2025-01-09 10:53:28,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 10:53:28,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 10:53:28,403 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 10:53:28,403 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 10:53:28,403 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:53:21" (3/4) ... [2025-01-09 10:53:28,405 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 10:53:28,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 10:53:28,406 INFO L158 Benchmark]: Toolchain (without parser) took 7558.25ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 131.4MB in the beginning and 82.1MB in the end (delta: 49.3MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. [2025-01-09 10:53:28,406 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:53:28,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.43ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 115.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 10:53:28,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.97ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 111.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:53:28,407 INFO L158 Benchmark]: Boogie Preprocessor took 35.57ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 106.1MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 10:53:28,407 INFO L158 Benchmark]: RCFGBuilder took 500.74ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 75.5MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 10:53:28,408 INFO L158 Benchmark]: TraceAbstraction took 6684.58ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 75.0MB in the beginning and 82.2MB in the end (delta: -7.2MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2025-01-09 10:53:28,408 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 226.5MB. Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 69.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:53:28,409 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.20ms. Allocated memory is still 226.5MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.43ms. Allocated memory is still 167.8MB. Free memory was 131.4MB in the beginning and 115.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.97ms. Allocated memory is still 167.8MB. Free memory was 115.4MB in the beginning and 111.0MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.57ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 106.1MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 500.74ms. Allocated memory is still 167.8MB. Free memory was 106.1MB in the beginning and 75.5MB in the end (delta: 30.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6684.58ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 75.0MB in the beginning and 82.2MB in the end (delta: -7.2MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 226.5MB. Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 69.3kB). 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 shiftLeft at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 184, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of someBinaryFLOATComparisonOperation at line 203, overapproximation of someBinaryArithmeticFLOAToperation at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 122, overapproximation of someUnaryFLOAToperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_8 = 0; [L24] unsigned long int var_1_9 = 10; [L25] float var_1_10 = 99.5; [L26] float var_1_11 = 5.6; [L27] float var_1_12 = 255.5; [L28] float var_1_13 = 31.25; [L29] signed short int var_1_14 = 32; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_16 = 1; [L32] unsigned char var_1_17 = 5; [L33] unsigned char var_1_18 = 50; [L34] unsigned char var_1_19 = 50; [L35] signed char var_1_20 = 1; [L36] signed char var_1_21 = -10; [L37] float var_1_22 = 0.5; [L38] signed char var_1_23 = 100; [L39] signed short int var_1_24 = 2; [L40] unsigned short int var_1_31 = 8; [L41] unsigned char var_1_32 = 64; [L42] unsigned char var_1_33 = 1; [L43] unsigned char var_1_34 = 0; [L44] float var_1_35 = 32.4; [L45] float var_1_36 = 8.5; [L46] float var_1_37 = 7.5; [L47] float var_1_38 = 3.2; [L48] unsigned char var_1_39 = 16; [L49] unsigned char var_1_40 = 5; [L50] signed short int var_1_41 = -2; [L51] unsigned char var_1_42 = 10; [L52] unsigned char var_1_43 = 4; [L53] unsigned char var_1_44 = 64; [L54] signed long int var_1_45 = -25; [L55] unsigned char last_1_var_1_1 = 0; [L56] unsigned long int last_1_var_1_9 = 10; [L57] signed short int last_1_var_1_14 = 32; [L58] unsigned char last_1_var_1_16 = 1; [L59] signed char last_1_var_1_20 = 1; VAL [isInitial=0, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=0, var_1_9=10] [L207] isInitial = 1 [L208] FCALL initially() [L210] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_9 = var_1_9 [L198] last_1_var_1_14 = var_1_14 [L199] last_1_var_1_16 = var_1_16 [L200] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=0, var_1_9=10] [L210] RET updateLastVariables() [L211] CALL updateVariables() [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L147] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L148] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L148] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_11=28/5, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L149] var_1_11 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L150] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_12=511/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L151] var_1_12 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L152] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_13=125/4, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L153] var_1_13 = __VERIFIER_nondet_float() [L154] 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_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L154] 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_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=16, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L155] var_1_15 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L156] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] CALL assume_abort_if_not(var_1_15 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L157] RET assume_abort_if_not(var_1_15 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L158] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=5, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L159] var_1_17 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L160] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L161] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L162] CALL assume_abort_if_not(var_1_17 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L162] RET assume_abort_if_not(var_1_17 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=50, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L163] var_1_18 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L164] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L165] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L165] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=50, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L166] var_1_19 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L167] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L168] CALL assume_abort_if_not(var_1_19 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L168] RET assume_abort_if_not(var_1_19 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=-10, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L169] var_1_21 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L170] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L171] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L171] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=64, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L172] var_1_32 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L173] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] CALL assume_abort_if_not(var_1_32 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L174] RET assume_abort_if_not(var_1_32 <= 255) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L175] CALL assume_abort_if_not(var_1_32 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L175] RET assume_abort_if_not(var_1_32 != 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=0, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L176] var_1_34 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_34 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L177] RET assume_abort_if_not(var_1_34 >= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L178] CALL assume_abort_if_not(var_1_34 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L178] RET assume_abort_if_not(var_1_34 <= 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_36=17/2, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L179] var_1_36 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L180] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 4611686.018427382800e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_37=15/2, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L181] var_1_37 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L182] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_38=16/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L183] var_1_38 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_38 >= -461168.6018427382800e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 4611686.018427382800e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L184] RET assume_abort_if_not((var_1_38 >= -461168.6018427382800e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 4611686.018427382800e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=5, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L185] var_1_40 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L186] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L187] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L187] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=4, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L188] var_1_43 = __VERIFIER_nondet_uchar() [L189] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L189] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L190] CALL assume_abort_if_not(var_1_43 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L190] RET assume_abort_if_not(var_1_43 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=64, var_1_45=-25, var_1_8=1, var_1_9=10] [L191] var_1_44 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L192] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L193] CALL assume_abort_if_not(var_1_44 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L193] RET assume_abort_if_not(var_1_44 <= 127) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L211] RET updateVariables() [L212] CALL step() [L63] unsigned char stepLocal_1 = last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16); [L64] signed long int stepLocal_0 = last_1_var_1_20 * last_1_var_1_20; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_0=1, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L65] COND FALSE !(stepLocal_0 == last_1_var_1_14) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L70] unsigned long int stepLocal_6 = ((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L71] EXPR 256u << last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_6=0, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=1, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L71] COND TRUE stepLocal_6 <= (256u << last_1_var_1_16) [L72] var_1_16 = ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L74] unsigned char stepLocal_5 = var_1_16 != var_1_16; [L75] unsigned char stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_4=1, stepLocal_5=0, var_1_10=199/2, var_1_14=32, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L76] COND TRUE (! var_1_1) || stepLocal_4 [L77] var_1_10 = (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_13=0, var_1_14=32, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=1, var_1_21=0, var_1_22=1/2, var_1_23=100, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L85] var_1_20 = var_1_21 [L86] var_1_22 = var_1_12 [L87] var_1_23 = var_1_21 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L88] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L91] EXPR (var_1_16 / var_1_15) & var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=32, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L91] COND TRUE ((var_1_16 / var_1_15) & var_1_16) >= var_1_20 [L92] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L97] unsigned char stepLocal_3 = var_1_20 != var_1_14; [L98] signed long int stepLocal_2 = (((var_1_16) < (0)) ? (var_1_16) : (0)); VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_3=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L99] COND TRUE (var_1_1 || (var_1_16 <= var_1_14)) || stepLocal_3 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_2=0, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=10] [L100] COND TRUE stepLocal_2 <= (-5 + var_1_16) [L101] var_1_9 = var_1_16 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=2, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=7] [L104] COND FALSE !(\read(var_1_1)) [L111] var_1_24 = var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=7] [L113] COND TRUE var_1_23 >= var_1_20 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=8, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=7] [L114] COND FALSE !((4 % var_1_32) > var_1_23) [L117] var_1_31 = var_1_32 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=7] [L120] var_1_33 = var_1_34 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_35=162/5, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=7] [L121] COND TRUE var_1_16 >= var_1_23 [L122] var_1_35 = ((var_1_36 - var_1_37) + var_1_38) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=7] [L124] COND FALSE !(var_1_1 || var_1_1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=-2, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=7] [L127] COND TRUE \read(var_1_34) [L128] var_1_41 = ((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=10, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=7] [L132] COND TRUE var_1_10 <= ((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))) [L133] var_1_42 = (((((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) < 0 ) ? -((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))) : ((((var_1_43 + var_1_44) < 0 ) ? -(var_1_43 + var_1_44) : (var_1_43 + var_1_44))))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=7] [L135] COND TRUE (var_1_14 / var_1_32) >= var_1_23 VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=-25, var_1_8=1, var_1_9=7] [L136] COND TRUE \read(var_1_34) [L137] var_1_45 = (((((var_1_14) < (var_1_43)) ? (var_1_14) : (var_1_43))) - var_1_44) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, stepLocal_1=1, stepLocal_5=0, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=7] [L212] RET step() [L213] CALL, EXPR property() [L203] EXPR (((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128)))) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=7] [L203] EXPR ((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=7] [L203-L204] return (((((((((last_1_var_1_20 * last_1_var_1_20) == last_1_var_1_14) ? (((last_1_var_1_14 > (last_1_var_1_16 - last_1_var_1_16)) && last_1_var_1_1) ? (var_1_1 == ((unsigned char) var_1_8)) : 1) : 1) && (((var_1_1 || (var_1_16 <= var_1_14)) || (var_1_20 != var_1_14)) ? ((((((var_1_16) < (0)) ? (var_1_16) : (0))) <= (-5 + var_1_16)) ? (var_1_9 == ((unsigned long int) var_1_16)) : 1) : 1)) && (((! var_1_1) || var_1_8) ? (var_1_10 == ((float) (((((var_1_11 + var_1_12)) < (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? ((var_1_11 + var_1_12)) : (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13)))))))) : (((var_1_11 < var_1_12) || (var_1_16 != var_1_16)) ? (var_1_10 == ((float) var_1_13)) : (var_1_10 == ((float) var_1_12))))) && (var_1_1 ? (var_1_14 == ((signed short int) ((((var_1_23) > (var_1_16)) ? (var_1_23) : (var_1_16))))) : ((((var_1_16 / var_1_15) & var_1_16) >= var_1_20) ? (var_1_14 == ((signed short int) var_1_16)) : (var_1_14 == ((signed short int) -128))))) && (((((((var_1_15) > (last_1_var_1_9)) ? (var_1_15) : (last_1_var_1_9))) / var_1_17) <= (256u << last_1_var_1_16)) ? (var_1_16 == ((unsigned char) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : 1)) && (var_1_20 == ((signed char) var_1_21))) && (var_1_22 == ((float) var_1_12))) && (var_1_23 == ((signed char) var_1_21)) ; [L213] RET, EXPR property() [L213] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=7] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=32, last_1_var_1_16=1, last_1_var_1_1=0, last_1_var_1_20=1, last_1_var_1_9=10, var_1_10=2, var_1_12=3, var_1_13=0, var_1_14=7, var_1_15=8, var_1_16=7, var_1_17=12, var_1_18=0, var_1_19=7, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=3, var_1_23=0, var_1_24=0, var_1_31=4, var_1_32=4, var_1_33=1, var_1_34=1, var_1_39=16, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_45=0, var_1_8=1, var_1_9=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 7, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1644 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1613 mSDsluCounter, 5252 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3775 mSDsCounter, 624 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3093 IncrementalHoareTripleChecker+Invalid, 3717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 624 mSolverCounterUnsat, 1477 mSDtfsCounter, 3093 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 419 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=707occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 792 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1866 NumberOfCodeBlocks, 1866 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1648 ConstructedInterpolants, 0 QuantifiedInterpolants, 3392 SizeOfPredicates, 5 NumberOfNonLiveVariables, 491 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 14745/14880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 10:53:28,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-53.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 8077ea0a7b69b238ec123c66b3e265976e596d9fa67f90c1cfc30532a2641db9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:53:30,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:53:30,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 10:53:30,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:53:30,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:53:30,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:53:30,426 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:53:30,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:53:30,427 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:53:30,427 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:53:30,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:53:30,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:53:30,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:53:30,429 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:53:30,429 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:53:30,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:53:30,429 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:53:30,429 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:53:30,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:53:30,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:53:30,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:53:30,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:53:30,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:53:30,430 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 10:53:30,430 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 10:53:30,430 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 10:53:30,430 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:53:30,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:53:30,430 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:53:30,430 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:53:30,431 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:53:30,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:53:30,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:53:30,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:53:30,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:53:30,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:53:30,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:53:30,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:53:30,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:53:30,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:53:30,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:53:30,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:53:30,432 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:53:30,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:53:30,432 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 10:53:30,433 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 10:53:30,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:53:30,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:53:30,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:53:30,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:53:30,433 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 -> 8077ea0a7b69b238ec123c66b3e265976e596d9fa67f90c1cfc30532a2641db9 [2025-01-09 10:53:30,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:53:30,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:53:30,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:53:30,672 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:53:30,672 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:53:30,673 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-pe-co_file-53.i [2025-01-09 10:53:31,864 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f1ae1551/ffc24b075d744d4b88d436ee85953a91/FLAGc3e2b196b [2025-01-09 10:53:32,068 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:53:32,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i [2025-01-09 10:53:32,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f1ae1551/ffc24b075d744d4b88d436ee85953a91/FLAGc3e2b196b [2025-01-09 10:53:32,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f1ae1551/ffc24b075d744d4b88d436ee85953a91 [2025-01-09 10:53:32,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:53:32,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:53:32,090 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:53:32,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:53:32,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:53:32,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f1bb135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32, skipping insertion in model container [2025-01-09 10:53:32,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:53:32,212 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-pe-co_file-53.i[919,932] [2025-01-09 10:53:32,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:53:32,306 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:53:32,315 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-pe-co_file-53.i[919,932] [2025-01-09 10:53:32,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:53:32,374 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:53:32,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32 WrapperNode [2025-01-09 10:53:32,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:53:32,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:53:32,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:53:32,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:53:32,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,414 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2025-01-09 10:53:32,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:53:32,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:53:32,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:53:32,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:53:32,422 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,437 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 10:53:32,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,444 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,444 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,450 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:53:32,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:53:32,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:53:32,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:53:32,456 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (1/1) ... [2025-01-09 10:53:32,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:53:32,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:53:32,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:53:32,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:53:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:53:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 10:53:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:53:32,506 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:53:32,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:53:32,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:53:32,584 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:53:32,585 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:53:33,610 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 10:53:33,611 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:53:33,621 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:53:33,622 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:53:33,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:53:33 BoogieIcfgContainer [2025-01-09 10:53:33,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:53:33,623 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:53:33,623 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:53:33,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:53:33,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:53:32" (1/3) ... [2025-01-09 10:53:33,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2308d145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:53:33, skipping insertion in model container [2025-01-09 10:53:33,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:53:32" (2/3) ... [2025-01-09 10:53:33,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2308d145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:53:33, skipping insertion in model container [2025-01-09 10:53:33,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:53:33" (3/3) ... [2025-01-09 10:53:33,628 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i [2025-01-09 10:53:33,637 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:53:33,639 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-53.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:53:33,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:53:33,687 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;@4a3b457b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:53:33,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:53:33,689 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 10:53:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 10:53:33,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:33,697 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:33,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:33,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:33,701 INFO L85 PathProgramCache]: Analyzing trace with hash -394017687, now seen corresponding path program 1 times [2025-01-09 10:53:33,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:53:33,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875756954] [2025-01-09 10:53:33,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:33,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:33,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:53:33,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:53:33,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 10:53:33,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 10:53:34,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 10:53:34,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:34,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:34,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:53:34,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:53:34,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 476 proven. 0 refuted. 0 times theorem prover too weak. 1384 trivial. 0 not checked. [2025-01-09 10:53:34,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:53:34,114 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:53:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875756954] [2025-01-09 10:53:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875756954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:53:34,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:53:34,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:53:34,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148333616] [2025-01-09 10:53:34,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:53:34,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:53:34,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:53:34,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:53:34,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:53:34,132 INFO L87 Difference]: Start difference. First operand has 92 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 10:53:34,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:34,156 INFO L93 Difference]: Finished difference Result 178 states and 316 transitions. [2025-01-09 10:53:34,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:53:34,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2025-01-09 10:53:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:34,163 INFO L225 Difference]: With dead ends: 178 [2025-01-09 10:53:34,163 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 10:53:34,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:53:34,167 INFO L435 NwaCegarLoop]: 140 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, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:34,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:53:34,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 10:53:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 10:53:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 10:53:34,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 140 transitions. [2025-01-09 10:53:34,211 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 140 transitions. Word has length 199 [2025-01-09 10:53:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:34,211 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 140 transitions. [2025-01-09 10:53:34,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-01-09 10:53:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 140 transitions. [2025-01-09 10:53:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-09 10:53:34,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:34,214 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:34,229 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 (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:53:34,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:34,418 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:34,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:34,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1204928119, now seen corresponding path program 1 times [2025-01-09 10:53:34,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:53:34,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119550871] [2025-01-09 10:53:34,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:34,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:34,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:53:34,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:53:34,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 10:53:34,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 10:53:34,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 10:53:34,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:34,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:34,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 10:53:34,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:53:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:53:35,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:53:35,112 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:53:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119550871] [2025-01-09 10:53:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119550871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:53:35,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:53:35,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:53:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243030348] [2025-01-09 10:53:35,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:53:35,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:53:35,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:53:35,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:53:35,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:35,114 INFO L87 Difference]: Start difference. First operand 89 states and 140 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:35,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:35,459 INFO L93 Difference]: Finished difference Result 257 states and 406 transitions. [2025-01-09 10:53:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:53:35,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2025-01-09 10:53:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:35,467 INFO L225 Difference]: With dead ends: 257 [2025-01-09 10:53:35,467 INFO L226 Difference]: Without dead ends: 171 [2025-01-09 10:53:35,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:35,468 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 36 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:35,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 252 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:53:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-01-09 10:53:35,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-01-09 10:53:35,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 10:53:35,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 264 transitions. [2025-01-09 10:53:35,511 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 264 transitions. Word has length 199 [2025-01-09 10:53:35,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:35,511 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 264 transitions. [2025-01-09 10:53:35,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:35,511 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 264 transitions. [2025-01-09 10:53:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 10:53:35,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:35,514 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:35,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 10:53:35,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:35,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:35,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:35,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1355391738, now seen corresponding path program 1 times [2025-01-09 10:53:35,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:53:35,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76977680] [2025-01-09 10:53:35,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:35,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:35,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:53:35,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:53:35,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 10:53:35,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 10:53:36,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 10:53:36,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:36,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:36,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 10:53:36,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:53:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:53:36,063 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:53:36,063 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:53:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76977680] [2025-01-09 10:53:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76977680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:53:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:53:36,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:53:36,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439167595] [2025-01-09 10:53:36,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:53:36,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:53:36,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:53:36,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:53:36,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:36,065 INFO L87 Difference]: Start difference. First operand 169 states and 264 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:36,743 INFO L93 Difference]: Finished difference Result 425 states and 663 transitions. [2025-01-09 10:53:36,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:53:36,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2025-01-09 10:53:36,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:36,745 INFO L225 Difference]: With dead ends: 425 [2025-01-09 10:53:36,746 INFO L226 Difference]: Without dead ends: 259 [2025-01-09 10:53:36,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:36,747 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 125 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:36,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 374 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:53:36,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-09 10:53:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 171. [2025-01-09 10:53:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 10:53:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 266 transitions. [2025-01-09 10:53:36,766 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 266 transitions. Word has length 200 [2025-01-09 10:53:36,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:36,766 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 266 transitions. [2025-01-09 10:53:36,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 266 transitions. [2025-01-09 10:53:36,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 10:53:36,771 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:36,771 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:36,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 10:53:36,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:36,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:36,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1918507204, now seen corresponding path program 1 times [2025-01-09 10:53:36,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:53:36,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439093598] [2025-01-09 10:53:36,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:36,974 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:36,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:53:36,976 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:53:36,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 10:53:37,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 10:53:37,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 10:53:37,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:37,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:37,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 10:53:37,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:53:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 960 proven. 45 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2025-01-09 10:53:37,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:53:37,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-01-09 10:53:37,790 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:53:37,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439093598] [2025-01-09 10:53:37,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439093598] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:53:37,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:53:37,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-01-09 10:53:37,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574749592] [2025-01-09 10:53:37,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:53:37,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:53:37,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:53:37,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:53:37,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 10:53:37,795 INFO L87 Difference]: Start difference. First operand 171 states and 266 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 10:53:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:39,344 INFO L93 Difference]: Finished difference Result 518 states and 787 transitions. [2025-01-09 10:53:39,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 10:53:39,344 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 200 [2025-01-09 10:53:39,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:39,349 INFO L225 Difference]: With dead ends: 518 [2025-01-09 10:53:39,349 INFO L226 Difference]: Without dead ends: 350 [2025-01-09 10:53:39,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=268, Invalid=724, Unknown=0, NotChecked=0, Total=992 [2025-01-09 10:53:39,350 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 376 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:39,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 716 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:53:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-01-09 10:53:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 177. [2025-01-09 10:53:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 10:53:39,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 269 transitions. [2025-01-09 10:53:39,407 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 269 transitions. Word has length 200 [2025-01-09 10:53:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:39,408 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 269 transitions. [2025-01-09 10:53:39,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 10:53:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 269 transitions. [2025-01-09 10:53:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 10:53:39,409 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:39,410 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:39,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 10:53:39,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:39,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:39,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1637582100, now seen corresponding path program 1 times [2025-01-09 10:53:39,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:53:39,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793439881] [2025-01-09 10:53:39,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:39,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:39,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:53:39,619 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:53:39,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 10:53:39,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 10:53:39,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 10:53:39,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:39,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:39,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:53:39,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:53:40,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:53:40,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:53:40,614 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:53:40,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793439881] [2025-01-09 10:53:40,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793439881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:53:40,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:53:40,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:53:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449866453] [2025-01-09 10:53:40,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:53:40,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:53:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:53:40,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:53:40,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:53:40,615 INFO L87 Difference]: Start difference. First operand 177 states and 269 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:41,131 INFO L93 Difference]: Finished difference Result 438 states and 663 transitions. [2025-01-09 10:53:41,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:53:41,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2025-01-09 10:53:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:41,140 INFO L225 Difference]: With dead ends: 438 [2025-01-09 10:53:41,140 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 10:53:41,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:53:41,141 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 70 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:41,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 461 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:53:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 10:53:41,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 236. [2025-01-09 10:53:41,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 136 states have internal predecessors, (171), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 10:53:41,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 357 transitions. [2025-01-09 10:53:41,176 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 357 transitions. Word has length 200 [2025-01-09 10:53:41,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:41,178 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 357 transitions. [2025-01-09 10:53:41,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 357 transitions. [2025-01-09 10:53:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-01-09 10:53:41,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:41,180 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:41,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 10:53:41,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:41,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:41,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:41,382 INFO L85 PathProgramCache]: Analyzing trace with hash -721176517, now seen corresponding path program 1 times [2025-01-09 10:53:41,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:53:41,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2000224503] [2025-01-09 10:53:41,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:41,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:41,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:53:41,385 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:53:41,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 10:53:41,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 10:53:41,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 10:53:41,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:41,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:41,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 10:53:41,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:53:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 10:53:41,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:53:41,750 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:53:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2000224503] [2025-01-09 10:53:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2000224503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:53:41,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:53:41,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:53:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924378708] [2025-01-09 10:53:41,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:53:41,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:53:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:53:41,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:53:41,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:41,752 INFO L87 Difference]: Start difference. First operand 236 states and 357 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:53:42,164 INFO L93 Difference]: Finished difference Result 415 states and 629 transitions. [2025-01-09 10:53:42,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:53:42,165 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2025-01-09 10:53:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:53:42,166 INFO L225 Difference]: With dead ends: 415 [2025-01-09 10:53:42,166 INFO L226 Difference]: Without dead ends: 241 [2025-01-09 10:53:42,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:53:42,167 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 129 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:53:42,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 306 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:53:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-09 10:53:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 236. [2025-01-09 10:53:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 136 states have (on average 1.2426470588235294) internal successors, (169), 136 states have internal predecessors, (169), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 10:53:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 355 transitions. [2025-01-09 10:53:42,187 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 355 transitions. Word has length 201 [2025-01-09 10:53:42,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:53:42,188 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 355 transitions. [2025-01-09 10:53:42,188 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 10:53:42,188 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 355 transitions. [2025-01-09 10:53:42,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 10:53:42,189 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:53:42,189 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:53:42,202 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 (7)] Ended with exit code 0 [2025-01-09 10:53:42,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:42,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:53:42,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:53:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash 373166624, now seen corresponding path program 1 times [2025-01-09 10:53:42,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:53:42,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399896502] [2025-01-09 10:53:42,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:53:42,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 10:53:42,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:53:42,393 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 10:53:42,395 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 (8)] Waiting until timeout for monitored process [2025-01-09 10:53:42,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 10:53:42,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 10:53:42,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:53:42,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:53:42,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 10:53:42,737 INFO L279 TraceCheckSpWp]: Computing forward predicates...