./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 812e733299b6ea30eb7cd91dc9b53a661a67be71ff0b82204409e990f9b6f3ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:04:29,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:04:29,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 23:04:29,196 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:04:29,196 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:04:29,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:04:29,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:04:29,219 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:04:29,219 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:04:29,219 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:04:29,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:04:29,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:04:29,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:04:29,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:04:29,221 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:04:29,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:04:29,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:04:29,221 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:04:29,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 23:04:29,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:04:29,222 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:04:29,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:04:29,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:04:29,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:04:29,223 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:04:29,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:04:29,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 23:04:29,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 23:04:29,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:04:29,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:04:29,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:04:29,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:04:29,223 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/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 -> 812e733299b6ea30eb7cd91dc9b53a661a67be71ff0b82204409e990f9b6f3ee [2025-03-03 23:04:29,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:04:29,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:04:29,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:04:29,475 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:04:29,475 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:04:29,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i [2025-03-03 23:04:30,593 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90731ffe7/484eb161d48f421e8fd6212f5a9f3d4c/FLAGd6ebfb384 [2025-03-03 23:04:30,852 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:04:30,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i [2025-03-03 23:04:30,860 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90731ffe7/484eb161d48f421e8fd6212f5a9f3d4c/FLAGd6ebfb384 [2025-03-03 23:04:30,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90731ffe7/484eb161d48f421e8fd6212f5a9f3d4c [2025-03-03 23:04:30,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:04:30,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:04:30,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:04:30,876 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:04:30,878 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:04:30,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:30" (1/1) ... [2025-03-03 23:04:30,880 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a95991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:30, skipping insertion in model container [2025-03-03 23:04:30,880 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:30" (1/1) ... [2025-03-03 23:04:30,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:04:31,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i[916,929] [2025-03-03 23:04:31,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:04:31,114 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:04:31,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i[916,929] [2025-03-03 23:04:31,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:04:31,190 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:04:31,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31 WrapperNode [2025-03-03 23:04:31,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:04:31,193 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:04:31,193 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:04:31,193 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:04:31,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,250 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-03 23:04:31,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:04:31,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:04:31,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:04:31,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:04:31,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,294 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-03-03 23:04:31,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,320 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:04:31,335 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:04:31,335 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:04:31,335 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:04:31,336 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (1/1) ... [2025-03-03 23:04:31,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:04:31,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:31,364 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:04:31,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:04:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:04:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:04:31,383 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:04:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 23:04:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:04:31,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:04:31,437 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:04:31,438 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:04:31,821 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 23:04:31,821 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:04:31,833 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:04:31,835 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:04:31,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:31 BoogieIcfgContainer [2025-03-03 23:04:31,836 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:04:31,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:04:31,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:04:31,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:04:31,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:04:30" (1/3) ... [2025-03-03 23:04:31,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d74e810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:31, skipping insertion in model container [2025-03-03 23:04:31,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:31" (2/3) ... [2025-03-03 23:04:31,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d74e810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:04:31, skipping insertion in model container [2025-03-03 23:04:31,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:31" (3/3) ... [2025-03-03 23:04:31,843 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-91.i [2025-03-03 23:04:31,854 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:04:31,857 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-91.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:04:31,899 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:04:31,909 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;@4456dba4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:04:31,909 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:04:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:04:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 23:04:31,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:31,921 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:04:31,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:31,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:31,925 INFO L85 PathProgramCache]: Analyzing trace with hash 670360973, now seen corresponding path program 1 times [2025-03-03 23:04:31,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482509238] [2025-03-03 23:04:31,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:31,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:32,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:04:32,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:04:32,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:32,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 23:04:32,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:32,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482509238] [2025-03-03 23:04:32,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482509238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:04:32,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295481007] [2025-03-03 23:04:32,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:32,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:32,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:32,190 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:04:32,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 23:04:32,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:04:32,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:04:32,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:32,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:32,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:04:32,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:04:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 23:04:32,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:04:32,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295481007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:04:32,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 23:04:32,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 23:04:32,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805386832] [2025-03-03 23:04:32,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:04:32,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:04:32,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:32,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:04:32,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:04:32,389 INFO L87 Difference]: Start difference. First operand has 80 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:04:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:32,408 INFO L93 Difference]: Finished difference Result 154 states and 264 transitions. [2025-03-03 23:04:32,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:04:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 23:04:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:32,414 INFO L225 Difference]: With dead ends: 154 [2025-03-03 23:04:32,414 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 23:04:32,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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-03-03 23:04:32,418 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:32,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:04:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 23:04:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 23:04:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:04:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-03-03 23:04:32,448 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 165 [2025-03-03 23:04:32,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:32,448 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-03-03 23:04:32,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:04:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-03-03 23:04:32,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 23:04:32,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:32,451 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:04:32,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 23:04:32,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 23:04:32,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:32,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:32,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1378882098, now seen corresponding path program 1 times [2025-03-03 23:04:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:32,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987752595] [2025-03-03 23:04:32,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:32,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:32,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:04:32,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:04:32,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:32,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 23:04:33,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987752595] [2025-03-03 23:04:33,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987752595] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:04:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473646204] [2025-03-03 23:04:33,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:33,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:33,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:33,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:04:33,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 23:04:33,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:04:33,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:04:33,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:33,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:33,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 23:04:33,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:04:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 684 proven. 9 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-03 23:04:33,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:04:34,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 63 proven. 9 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 23:04:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473646204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:04:34,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:04:34,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 16 [2025-03-03 23:04:34,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508499058] [2025-03-03 23:04:34,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:04:34,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 23:04:34,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:34,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 23:04:34,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2025-03-03 23:04:34,155 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2025-03-03 23:04:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:35,149 INFO L93 Difference]: Finished difference Result 278 states and 408 transitions. [2025-03-03 23:04:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 23:04:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 165 [2025-03-03 23:04:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:35,152 INFO L225 Difference]: With dead ends: 278 [2025-03-03 23:04:35,152 INFO L226 Difference]: Without dead ends: 204 [2025-03-03 23:04:35,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=990, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 23:04:35,154 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 462 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:35,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 476 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 23:04:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-03 23:04:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 128. [2025-03-03 23:04:35,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 77 states have internal predecessors, (91), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 23:04:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 183 transitions. [2025-03-03 23:04:35,179 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 183 transitions. Word has length 165 [2025-03-03 23:04:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:35,180 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 183 transitions. [2025-03-03 23:04:35,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 5 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2025-03-03 23:04:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 183 transitions. [2025-03-03 23:04:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 23:04:35,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:35,182 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:04:35,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 23:04:35,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 23:04:35,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:35,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:35,383 INFO L85 PathProgramCache]: Analyzing trace with hash 788319065, now seen corresponding path program 1 times [2025-03-03 23:04:35,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:35,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499748313] [2025-03-03 23:04:35,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:35,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:35,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 23:04:35,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 23:04:35,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:35,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:35,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 23:04:35,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 23:04:35,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499748313] [2025-03-03 23:04:35,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499748313] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:04:35,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854011972] [2025-03-03 23:04:35,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:35,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:35,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:35,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:04:35,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 23:04:36,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 23:04:36,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 23:04:36,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:36,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:04:36,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 23:04:36,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:04:36,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 36 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-03-03 23:04:36,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:04:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 23:04:36,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854011972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:04:36,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 23:04:36,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 23:04:36,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416764748] [2025-03-03 23:04:36,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 23:04:36,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 23:04:36,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 23:04:36,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 23:04:36,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:04:36,453 INFO L87 Difference]: Start difference. First operand 128 states and 183 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 23:04:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:04:37,238 INFO L93 Difference]: Finished difference Result 419 states and 569 transitions. [2025-03-03 23:04:37,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-03 23:04:37,239 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 166 [2025-03-03 23:04:37,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:04:37,245 INFO L225 Difference]: With dead ends: 419 [2025-03-03 23:04:37,245 INFO L226 Difference]: Without dead ends: 333 [2025-03-03 23:04:37,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 330 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 23:04:37,247 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 310 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 23:04:37,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 876 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 23:04:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-03 23:04:37,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 229. [2025-03-03 23:04:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 143 states have (on average 1.167832167832168) internal successors, (167), 144 states have internal predecessors, (167), 71 states have call successors, (71), 14 states have call predecessors, (71), 14 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-03 23:04:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 309 transitions. [2025-03-03 23:04:37,301 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 309 transitions. Word has length 166 [2025-03-03 23:04:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:04:37,301 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 309 transitions. [2025-03-03 23:04:37,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 23:04:37,302 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 309 transitions. [2025-03-03 23:04:37,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 23:04:37,303 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:04:37,303 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:04:37,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 23:04:37,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:37,505 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:04:37,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:04:37,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1675822746, now seen corresponding path program 1 times [2025-03-03 23:04:37,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 23:04:37,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585446887] [2025-03-03 23:04:37,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:37,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 23:04:37,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 23:04:37,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 23:04:37,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:37,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 23:04:37,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291465029] [2025-03-03 23:04:37,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:04:37,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:37,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:37,668 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 23:04:37,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 23:04:37,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 23:04:37,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 23:04:37,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:37,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:04:37,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 23:04:37,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 23:04:37,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 23:04:37,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:04:37,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 23:04:37,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 23:04:37,990 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 23:04:37,991 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 23:04:37,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 23:04:38,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 23:04:38,195 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-03 23:04:38,291 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 23:04:38,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 11:04:38 BoogieIcfgContainer [2025-03-03 23:04:38,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 23:04:38,298 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 23:04:38,298 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 23:04:38,298 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 23:04:38,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:04:31" (3/4) ... [2025-03-03 23:04:38,300 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 23:04:38,301 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 23:04:38,302 INFO L158 Benchmark]: Toolchain (without parser) took 7427.05ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.1MB in the beginning and 57.2MB in the end (delta: 53.9MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2025-03-03 23:04:38,302 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 23:04:38,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.83ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 93.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 23:04:38,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.55ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 86.4MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:04:38,303 INFO L158 Benchmark]: Boogie Preprocessor took 81.58ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 70.3MB in the end (delta: 16.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:04:38,303 INFO L158 Benchmark]: IcfgBuilder took 501.09ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 104.0MB in the end (delta: -34.2MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2025-03-03 23:04:38,304 INFO L158 Benchmark]: TraceAbstraction took 6460.14ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 104.0MB in the beginning and 57.2MB in the end (delta: 46.8MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2025-03-03 23:04:38,304 INFO L158 Benchmark]: Witness Printer took 3.07ms. Allocated memory is still 176.2MB. Free memory was 57.2MB in the beginning and 57.2MB in the end (delta: 21.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 23:04:38,305 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 201.3MB. Free memory is still 122.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.83ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 93.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.55ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 86.4MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.58ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 70.3MB in the end (delta: 16.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 501.09ms. Allocated memory is still 142.6MB. Free memory was 69.8MB in the beginning and 104.0MB in the end (delta: -34.2MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6460.14ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 104.0MB in the beginning and 57.2MB in the end (delta: 46.8MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. * Witness Printer took 3.07ms. Allocated memory is still 176.2MB. Free memory was 57.2MB in the beginning and 57.2MB in the end (delta: 21.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 145, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 168. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 200; [L23] unsigned char var_1_4 = 128; [L24] unsigned char var_1_5 = 16; [L25] unsigned char var_1_6 = 16; [L26] signed short int var_1_7 = -8; [L27] signed char var_1_9 = 0; [L28] signed char var_1_10 = -4; [L29] double var_1_11 = 2.25; [L30] double var_1_12 = 199.3; [L31] double var_1_13 = 7.2; [L32] unsigned long int var_1_14 = 10; [L33] signed short int var_1_15 = -4; [L34] unsigned char var_1_16 = 0; [L35] signed short int var_1_19 = 256; [L36] unsigned char var_1_20 = 0; [L37] signed long int var_1_21 = -1; [L38] unsigned char var_1_22 = 0; [L39] unsigned char var_1_23 = 0; [L40] unsigned char var_1_24 = 0; [L41] unsigned short int var_1_25 = 100; [L42] double var_1_26 = 15.125; [L43] double var_1_27 = 2.3; [L44] double var_1_28 = 999.25; [L45] double var_1_29 = 1.75; [L46] unsigned short int var_1_30 = 43183; [L47] unsigned long int var_1_31 = 100000; [L48] double var_1_32 = 7.4; [L49] double var_1_33 = 31.125; [L50] signed short int var_1_34 = -128; [L51] signed char var_1_35 = -1; [L52] signed char last_1_var_1_9 = 0; [L53] signed short int last_1_var_1_19 = 256; [L54] unsigned long int last_1_var_1_31 = 100000; VAL [isInitial=0, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L172] last_1_var_1_9 = var_1_9 [L173] last_1_var_1_19 = var_1_19 [L174] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L130] var_1_4 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L131] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L132] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=16, var_1_6=16, var_1_7=-8, var_1_9=0] [L133] var_1_5 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_6=16, var_1_7=-8, var_1_9=0] [L134] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_6=16, var_1_7=-8, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=16, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=16, var_1_7=-8, var_1_9=0] [L135] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=16, var_1_7=-8, var_1_9=0] [L136] var_1_6 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_7=-8, var_1_9=0] [L137] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_7=-8, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L138] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=-4, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L139] var_1_10 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L141] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_12=1993/10, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L143] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_13=36/5, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L144] var_1_13 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L145] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=0, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L147] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L148] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L149] var_1_23 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L150] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L151] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=0, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L153] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L154] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=121/8, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L155] var_1_26 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L156] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_27=23/10, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L157] var_1_27 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L158] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_28=3997/4, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L159] var_1_28 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L160] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_29=7/4, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L161] var_1_29 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L162] RET assume_abort_if_not((var_1_29 >= -922337.2036854776000e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854776000e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_29 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L163] RET assume_abort_if_not(var_1_29 != 0.0F) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=43183, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L164] var_1_30 = __VERIFIER_nondet_ushort() [L165] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L165] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L166] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L166] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_33=249/8, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L167] var_1_33 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L168] RET assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_33 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L169] RET assume_abort_if_not(var_1_33 != 0.0F) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L185] RET updateVariables() [L186] CALL step() [L58] signed long int stepLocal_0 = last_1_var_1_19; VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_0=256, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=200, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L59] COND TRUE last_1_var_1_31 != stepLocal_0 [L60] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=-128, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L64] var_1_34 = var_1_1 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=0, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=1, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L65] COND TRUE var_1_10 == var_1_34 [L66] var_1_20 = (var_1_6 + var_1_5) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=10, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=1, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L68] var_1_14 = ((((((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) > (var_1_1)) ? (((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) : (var_1_1))) [L69] unsigned char stepLocal_4 = var_1_28 == (var_1_27 + var_1_29); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_4=0, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=1, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L70] COND FALSE !((var_1_1 > var_1_30) && stepLocal_4) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_30=-32769, var_1_31=100000, var_1_32=37/5, var_1_34=1, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L73] COND TRUE (var_1_29 / var_1_33) <= (- (var_1_12 + 10.1)) [L74] var_1_32 = var_1_26 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L79] unsigned long int stepLocal_2 = var_1_14 - var_1_5; [L80] unsigned long int stepLocal_1 = (((var_1_14) < ((var_1_5 / var_1_4))) ? (var_1_14) : ((var_1_5 / var_1_4))); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_1=0, stepLocal_2=-125, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=0] [L81] COND FALSE !(stepLocal_1 < (last_1_var_1_9 * (var_1_6 + var_1_20))) [L86] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-125, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=1] [L88] COND FALSE !(! var_1_24) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-125, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=-8, var_1_9=1] [L91] var_1_7 = ((((((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) < 0 ) ? -(((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) : (((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-125, var_1_10=1, var_1_11=9/4, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=1, var_1_9=1] [L92] COND TRUE ((var_1_10 / var_1_4) / 1) <= var_1_1 [L93] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-125, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-1, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=-1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=1, var_1_9=1] [L95] var_1_35 = var_1_10 [L96] var_1_21 = (var_1_6 - ((((var_1_5) > (var_1_20)) ? (var_1_5) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-125, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=100, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=1, var_1_9=1] [L97] COND FALSE !(var_1_13 <= ((var_1_26 + 128.65) - ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28))))) [L104] var_1_25 = (var_1_30 - ((((var_1_20) > (128)) ? (var_1_20) : (128)))) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-125, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=1, var_1_9=1] [L106] unsigned char stepLocal_3 = var_1_13 < (var_1_32 * var_1_12); VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-125, stepLocal_3=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=1, var_1_9=1] [L107] COND FALSE !(stepLocal_3 && var_1_16) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-125, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=1, var_1_9=1] [L110] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-125, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=1, var_1_9=1] [L117] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, stepLocal_2=-125, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=1, var_1_9=1] [L186] RET step() [L187] CALL, EXPR property() [L177-L178] return (((((((((((((((last_1_var_1_31 != last_1_var_1_19) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (((((50) > (var_1_5)) ? (50) : (var_1_5))) + var_1_6)))) && (var_1_7 == ((signed short int) ((((((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) < 0 ) ? -(((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1) : (((((0) > (var_1_6)) ? (0) : (var_1_6))) - var_1_1)))))) && ((((((var_1_14) < ((var_1_5 / var_1_4))) ? (var_1_14) : ((var_1_5 / var_1_4)))) < (last_1_var_1_9 * (var_1_6 + var_1_20))) ? ((var_1_20 < (var_1_14 - var_1_5)) ? (var_1_9 == ((signed char) var_1_10)) : 1) : (var_1_9 == ((signed char) var_1_10)))) && ((((var_1_10 / var_1_4) / 1) <= var_1_1) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (var_1_14 == ((unsigned long int) ((((((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) > (var_1_1)) ? (((((var_1_6) > (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))) ? (var_1_6) : (((((var_1_1) < (var_1_4)) ? (var_1_1) : (var_1_4))))))) : (var_1_1)))))) && (var_1_22 ? (var_1_22 ? (var_1_15 == ((signed short int) ((((((((var_1_9) > (1000)) ? (var_1_9) : (1000))) < 0 ) ? -((((var_1_9) > (1000)) ? (var_1_9) : (1000))) : ((((var_1_9) > (1000)) ? (var_1_9) : (1000))))) + var_1_4))) : (var_1_15 == ((signed short int) ((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9)))))) : 1)) && (var_1_22 ? ((var_1_20 > var_1_15) ? (var_1_19 == ((signed short int) (var_1_34 + var_1_10))) : ((var_1_15 < var_1_4) ? (var_1_19 == ((signed short int) var_1_4)) : (var_1_19 == ((signed short int) var_1_5)))) : 1)) && ((var_1_10 == var_1_34) ? (var_1_20 == ((unsigned char) (var_1_6 + var_1_5))) : 1)) && (var_1_21 == ((signed long int) (var_1_6 - ((((var_1_5) > (var_1_20)) ? (var_1_5) : (var_1_20))))))) && (((var_1_13 < (var_1_32 * var_1_12)) && var_1_16) ? (var_1_22 == ((unsigned char) (var_1_23 && var_1_24))) : 1)) && ((var_1_13 <= ((var_1_26 + 128.65) - ((((var_1_27) > (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (((var_1_13 / var_1_29) < var_1_28) ? (var_1_25 == ((unsigned short int) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_25 == ((unsigned short int) (((((var_1_14 + var_1_20)) < (((((var_1_20) > (var_1_5)) ? (var_1_20) : (var_1_5))))) ? ((var_1_14 + var_1_20)) : (((((var_1_20) > (var_1_5)) ? (var_1_20) : (var_1_5))))))))) : (var_1_25 == ((unsigned short int) (var_1_30 - ((((var_1_20) > (128)) ? (var_1_20) : (128)))))))) && ((! var_1_24) ? (var_1_31 == ((unsigned long int) (var_1_34 + ((((var_1_20) < (var_1_6)) ? (var_1_20) : (var_1_6)))))) : 1)) && (((var_1_1 > var_1_30) && (var_1_28 == (var_1_27 + var_1_29))) ? (var_1_32 == ((double) ((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) : (((var_1_29 / var_1_33) <= (- (var_1_12 + 10.1))) ? (var_1_32 == ((double) var_1_26)) : (var_1_32 == ((double) var_1_26))))) && (var_1_34 == ((signed short int) var_1_1))) && (var_1_35 == ((signed char) var_1_10)) ; VAL [\result=0, isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=1, var_1_9=1] [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=256, last_1_var_1_31=100000, last_1_var_1_9=0, var_1_10=1, var_1_11=3, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=-4, var_1_16=1, var_1_19=256, var_1_1=1, var_1_20=129, var_1_21=-127, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=32638, var_1_26=2, var_1_30=-32769, var_1_31=100000, var_1_32=2, var_1_34=1, var_1_35=1, var_1_4=128, var_1_5=-641, var_1_6=1026, var_1_7=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 834 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 772 mSDsluCounter, 1469 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 980 mSDsCounter, 387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1452 IncrementalHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 387 mSolverCounterUnsat, 489 mSDtfsCounter, 1452 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 888 GetRequests, 818 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred in iteration=3, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 180 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1324 NumberOfCodeBlocks, 1324 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1315 ConstructedInterpolants, 0 QuantifiedInterpolants, 2766 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1209 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 9396/9600 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-03-03 23:04:38,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 812e733299b6ea30eb7cd91dc9b53a661a67be71ff0b82204409e990f9b6f3ee --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 23:04:40,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 23:04:40,201 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 23:04:40,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 23:04:40,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 23:04:40,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 23:04:40,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 23:04:40,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 23:04:40,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 23:04:40,229 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 23:04:40,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 23:04:40,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 23:04:40,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 23:04:40,230 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 23:04:40,230 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 23:04:40,230 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 23:04:40,231 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 23:04:40,231 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 23:04:40,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 23:04:40,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 23:04:40,231 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 23:04:40,231 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 23:04:40,231 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 23:04:40,231 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 23:04:40,231 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 23:04:40,231 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 23:04:40,231 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 23:04:40,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 23:04:40,232 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 23:04:40,232 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 23:04:40,232 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 23:04:40,232 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 23:04:40,232 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 23:04:40,232 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 23:04:40,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:04:40,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 23:04:40,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 23:04:40,233 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 23:04:40,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 23:04:40,233 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 23:04:40,233 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 23:04:40,233 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 23:04:40,233 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 23:04:40,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 23:04:40,234 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 23:04:40,234 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/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 -> 812e733299b6ea30eb7cd91dc9b53a661a67be71ff0b82204409e990f9b6f3ee [2025-03-03 23:04:40,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 23:04:40,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 23:04:40,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 23:04:40,482 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 23:04:40,484 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 23:04:40,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i [2025-03-03 23:04:41,629 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a36c6a7e/e20f347794b140f1a743d3118e03a446/FLAG54003b23a [2025-03-03 23:04:41,839 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 23:04:41,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i [2025-03-03 23:04:41,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a36c6a7e/e20f347794b140f1a743d3118e03a446/FLAG54003b23a [2025-03-03 23:04:42,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a36c6a7e/e20f347794b140f1a743d3118e03a446 [2025-03-03 23:04:42,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 23:04:42,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 23:04:42,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 23:04:42,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 23:04:42,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 23:04:42,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f6da97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42, skipping insertion in model container [2025-03-03 23:04:42,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 23:04:42,304 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i[916,929] [2025-03-03 23:04:42,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:04:42,374 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 23:04:42,384 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-91.i[916,929] [2025-03-03 23:04:42,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 23:04:42,424 INFO L204 MainTranslator]: Completed translation [2025-03-03 23:04:42,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42 WrapperNode [2025-03-03 23:04:42,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 23:04:42,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 23:04:42,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 23:04:42,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 23:04:42,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,465 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2025-03-03 23:04:42,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 23:04:42,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 23:04:42,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 23:04:42,466 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 23:04:42,471 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,490 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-03-03 23:04:42,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,498 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 23:04:42,509 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 23:04:42,509 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 23:04:42,509 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 23:04:42,510 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (1/1) ... [2025-03-03 23:04:42,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 23:04:42,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 23:04:42,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 23:04:42,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 23:04:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 23:04:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 23:04:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 23:04:42,559 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 23:04:42,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 23:04:42,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 23:04:42,631 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 23:04:42,634 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 23:05:06,395 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 23:05:06,395 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 23:05:06,402 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 23:05:06,402 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 23:05:06,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:06 BoogieIcfgContainer [2025-03-03 23:05:06,403 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 23:05:06,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 23:05:06,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 23:05:06,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 23:05:06,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 11:04:42" (1/3) ... [2025-03-03 23:05:06,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532bef34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:05:06, skipping insertion in model container [2025-03-03 23:05:06,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 11:04:42" (2/3) ... [2025-03-03 23:05:06,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532bef34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 11:05:06, skipping insertion in model container [2025-03-03 23:05:06,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 11:05:06" (3/3) ... [2025-03-03 23:05:06,410 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-91.i [2025-03-03 23:05:06,419 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 23:05:06,421 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-91.i that has 2 procedures, 80 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 23:05:06,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 23:05:06,469 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;@160e74d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 23:05:06,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 23:05:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:05:06,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 23:05:06,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:06,495 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:05:06,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:06,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash 670360973, now seen corresponding path program 1 times [2025-03-03 23:05:06,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:05:06,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273081545] [2025-03-03 23:05:06,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:06,509 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-03-03 23:05:06,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:05:06,511 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-03 23:05:06,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:05:06,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:05:07,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:05:07,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:07,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:07,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 23:05:07,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-03 23:05:07,637 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 23:05:07,638 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:05:07,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273081545] [2025-03-03 23:05:07,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273081545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 23:05:07,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 23:05:07,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 23:05:07,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550669865] [2025-03-03 23:05:07,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 23:05:07,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 23:05:07,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:05:07,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 23:05:07,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 23:05:07,663 INFO L87 Difference]: Start difference. First operand has 80 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 53 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:05:07,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:07,682 INFO L93 Difference]: Finished difference Result 154 states and 264 transitions. [2025-03-03 23:05:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 23:05:07,685 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 23:05:07,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:07,689 INFO L225 Difference]: With dead ends: 154 [2025-03-03 23:05:07,690 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 23:05:07,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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-03-03 23:05:07,695 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:07,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 23:05:07,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 23:05:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-03 23:05:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:05:07,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2025-03-03 23:05:07,726 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 165 [2025-03-03 23:05:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:07,726 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2025-03-03 23:05:07,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:05:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2025-03-03 23:05:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-03 23:05:07,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:07,729 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:05:07,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 23:05:07,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-03 23:05:07,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:07,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:07,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1378882098, now seen corresponding path program 1 times [2025-03-03 23:05:07,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:05:07,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161938440] [2025-03-03 23:05:07,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:07,932 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-03-03 23:05:07,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:05:07,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-03 23:05:07,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:05:08,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:05:08,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:05:08,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:08,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:08,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 23:05:08,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2025-03-03 23:05:09,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:05:10,403 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:05:10,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161938440] [2025-03-03 23:05:10,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161938440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:05:10,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1518647935] [2025-03-03 23:05:10,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:10,404 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 23:05:10,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 23:05:10,406 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 23:05:10,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-03 23:05:10,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-03 23:05:12,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-03 23:05:12,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:12,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:12,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 23:05:12,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 318 proven. 9 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2025-03-03 23:05:13,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:05:13,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1518647935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 23:05:13,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:05:13,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-03-03 23:05:13,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832406213] [2025-03-03 23:05:13,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:05:13,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 23:05:13,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:05:13,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 23:05:13,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 23:05:13,726 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:05:21,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:05:25,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:05:29,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:05:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:29,407 INFO L93 Difference]: Finished difference Result 157 states and 236 transitions. [2025-03-03 23:05:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 23:05:29,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-03 23:05:29,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:29,538 INFO L225 Difference]: With dead ends: 157 [2025-03-03 23:05:29,539 INFO L226 Difference]: Without dead ends: 83 [2025-03-03 23:05:29,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 23:05:29,540 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 77 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:29,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 210 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 3 Unknown, 0 Unchecked, 15.3s Time] [2025-03-03 23:05:29,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-03 23:05:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-03-03 23:05:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 23:05:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2025-03-03 23:05:29,557 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 165 [2025-03-03 23:05:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:29,558 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2025-03-03 23:05:29,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 23:05:29,558 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2025-03-03 23:05:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 23:05:29,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:29,561 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:05:29,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-03 23:05:29,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:05:29,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/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-03-03 23:05:29,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:29,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1081722072, now seen corresponding path program 1 times [2025-03-03 23:05:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:05:29,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356311619] [2025-03-03 23:05:29,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:29,963 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-03-03 23:05:29,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:05:29,966 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-03 23:05:29,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:05:30,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 23:05:31,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 23:05:31,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:31,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:31,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 23:05:31,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:05:33,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 612 proven. 30 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2025-03-03 23:05:33,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:05:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-03 23:05:36,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:05:36,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356311619] [2025-03-03 23:05:36,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356311619] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:05:36,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:05:36,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 23:05:36,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620176374] [2025-03-03 23:05:36,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:05:36,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 23:05:36,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:05:36,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 23:05:36,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 23:05:36,607 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 23:05:43,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:05:47,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:05:51,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 23:05:52,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 23:05:52,798 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2025-03-03 23:05:52,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 23:05:52,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 166 [2025-03-03 23:05:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 23:05:52,800 INFO L225 Difference]: With dead ends: 191 [2025-03-03 23:05:52,800 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 23:05:52,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 23:05:52,801 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 58 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2025-03-03 23:05:52,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 262 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 3 Unknown, 0 Unchecked, 15.7s Time] [2025-03-03 23:05:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 23:05:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2025-03-03 23:05:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 66 states have internal predecessors, (80), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 23:05:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 158 transitions. [2025-03-03 23:05:52,816 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 158 transitions. Word has length 166 [2025-03-03 23:05:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 23:05:52,816 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 158 transitions. [2025-03-03 23:05:52,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 23:05:52,816 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 158 transitions. [2025-03-03 23:05:52,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 23:05:52,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 23:05:52,820 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 23:05:52,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:05:53,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-03 23:05:53,020 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 23:05:53,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 23:05:53,021 INFO L85 PathProgramCache]: Analyzing trace with hash 788319065, now seen corresponding path program 1 times [2025-03-03 23:05:53,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 23:05:53,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419225359] [2025-03-03 23:05:53,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 23:05:53,021 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-03-03 23:05:53,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 23:05:53,023 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-03 23:05:53,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-03 23:05:53,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 23:05:54,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 23:05:54,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 23:05:54,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 23:05:54,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 23:05:54,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 23:06:00,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 680 proven. 63 refuted. 0 times theorem prover too weak. 457 trivial. 0 not checked. [2025-03-03 23:06:00,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 23:06:05,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 75 proven. 66 refuted. 0 times theorem prover too weak. 1059 trivial. 0 not checked. [2025-03-03 23:06:05,894 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 23:06:05,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419225359] [2025-03-03 23:06:05,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419225359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 23:06:05,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 23:06:05,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2025-03-03 23:06:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279177259] [2025-03-03 23:06:05,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 23:06:05,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 23:06:05,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 23:06:05,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 23:06:05,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-03 23:06:05,896 INFO L87 Difference]: Start difference. First operand 108 states and 158 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 3 states have call successors, (37), 3 states have call predecessors, (37), 7 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38)