./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash abae505f58f5b150cd30902d50b00592ab647cc43f5107f9aaed41c2bd3b922b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:28:51,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:28:51,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:28:51,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:28:51,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:28:51,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:28:51,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:28:51,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:28:51,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:28:51,996 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:28:51,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:28:51,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:28:51,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:28:51,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:28:51,997 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:28:51,998 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:28:51,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:28:51,999 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:28:51,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:28:51,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:28:51,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:28:51,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:51,999 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:28:51,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:28:51,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:28:51,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:28:51,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:52,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:28:52,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:28:52,000 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:28:52,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:28:52,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:28:52,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:28:52,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:28:52,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:28:52,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:28:52,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:28:52,001 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> abae505f58f5b150cd30902d50b00592ab647cc43f5107f9aaed41c2bd3b922b [2025-01-09 13:28:52,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:28:52,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:28:52,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:28:52,271 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:28:52,271 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:28:52,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i [2025-01-09 13:28:53,453 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aacc61e30/b4deef076fea43ea9d632356c432e29f/FLAG1e7a9c58f [2025-01-09 13:28:53,725 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:28:53,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i [2025-01-09 13:28:53,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aacc61e30/b4deef076fea43ea9d632356c432e29f/FLAG1e7a9c58f [2025-01-09 13:28:53,745 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aacc61e30/b4deef076fea43ea9d632356c432e29f [2025-01-09 13:28:53,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:28:53,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:28:53,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:28:53,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:28:53,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:28:53,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:53,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58276045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53, skipping insertion in model container [2025-01-09 13:28:53,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:53,767 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:28:53,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i[915,928] [2025-01-09 13:28:53,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:28:53,906 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:28:53,916 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i[915,928] [2025-01-09 13:28:53,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:28:53,948 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:28:53,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53 WrapperNode [2025-01-09 13:28:53,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:28:53,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:28:53,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:28:53,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:28:53,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:53,961 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:53,977 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2025-01-09 13:28:53,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:28:53,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:28:53,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:28:53,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:28:53,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:53,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:53,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:54,003 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:28:54,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:54,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:54,007 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:54,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:54,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:54,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:54,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:54,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:28:54,020 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:28:54,020 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:28:54,020 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:28:54,021 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (1/1) ... [2025-01-09 13:28:54,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:54,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:28:54,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:28:54,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:28:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:28:54,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:28:54,079 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:28:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:28:54,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:28:54,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:28:54,127 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:28:54,128 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:28:54,302 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 13:28:54,302 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:28:54,312 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:28:54,313 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:28:54,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:28:54 BoogieIcfgContainer [2025-01-09 13:28:54,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:28:54,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:28:54,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:28:54,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:28:54,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:28:53" (1/3) ... [2025-01-09 13:28:54,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da73438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:28:54, skipping insertion in model container [2025-01-09 13:28:54,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:53" (2/3) ... [2025-01-09 13:28:54,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da73438 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:28:54, skipping insertion in model container [2025-01-09 13:28:54,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:28:54" (3/3) ... [2025-01-09 13:28:54,322 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-35.i [2025-01-09 13:28:54,331 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:28:54,333 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-35.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:28:54,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:28:54,385 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;@594b6ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:28:54,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:28:54,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:28:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 13:28:54,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:54,396 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:28:54,397 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:54,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:54,403 INFO L85 PathProgramCache]: Analyzing trace with hash 500252663, now seen corresponding path program 1 times [2025-01-09 13:28:54,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:28:54,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220294183] [2025-01-09 13:28:54,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:28:54,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 13:28:54,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 13:28:54,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:54,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:28:54,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:28:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220294183] [2025-01-09 13:28:54,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220294183] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:28:54,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119125306] [2025-01-09 13:28:54,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:54,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:28:54,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:28:54,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:28:54,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:28:54,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 13:28:54,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 13:28:54,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:54,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:28:54,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:28:54,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:28:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 13:28:54,743 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:28:54,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119125306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:28:54,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:28:54,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:28:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210513982] [2025-01-09 13:28:54,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:28:54,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:28:54,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:28:54,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:28:54,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:28:54,768 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:28:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:28:54,791 INFO L93 Difference]: Finished difference Result 104 states and 171 transitions. [2025-01-09 13:28:54,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:28:54,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-01-09 13:28:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:28:54,798 INFO L225 Difference]: With dead ends: 104 [2025-01-09 13:28:54,798 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 13:28:54,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:28:54,803 INFO L435 NwaCegarLoop]: 74 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, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:28:54,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:28:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 13:28:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 13:28:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:28:54,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-01-09 13:28:54,838 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 116 [2025-01-09 13:28:54,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:28:54,839 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-01-09 13:28:54,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:28:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2025-01-09 13:28:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 13:28:54,846 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:28:54,847 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:28:54,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 13:28:55,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:28:55,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:28:55,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:28:55,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1872023165, now seen corresponding path program 1 times [2025-01-09 13:28:55,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:28:55,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688823578] [2025-01-09 13:28:55,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:28:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:28:55,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 13:28:55,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 13:28:55,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:55,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:28:55,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:28:55,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 13:28:55,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 13:28:55,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:28:55,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:28:55,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:28:55,321 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:28:55,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:28:55,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:28:55,329 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 13:28:55,398 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:28:55,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:28:55 BoogieIcfgContainer [2025-01-09 13:28:55,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:28:55,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:28:55,403 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:28:55,403 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:28:55,403 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:28:54" (3/4) ... [2025-01-09 13:28:55,405 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:28:55,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:28:55,406 INFO L158 Benchmark]: Toolchain (without parser) took 1658.58ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 59.8MB in the end (delta: 99.0MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2025-01-09 13:28:55,407 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:28:55,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.82ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 146.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:28:55,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.32ms. Allocated memory is still 201.3MB. Free memory was 146.3MB in the beginning and 144.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:28:55,408 INFO L158 Benchmark]: Boogie Preprocessor took 38.45ms. Allocated memory is still 201.3MB. Free memory was 144.3MB in the beginning and 142.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:28:55,408 INFO L158 Benchmark]: RCFGBuilder took 293.68ms. Allocated memory is still 201.3MB. Free memory was 142.4MB in the beginning and 127.2MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:28:55,409 INFO L158 Benchmark]: TraceAbstraction took 1086.37ms. Allocated memory is still 201.3MB. Free memory was 126.9MB in the beginning and 60.1MB in the end (delta: 66.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-09 13:28:55,409 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 201.3MB. Free memory was 60.1MB in the beginning and 59.8MB in the end (delta: 375.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:28:55,410 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.82ms. Allocated memory is still 201.3MB. Free memory was 158.8MB in the beginning and 146.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.32ms. Allocated memory is still 201.3MB. Free memory was 146.3MB in the beginning and 144.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.45ms. Allocated memory is still 201.3MB. Free memory was 144.3MB in the beginning and 142.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 293.68ms. Allocated memory is still 201.3MB. Free memory was 142.4MB in the beginning and 127.2MB in the end (delta: 15.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1086.37ms. Allocated memory is still 201.3MB. Free memory was 126.9MB in the beginning and 60.1MB in the end (delta: 66.7MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 201.3MB. Free memory was 60.1MB in the beginning and 59.8MB in the end (delta: 375.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 90, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someUnaryDOUBLEoperation at line 26, overapproximation of someBinaryArithmeticFLOAToperation at line 44. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 4.8; [L23] unsigned long int var_1_2 = 2; [L24] unsigned long int var_1_3 = 5; [L25] float var_1_4 = 255.1; [L26] float var_1_5 = -0.6; [L27] signed short int var_1_6 = -10; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] signed char var_1_11 = -2; [L31] signed char var_1_12 = 10; [L32] signed char var_1_13 = 5; [L33] float var_1_14 = 499.375; [L34] float var_1_15 = 0.0; [L35] float var_1_16 = 63.2; [L36] float var_1_17 = 0.0; [L37] float var_1_18 = 15.75; [L38] float var_1_19 = 5.75; VAL [isInitial=0, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_2=2, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L105] isInitial = 1 [L106] FCALL initially() [L108] FCALL updateLastVariables() [L109] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_ulong() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L69] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L69] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_3=5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L70] var_1_3 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L71] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L72] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L72] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_4=2551/10, var_1_6=-10, var_1_7=0, var_1_8=1] [L73] var_1_4 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L74] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L75] var_1_5 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L76] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L77] var_1_7 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L78] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_8=1] [L79] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L79] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L80] var_1_8 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L81] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0] [L82] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L82] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_11=-2, var_1_12=10, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L83] var_1_12 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_12 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L84] RET assume_abort_if_not(var_1_12 >= -31) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L85] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L85] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=5, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L87] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L88] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L88] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_15=0, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L89] var_1_15 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L90] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_16=316/5, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L91] var_1_16 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L92] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_17=0, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L93] var_1_17 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L94] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_18=63/4, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L95] var_1_18 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L96] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_6=-10, var_1_7=0, var_1_8=1] [L109] RET updateVariables() [L110] CALL step() [L42] unsigned long int stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=4294967263, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_19=23/4, var_1_1=24/5, var_1_2=4294967263, var_1_6=-10, var_1_7=0, var_1_8=1] [L43] COND TRUE stepLocal_0 >= (~ var_1_3) [L44] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, var_1_11=-2, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_19=23/4, var_1_2=4294967263, var_1_3=32, var_1_6=-10, var_1_7=0, var_1_8=1] [L46] var_1_11 = (-32 + (var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13))))) [L47] signed char stepLocal_1 = var_1_12; VAL [isInitial=1, stepLocal_1=32, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=3995/8, var_1_19=23/4, var_1_2=4294967263, var_1_3=32, var_1_6=-10, var_1_7=0, var_1_8=1] [L48] COND FALSE !(stepLocal_1 != var_1_3) [L53] var_1_14 = var_1_18 VAL [isInitial=1, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=23/4, var_1_2=4294967263, var_1_3=32, var_1_6=-10, var_1_7=0, var_1_8=1] [L55] var_1_19 = var_1_5 VAL [isInitial=1, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=-10, var_1_7=0, var_1_8=1] [L56] COND FALSE !(\read(var_1_7)) [L63] var_1_6 = var_1_11 VAL [isInitial=1, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=10, var_1_7=0, var_1_8=1] [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return (((((var_1_2 >= (~ var_1_3)) ? (var_1_1 == ((float) (var_1_4 + var_1_5))) : 1) && (var_1_7 ? (var_1_8 ? (var_1_6 == ((signed short int) (var_1_11 + var_1_11))) : (var_1_6 == ((signed short int) (var_1_11 + var_1_11)))) : (var_1_6 == ((signed short int) var_1_11)))) && (var_1_11 == ((signed char) (-32 + (var_1_12 + ((((10) < (var_1_13)) ? (10) : (var_1_13)))))))) && ((var_1_12 != var_1_3) ? (var_1_7 ? (var_1_14 == ((float) ((var_1_15 - var_1_16) - (var_1_17 - var_1_18)))) : 1) : (var_1_14 == ((float) var_1_18)))) && (var_1_19 == ((float) var_1_5)) ; VAL [\result=0, isInitial=1, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=10, var_1_7=0, var_1_8=1] [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=10, var_1_7=0, var_1_8=1] [L19] reach_error() VAL [isInitial=1, var_1_11=10, var_1_12=32, var_1_13=31, var_1_14=4294967269, var_1_18=4294967269, var_1_19=4294967268, var_1_2=4294967263, var_1_3=32, var_1_5=4294967268, var_1_6=10, var_1_7=0, var_1_8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 74 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1190/1224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 13:28:55,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash abae505f58f5b150cd30902d50b00592ab647cc43f5107f9aaed41c2bd3b922b --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:28:57,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:28:57,455 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:28:57,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:28:57,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:28:57,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:28:57,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:28:57,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:28:57,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:28:57,495 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:28:57,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:28:57,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:28:57,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:28:57,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:28:57,496 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:28:57,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:28:57,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:28:57,496 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:28:57,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:28:57,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:28:57,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:28:57,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:28:57,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:28:57,497 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:28:57,497 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:28:57,497 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:28:57,497 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:28:57,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:28:57,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:28:57,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:28:57,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:28:57,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:28:57,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:28:57,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:28:57,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:57,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:28:57,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:28:57,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:28:57,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:28:57,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:57,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:28:57,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:28:57,498 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:28:57,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:28:57,499 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:28:57,499 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:28:57,499 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:28:57,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:28:57,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:28:57,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:28:57,499 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> abae505f58f5b150cd30902d50b00592ab647cc43f5107f9aaed41c2bd3b922b [2025-01-09 13:28:57,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:28:57,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:28:57,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:28:57,742 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:28:57,742 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:28:57,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i [2025-01-09 13:28:58,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/845bf1066/5d70d89734824c9d8f2824b7a7693f03/FLAG422838c22 [2025-01-09 13:28:59,174 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:28:59,174 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i [2025-01-09 13:28:59,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/845bf1066/5d70d89734824c9d8f2824b7a7693f03/FLAG422838c22 [2025-01-09 13:28:59,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/845bf1066/5d70d89734824c9d8f2824b7a7693f03 [2025-01-09 13:28:59,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:28:59,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:28:59,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:28:59,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:28:59,211 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:28:59,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@198bf93f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59, skipping insertion in model container [2025-01-09 13:28:59,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,225 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:28:59,333 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i[915,928] [2025-01-09 13:28:59,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:28:59,367 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:28:59,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-35.i[915,928] [2025-01-09 13:28:59,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:28:59,406 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:28:59,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59 WrapperNode [2025-01-09 13:28:59,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:28:59,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:28:59,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:28:59,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:28:59,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,432 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 117 [2025-01-09 13:28:59,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:28:59,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:28:59,432 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:28:59,432 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:28:59,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,452 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:28:59,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,461 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:28:59,474 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:28:59,477 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:28:59,477 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:28:59,478 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (1/1) ... [2025-01-09 13:28:59,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:28:59,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:28:59,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:28:59,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:28:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:28:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:28:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:28:59,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:28:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:28:59,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:28:59,586 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:28:59,587 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:29:01,048 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 13:29:01,048 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:29:01,055 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:29:01,055 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:29:01,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:29:01 BoogieIcfgContainer [2025-01-09 13:29:01,055 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:29:01,057 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:29:01,057 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:29:01,060 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:29:01,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:28:59" (1/3) ... [2025-01-09 13:29:01,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1167cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:29:01, skipping insertion in model container [2025-01-09 13:29:01,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:28:59" (2/3) ... [2025-01-09 13:29:01,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1167cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:29:01, skipping insertion in model container [2025-01-09 13:29:01,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:29:01" (3/3) ... [2025-01-09 13:29:01,062 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-35.i [2025-01-09 13:29:01,071 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:29:01,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-35.i that has 2 procedures, 55 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:29:01,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:29:01,120 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;@5e528a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:29:01,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:29:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:29:01,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 13:29:01,128 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:29:01,129 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:29:01,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:29:01,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:29:01,132 INFO L85 PathProgramCache]: Analyzing trace with hash 500252663, now seen corresponding path program 1 times [2025-01-09 13:29:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:29:01,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053744257] [2025-01-09 13:29:01,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:29:01,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:29:01,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:29:01,144 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:29:01,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 13:29:01,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 13:29:01,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 13:29:01,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:29:01,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:29:01,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:29:01,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:29:01,500 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-01-09 13:29:01,500 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:29:01,500 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:29:01,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053744257] [2025-01-09 13:29:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1053744257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:29:01,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:29:01,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:29:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521179101] [2025-01-09 13:29:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:29:01,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:29:01,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:29:01,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:29:01,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:29:01,520 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 35 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:29:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:29:01,535 INFO L93 Difference]: Finished difference Result 104 states and 171 transitions. [2025-01-09 13:29:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:29:01,537 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-01-09 13:29:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:29:01,542 INFO L225 Difference]: With dead ends: 104 [2025-01-09 13:29:01,542 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 13:29:01,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:29:01,548 INFO L435 NwaCegarLoop]: 74 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, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:29:01,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:29:01,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 13:29:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 13:29:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 13:29:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2025-01-09 13:29:01,583 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 116 [2025-01-09 13:29:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:29:01,584 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2025-01-09 13:29:01,584 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 13:29:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2025-01-09 13:29:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 13:29:01,585 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:29:01,587 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:29:01,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 13:29:01,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:29:01,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:29:01,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:29:01,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1872023165, now seen corresponding path program 1 times [2025-01-09 13:29:01,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:29:01,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494463203] [2025-01-09 13:29:01,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:29:01,790 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:29:01,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:29:01,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:29:01,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 13:29:01,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 13:29:02,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 13:29:02,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:29:02,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:29:02,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 13:29:02,089 INFO L279 TraceCheckSpWp]: Computing forward predicates...