./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_50-while_file-71.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 5241d22664a98c42b2e0225fd7bde3df9a30bd7664e82fcfe347179d1bae06d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:58:41,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:58:41,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 14:58:41,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:58:41,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:58:41,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:58:41,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:58:41,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:58:41,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:58:41,513 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:58:41,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:58:41,514 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:58:41,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:58:41,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:58:41,515 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:58:41,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:58:41,515 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:58:41,515 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:58:41,516 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 14:58:41,516 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:58:41,516 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:58:41,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:58:41,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:58:41,516 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:58:41,516 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:58:41,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:58:41,516 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:58:41,516 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:58:41,516 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:58:41,516 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:58:41,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:58:41,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:58:41,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:58:41,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:58:41,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:58:41,517 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:58:41,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:58:41,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 14:58:41,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 14:58:41,518 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:58:41,518 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:58:41,518 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:58:41,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:58:41,518 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 -> 5241d22664a98c42b2e0225fd7bde3df9a30bd7664e82fcfe347179d1bae06d7 [2025-03-08 14:58:41,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:58:41,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:58:41,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:58:41,740 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:58:41,740 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:58:41,741 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-71.i [2025-03-08 14:58:42,874 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55c7b3d1/767c5b99b3ca40e18ab8c41bc3a37b88/FLAGc96e9b6b1 [2025-03-08 14:58:43,101 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:58:43,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-71.i [2025-03-08 14:58:43,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55c7b3d1/767c5b99b3ca40e18ab8c41bc3a37b88/FLAGc96e9b6b1 [2025-03-08 14:58:43,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f55c7b3d1/767c5b99b3ca40e18ab8c41bc3a37b88 [2025-03-08 14:58:43,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:58:43,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:58:43,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:58:43,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:58:43,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:58:43,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,461 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b49333d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43, skipping insertion in model container [2025-03-08 14:58:43,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:58:43,567 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_50-while_file-71.i[915,928] [2025-03-08 14:58:43,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:58:43,609 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:58:43,616 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_50-while_file-71.i[915,928] [2025-03-08 14:58:43,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:58:43,650 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:58:43,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43 WrapperNode [2025-03-08 14:58:43,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:58:43,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:58:43,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:58:43,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:58:43,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,661 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,677 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2025-03-08 14:58:43,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:58:43,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:58:43,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:58:43,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:58:43,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,703 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-08 14:58:43,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,712 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:58:43,713 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:58:43,713 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:58:43,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:58:43,713 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (1/1) ... [2025-03-08 14:58:43,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:58:43,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:58:43,742 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-08 14:58:43,745 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-08 14:58:43,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:58:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:58:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:58:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 14:58:43,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:58:43,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:58:43,813 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:58:43,814 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:58:44,038 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 14:58:44,038 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:58:44,048 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:58:44,049 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:58:44,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:58:44 BoogieIcfgContainer [2025-03-08 14:58:44,050 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:58:44,052 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:58:44,052 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:58:44,055 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:58:44,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:58:43" (1/3) ... [2025-03-08 14:58:44,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b2789b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:58:44, skipping insertion in model container [2025-03-08 14:58:44,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:43" (2/3) ... [2025-03-08 14:58:44,056 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b2789b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:58:44, skipping insertion in model container [2025-03-08 14:58:44,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:58:44" (3/3) ... [2025-03-08 14:58:44,057 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-71.i [2025-03-08 14:58:44,067 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:58:44,068 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-71.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:58:44,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:58:44,112 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;@4bafcc3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:58:44,112 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:58:44,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:58:44,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 14:58:44,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:58:44,126 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:58:44,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:58:44,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:58:44,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1540166886, now seen corresponding path program 1 times [2025-03-08 14:58:44,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:58:44,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603081498] [2025-03-08 14:58:44,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:58:44,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:58:44,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 14:58:44,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 14:58:44,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:58:44,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:58:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 14:58:44,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:58:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603081498] [2025-03-08 14:58:44,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603081498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:58:44,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446833232] [2025-03-08 14:58:44,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:58:44,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:58:44,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:58:44,378 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-08 14:58:44,380 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-08 14:58:44,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 14:58:44,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 14:58:44,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:58:44,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:58:44,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:58:44,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:58:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 14:58:44,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:58:44,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446833232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:58:44,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:58:44,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 14:58:44,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994566768] [2025-03-08 14:58:44,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:58:44,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:58:44,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:58:44,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:58:44,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:58:44,565 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:58:44,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:58:44,581 INFO L93 Difference]: Finished difference Result 116 states and 198 transitions. [2025-03-08 14:58:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:58:44,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2025-03-08 14:58:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:58:44,588 INFO L225 Difference]: With dead ends: 116 [2025-03-08 14:58:44,588 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 14:58:44,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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-08 14:58:44,593 INFO L435 NwaCegarLoop]: 86 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, 86 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-08 14:58:44,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:58:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 14:58:44,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 14:58:44,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:58:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2025-03-08 14:58:44,629 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 133 [2025-03-08 14:58:44,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:58:44,629 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2025-03-08 14:58:44,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:58:44,629 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2025-03-08 14:58:44,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 14:58:44,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:58:44,632 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:58:44,638 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-08 14:58:44,834 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-08 14:58:44,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:58:44,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:58:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash -570522585, now seen corresponding path program 1 times [2025-03-08 14:58:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:58:44,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207864207] [2025-03-08 14:58:44,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:58:44,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:58:44,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 14:58:45,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 14:58:45,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:58:45,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:58:45,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999530451] [2025-03-08 14:58:45,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:58:45,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:58:45,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:58:45,067 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-08 14:58:45,068 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-08 14:58:45,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 14:58:45,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 14:58:45,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:58:45,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:58:45,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 14:58:45,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:58:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 42 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2025-03-08 14:58:46,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 14:58:46,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 14:58:46,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207864207] [2025-03-08 14:58:46,315 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 14:58:46,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999530451] [2025-03-08 14:58:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999530451] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 14:58:46,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 14:58:46,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-08 14:58:46,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58305128] [2025-03-08 14:58:46,315 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 14:58:46,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 14:58:46,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 14:58:46,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 14:58:46,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 14:58:46,318 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 14:58:46,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:58:46,721 INFO L93 Difference]: Finished difference Result 184 states and 272 transitions. [2025-03-08 14:58:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 14:58:46,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 133 [2025-03-08 14:58:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:58:46,724 INFO L225 Difference]: With dead ends: 184 [2025-03-08 14:58:46,724 INFO L226 Difference]: Without dead ends: 129 [2025-03-08 14:58:46,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2025-03-08 14:58:46,725 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 74 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 14:58:46,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 424 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 14:58:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-08 14:58:46,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2025-03-08 14:58:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 14:58:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2025-03-08 14:58:46,752 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 133 [2025-03-08 14:58:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:58:46,752 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2025-03-08 14:58:46,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 14:58:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2025-03-08 14:58:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 14:58:46,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:58:46,756 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:58:46,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 14:58:46,958 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-08 14:58:46,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:58:46,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:58:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1927493352, now seen corresponding path program 1 times [2025-03-08 14:58:46,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 14:58:46,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969639114] [2025-03-08 14:58:46,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:58:46,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 14:58:46,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 14:58:47,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 14:58:47,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:58:47,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 14:58:47,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1391316483] [2025-03-08 14:58:47,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:58:47,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 14:58:47,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:58:47,075 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-08 14:58:47,076 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-08 14:58:47,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 14:58:47,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 14:58:47,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:58:47,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:58:47,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 14:58:47,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 14:58:47,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 14:58:47,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:58:47,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 14:58:47,360 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 14:58:47,360 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 14:58:47,361 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 14:58:47,369 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-08 14:58:47,563 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-08 14:58:47,565 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 14:58:47,629 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 14:58:47,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:58:47 BoogieIcfgContainer [2025-03-08 14:58:47,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 14:58:47,631 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 14:58:47,631 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 14:58:47,631 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 14:58:47,632 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:58:44" (3/4) ... [2025-03-08 14:58:47,633 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 14:58:47,634 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 14:58:47,634 INFO L158 Benchmark]: Toolchain (without parser) took 4177.78ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 107.0MB in the end (delta: 16.7MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2025-03-08 14:58:47,634 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:58:47,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.01ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 109.4MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 14:58:47,635 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.80ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:58:47,635 INFO L158 Benchmark]: Boogie Preprocessor took 34.19ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 103.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:58:47,635 INFO L158 Benchmark]: IcfgBuilder took 337.33ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 83.5MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 14:58:47,635 INFO L158 Benchmark]: TraceAbstraction took 3578.97ms. Allocated memory is still 167.8MB. Free memory was 82.7MB in the beginning and 107.0MB in the end (delta: -24.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:58:47,635 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 107.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 14:58:47,636 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.17ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.01ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 109.4MB in the end (delta: 13.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.80ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.19ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 103.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 337.33ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 83.5MB in the end (delta: 19.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3578.97ms. Allocated memory is still 167.8MB. Free memory was 82.7MB in the beginning and 107.0MB in the end (delta: -24.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 167.8MB. Free memory was 107.0MB in the beginning and 107.0MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryFLOATComparisonOperation at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] signed char var_1_4 = -1; [L26] signed char var_1_5 = 4; [L27] unsigned short int var_1_9 = 35831; [L28] float var_1_10 = 1.875; [L29] float var_1_11 = 5.8; [L30] float var_1_12 = 2.375; [L31] float var_1_13 = 999999999999.75; [L32] signed short int var_1_14 = 32; [L33] signed short int var_1_15 = 25; [L34] signed short int var_1_16 = 23809; [L35] signed short int var_1_17 = 2; [L36] float var_1_18 = 499.25; [L37] signed long int var_1_19 = -4; [L38] unsigned short int var_1_20 = 10; [L39] unsigned short int var_1_21 = 16; [L40] signed char var_1_22 = -10; [L41] signed char var_1_23 = 25; [L42] float last_1_var_1_12 = 2.375; [L43] signed short int last_1_var_1_14 = 32; [L44] unsigned short int last_1_var_1_20 = 10; [L45] unsigned short int last_1_var_1_21 = 16; VAL [isInitial=0, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L125] last_1_var_1_12 = var_1_12 [L126] last_1_var_1_14 = var_1_14 [L127] last_1_var_1_20 = var_1_20 [L128] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=0, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L92] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L93] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L93] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L94] var_1_3 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L95] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L96] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L96] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L97] var_1_4 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L98] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L99] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L99] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=4, var_1_9=35831] [L100] var_1_5 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L101] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L102] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L102] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=35831] [L103] var_1_9 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_9 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L104] RET assume_abort_if_not(var_1_9 >= 32767) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L105] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L105] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_11=29/5, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L106] var_1_11 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L107] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_13=3999999999999/4, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L108] var_1_13 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L109] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L110] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L110] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=25, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L111] var_1_15 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L112] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L113] CALL assume_abort_if_not(var_1_15 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L113] RET assume_abort_if_not(var_1_15 <= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=23809, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L114] var_1_16 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L115] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L116] CALL assume_abort_if_not(var_1_16 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L116] RET assume_abort_if_not(var_1_16 <= 32766) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=2, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L117] var_1_17 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L118] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L119] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L119] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=25, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L120] var_1_23 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_23 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L121] RET assume_abort_if_not(var_1_23 >= -127) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L122] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L122] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L139] RET updateVariables() [L140] CALL step() [L49] signed long int stepLocal_0 = var_1_4 - var_1_5; VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_0=-1, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L50] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_0=-1, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L51] COND FALSE !(stepLocal_0 > ((last_1_var_1_14 + last_1_var_1_20) * last_1_var_1_21)) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L61] unsigned short int stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_2=32, var_1_10=15/8, var_1_12=19/8, var_1_14=32, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L62] COND FALSE !(! (var_1_5 < var_1_1)) [L69] var_1_14 = ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < ((var_1_15 - (var_1_16 - var_1_17)))) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : ((var_1_15 - (var_1_16 - var_1_17))))) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_2=32, var_1_10=15/8, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L71] var_1_10 = var_1_11 [L72] signed char stepLocal_1 = var_1_4; VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_1=-1, stepLocal_2=32, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L73] COND FALSE !(last_1_var_1_12 >= ((var_1_11 / var_1_13) / 31.9f)) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_1=-1, stepLocal_2=32, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=1997/4, var_1_19=-4, var_1_1=32, var_1_20=10, var_1_21=16, var_1_22=-10, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L80] var_1_18 = ((((((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) > (5.5f)) ? (((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) : (5.5f))) [L81] var_1_20 = var_1_15 [L82] var_1_21 = var_1_5 [L83] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_1=-1, stepLocal_2=32, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=511/2, var_1_19=-4, var_1_1=32, var_1_20=16383, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L84] COND TRUE \read(var_1_3) [L85] var_1_19 = ((((var_1_17) > ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21)))))) ? (var_1_17) : ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21))))))) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, stepLocal_1=-1, stepLocal_2=32, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=511/2, var_1_19=32766, var_1_1=32, var_1_20=16383, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return ((((((((var_1_2 ? (((var_1_4 - var_1_5) > ((last_1_var_1_14 + last_1_var_1_20) * last_1_var_1_21)) ? (var_1_1 == ((unsigned short int) (var_1_9 - var_1_5))) : 1) : (var_1_3 ? (var_1_1 == ((unsigned short int) 32)) : (var_1_1 == ((unsigned short int) var_1_5)))) && (var_1_10 == ((float) var_1_11))) && ((last_1_var_1_12 >= ((var_1_11 / var_1_13) / 31.9f)) ? ((var_1_14 > var_1_4) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_11))) : 1)) && ((! (var_1_5 < var_1_1)) ? ((last_1_var_1_14 >= var_1_1) ? (var_1_14 == ((signed short int) (((((128) < (((((2) < (var_1_4)) ? (2) : (var_1_4))))) ? (128) : (((((2) < (var_1_4)) ? (2) : (var_1_4)))))) + var_1_5))) : (var_1_14 == ((signed short int) ((var_1_5 - var_1_15) + var_1_4)))) : (var_1_14 == ((signed short int) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) < ((var_1_15 - (var_1_16 - var_1_17)))) ? (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5)))) : ((var_1_15 - (var_1_16 - var_1_17))))))))) && (var_1_18 == ((float) ((((((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) > (5.5f)) ? (((((255.5f) > (var_1_11)) ? (255.5f) : (var_1_11)))) : (5.5f)))))) && (var_1_3 ? (var_1_19 == ((signed long int) ((((var_1_17) > ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21)))))) ? (var_1_17) : ((((((var_1_5) < (var_1_9)) ? (var_1_5) : (var_1_9))) + ((((var_1_16) > (var_1_21)) ? (var_1_16) : (var_1_21))))))))) : (var_1_19 == ((signed long int) var_1_5)))) && (var_1_20 == ((unsigned short int) var_1_15))) && (var_1_21 == ((unsigned short int) var_1_5))) && (var_1_22 == ((signed char) var_1_23)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=511/2, var_1_19=32766, var_1_1=32, var_1_20=16383, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=511/2, var_1_19=32766, var_1_1=32, var_1_20=16383, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=19/8, last_1_var_1_14=32, last_1_var_1_20=10, last_1_var_1_21=16, var_1_10=2, var_1_11=2, var_1_12=19/8, var_1_14=0, var_1_15=16383, var_1_16=32766, var_1_17=16383, var_1_18=511/2, var_1_19=32766, var_1_1=32, var_1_20=16383, var_1_21=0, var_1_22=-127, var_1_23=-127, var_1_2=1, var_1_3=1, var_1_4=-1, var_1_5=0, var_1_9=-32769] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 112 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 510 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 369 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 293 IncrementalHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 141 mSDtfsCounter, 293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 289 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=2, InterpolantAutomatonStates: 14, 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, 2 MinimizatonAttempts, 27 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 798 NumberOfCodeBlocks, 798 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 1661 SizeOfPredicates, 4 NumberOfNonLiveVariables, 656 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 2438/2520 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-08 14:58:47,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_50-while_file-71.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 5241d22664a98c42b2e0225fd7bde3df9a30bd7664e82fcfe347179d1bae06d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 14:58:49,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 14:58:49,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 14:58:49,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 14:58:49,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 14:58:49,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 14:58:49,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 14:58:49,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 14:58:49,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 14:58:49,528 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 14:58:49,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 14:58:49,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 14:58:49,528 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 14:58:49,529 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:58:49,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 14:58:49,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 14:58:49,529 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 -> 5241d22664a98c42b2e0225fd7bde3df9a30bd7664e82fcfe347179d1bae06d7 [2025-03-08 14:58:49,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 14:58:49,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 14:58:49,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 14:58:49,742 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 14:58:49,743 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 14:58:49,744 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-71.i [2025-03-08 14:58:50,891 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc3a0220/bd0891811eae4d329d60a57e64a6082f/FLAGa7dbdb197 [2025-03-08 14:58:51,117 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 14:58:51,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-71.i [2025-03-08 14:58:51,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc3a0220/bd0891811eae4d329d60a57e64a6082f/FLAGa7dbdb197 [2025-03-08 14:58:51,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc3a0220/bd0891811eae4d329d60a57e64a6082f [2025-03-08 14:58:51,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 14:58:51,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 14:58:51,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 14:58:51,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 14:58:51,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 14:58:51,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2291c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51, skipping insertion in model container [2025-03-08 14:58:51,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 14:58:51,265 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_50-while_file-71.i[915,928] [2025-03-08 14:58:51,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:58:51,327 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 14:58:51,335 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_50-while_file-71.i[915,928] [2025-03-08 14:58:51,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 14:58:51,371 INFO L204 MainTranslator]: Completed translation [2025-03-08 14:58:51,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51 WrapperNode [2025-03-08 14:58:51,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 14:58:51,374 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 14:58:51,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 14:58:51,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 14:58:51,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,410 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-03-08 14:58:51,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 14:58:51,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 14:58:51,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 14:58:51,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 14:58:51,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,432 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-08 14:58:51,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,442 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,447 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 14:58:51,454 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 14:58:51,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 14:58:51,455 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 14:58:51,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (1/1) ... [2025-03-08 14:58:51,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 14:58:51,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 14:58:51,481 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-08 14:58:51,484 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-08 14:58:51,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 14:58:51,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 14:58:51,502 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 14:58:51,502 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 14:58:51,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 14:58:51,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 14:58:51,558 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 14:58:51,559 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 14:59:00,334 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 14:59:00,334 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 14:59:00,340 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 14:59:00,341 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 14:59:00,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:59:00 BoogieIcfgContainer [2025-03-08 14:59:00,341 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 14:59:00,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 14:59:00,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 14:59:00,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 14:59:00,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:58:51" (1/3) ... [2025-03-08 14:59:00,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775f4bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:59:00, skipping insertion in model container [2025-03-08 14:59:00,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:58:51" (2/3) ... [2025-03-08 14:59:00,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775f4bfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:59:00, skipping insertion in model container [2025-03-08 14:59:00,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:59:00" (3/3) ... [2025-03-08 14:59:00,348 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-71.i [2025-03-08 14:59:00,357 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 14:59:00,358 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-71.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 14:59:00,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 14:59:00,397 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;@6daf3762, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 14:59:00,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 14:59:00,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:59:00,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 14:59:00,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:59:00,406 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:59:00,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:59:00,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:59:00,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1540166886, now seen corresponding path program 1 times [2025-03-08 14:59:00,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:59:00,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394865260] [2025-03-08 14:59:00,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:59:00,418 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-08 14:59:00,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:59:00,422 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-08 14:59:00,429 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-08 14:59:00,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 14:59:00,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 14:59:00,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:59:00,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:59:00,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 14:59:00,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:59:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-08 14:59:00,825 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:59:00,825 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:59:00,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394865260] [2025-03-08 14:59:00,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394865260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:59:00,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:59:00,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 14:59:00,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38039784] [2025-03-08 14:59:00,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:59:00,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 14:59:00,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:59:00,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 14:59:00,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 14:59:00,842 INFO L87 Difference]: Start difference. First operand has 61 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:59:00,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:59:00,860 INFO L93 Difference]: Finished difference Result 116 states and 198 transitions. [2025-03-08 14:59:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 14:59:00,862 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2025-03-08 14:59:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:59:00,866 INFO L225 Difference]: With dead ends: 116 [2025-03-08 14:59:00,866 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 14:59:00,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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-08 14:59:00,870 INFO L435 NwaCegarLoop]: 86 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, 86 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-08 14:59:00,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 14:59:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 14:59:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-08 14:59:00,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 35 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 14:59:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2025-03-08 14:59:00,897 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 133 [2025-03-08 14:59:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:59:00,897 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2025-03-08 14:59:00,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 14:59:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2025-03-08 14:59:00,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 14:59:00,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:59:00,899 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:59:00,909 INFO L540 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)] Forceful destruction successful, exit code 0 [2025-03-08 14:59:01,103 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-08 14:59:01,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:59:01,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:59:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash -570522585, now seen corresponding path program 1 times [2025-03-08 14:59:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:59:01,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358998006] [2025-03-08 14:59:01,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:59:01,105 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-08 14:59:01,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:59:01,107 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-08 14:59:01,108 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-08 14:59:01,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 14:59:01,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 14:59:01,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:59:01,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:59:01,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 14:59:01,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 14:59:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-08 14:59:05,399 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 14:59:05,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 14:59:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358998006] [2025-03-08 14:59:05,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [358998006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 14:59:05,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 14:59:05,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 14:59:05,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881878269] [2025-03-08 14:59:05,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 14:59:05,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 14:59:05,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 14:59:05,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 14:59:05,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 14:59:05,401 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:59:09,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 14:59:10,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 14:59:10,655 INFO L93 Difference]: Finished difference Result 178 states and 267 transitions. [2025-03-08 14:59:10,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 14:59:10,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 133 [2025-03-08 14:59:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 14:59:10,692 INFO L225 Difference]: With dead ends: 178 [2025-03-08 14:59:10,693 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 14:59:10,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 14:59:10,694 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 61 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 14:59:10,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 283 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 14:59:10,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 14:59:10,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2025-03-08 14:59:10,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 53 states have internal predecessors, (63), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 14:59:10,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 147 transitions. [2025-03-08 14:59:10,717 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 147 transitions. Word has length 133 [2025-03-08 14:59:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 14:59:10,718 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 147 transitions. [2025-03-08 14:59:10,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-08 14:59:10,718 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 147 transitions. [2025-03-08 14:59:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 14:59:10,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 14:59:10,719 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 14:59:10,730 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-08 14:59:10,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-08 14:59:10,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 14:59:10,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 14:59:10,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1927493352, now seen corresponding path program 1 times [2025-03-08 14:59:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 14:59:10,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516554870] [2025-03-08 14:59:10,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 14:59:10,921 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-08 14:59:10,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 14:59:10,923 INFO L229 MonitoredProcess]: Starting monitored process 4 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-08 14:59:10,924 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 (4)] Waiting until timeout for monitored process [2025-03-08 14:59:10,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 14:59:11,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 14:59:11,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 14:59:11,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 14:59:11,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 14:59:11,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:00:13,935 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 24) c_~var_1_5~0))) (and (bvslt .cse0 ((_ zero_extend 16) c_~var_1_1~0)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.geq c_~var_1_11~0 (fp.neg .cse1)) (fp.leq c_~var_1_11~0 (fp.neg .cse2))) (and (fp.leq c_~var_1_11~0 .cse1) (fp.geq c_~var_1_11~0 .cse2)))) (let ((.cse5 ((_ sign_extend 24) c_~var_1_4~0)) (.cse7 (bvadd ((_ sign_extend 16) c_~var_1_15~0) (bvneg (bvadd (bvneg ((_ sign_extend 16) c_~var_1_17~0)) ((_ sign_extend 16) c_~var_1_16~0)))))) (let ((.cse6 (= ((_ extract 15 0) .cse7) c_~var_1_14~0)) (.cse3 (bvsgt .cse5 .cse0))) (or (and .cse3 (let ((.cse4 (bvslt .cse5 .cse7))) (or (and .cse4 (= ((_ extract 15 0) .cse5) c_~var_1_14~0)) (and (not .cse4) .cse6)))) (and (let ((.cse8 (bvslt .cse0 .cse7))) (or (and (= ((_ extract 15 0) .cse0) c_~var_1_14~0) .cse8) (and (not .cse8) .cse6))) (not .cse3))))) (= c_~var_1_11~0 c_~var_1_10~0) (not (fp.geq c_~last_1_var_1_12~0 (fp.div c_currentRoundingMode (fp.div c_currentRoundingMode c_~var_1_11~0 c_~var_1_13~0) ((_ to_fp 8 24) c_currentRoundingMode (/ 319.0 10.0))))) (= (_ bv10 16) c_~last_1_var_1_20~0) (= (_ bv16 16) c_~last_1_var_1_21~0) (not (= (_ bv0 8) c_~var_1_2~0)) (= (_ bv32 16) c_~last_1_var_1_14~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true