./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:39:14,032 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:39:14,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:39:14,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:39:14,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:39:14,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:39:14,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:39:14,094 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:39:14,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:39:14,094 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:39:14,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:39:14,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:39:14,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:39:14,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:39:14,095 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:39:14,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:39:14,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:39:14,096 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:39:14,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:39:14,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:39:14,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:39:14,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:39:14,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:39:14,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:39:14,098 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:39:14,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:39:14,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:39:14,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:39:14,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:39:14,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:39:14,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:39:14,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:39:14,098 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 [2025-03-08 13:39:14,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:39:14,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:39:14,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:39:14,350 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:39:14,350 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:39:14,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2025-03-08 13:39:15,493 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f25cbe84/16360b930a9346089c4dca2c0d9c3c81/FLAG21bf9bb33 [2025-03-08 13:39:15,780 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:39:15,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2025-03-08 13:39:15,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f25cbe84/16360b930a9346089c4dca2c0d9c3c81/FLAG21bf9bb33 [2025-03-08 13:39:16,065 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f25cbe84/16360b930a9346089c4dca2c0d9c3c81 [2025-03-08 13:39:16,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:39:16,069 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:39:16,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:39:16,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:39:16,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:39:16,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@516a0145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16, skipping insertion in model container [2025-03-08 13:39:16,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:39:16,195 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i[917,930] [2025-03-08 13:39:16,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:39:16,248 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:39:16,256 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i[917,930] [2025-03-08 13:39:16,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:39:16,292 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:39:16,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16 WrapperNode [2025-03-08 13:39:16,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:39:16,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:39:16,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:39:16,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:39:16,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,303 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,320 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-08 13:39:16,321 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:39:16,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:39:16,322 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:39:16,322 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:39:16,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,341 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:39:16,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:39:16,351 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:39:16,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:39:16,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:39:16,354 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (1/1) ... [2025-03-08 13:39:16,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:39:16,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:39:16,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:39:16,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:39:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:39:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:39:16,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:39:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:39:16,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:39:16,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:39:16,454 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:39:16,456 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:39:16,651 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 13:39:16,651 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:39:16,661 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:39:16,662 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:39:16,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:39:16 BoogieIcfgContainer [2025-03-08 13:39:16,662 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:39:16,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:39:16,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:39:16,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:39:16,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:39:16" (1/3) ... [2025-03-08 13:39:16,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acfb062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:39:16, skipping insertion in model container [2025-03-08 13:39:16,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:16" (2/3) ... [2025-03-08 13:39:16,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acfb062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:39:16, skipping insertion in model container [2025-03-08 13:39:16,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:39:16" (3/3) ... [2025-03-08 13:39:16,671 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-68.i [2025-03-08 13:39:16,680 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:39:16,682 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-68.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:39:16,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:39:16,722 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;@7063a3b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:39:16,723 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:39:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 13:39:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 13:39:16,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:39:16,736 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:39:16,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:39:16,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:39:16,740 INFO L85 PathProgramCache]: Analyzing trace with hash -574657649, now seen corresponding path program 1 times [2025-03-08 13:39:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:39:16,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243011010] [2025-03-08 13:39:16,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:39:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:39:16,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 13:39:16,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 13:39:16,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:39:16,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:39:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 13:39:16,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:39:16,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243011010] [2025-03-08 13:39:16,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243011010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:39:16,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322005083] [2025-03-08 13:39:16,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:39:16,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:39:16,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:39:16,937 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:39:16,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:39:17,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 13:39:17,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 13:39:17,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:39:17,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:39:17,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:39:17,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:39:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 13:39:17,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:39:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322005083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:39:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:39:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:39:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797527031] [2025-03-08 13:39:17,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:39:17,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:39:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:39:17,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:39:17,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:39:17,116 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 13:39:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:39:17,134 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2025-03-08 13:39:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:39:17,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2025-03-08 13:39:17,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:39:17,143 INFO L225 Difference]: With dead ends: 100 [2025-03-08 13:39:17,143 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 13:39:17,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:39:17,148 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:39:17,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:39:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 13:39:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 13:39:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 13:39:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-03-08 13:39:17,184 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 110 [2025-03-08 13:39:17,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:39:17,184 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-03-08 13:39:17,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 13:39:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-03-08 13:39:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 13:39:17,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:39:17,188 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:39:17,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:39:17,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:39:17,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:39:17,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:39:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1919541616, now seen corresponding path program 1 times [2025-03-08 13:39:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:39:17,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794663994] [2025-03-08 13:39:17,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:39:17,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:39:17,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 13:39:17,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 13:39:17,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:39:17,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:39:17,574 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 13:39:17,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:39:17,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794663994] [2025-03-08 13:39:17,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794663994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:39:17,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:39:17,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:39:17,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065849858] [2025-03-08 13:39:17,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:39:17,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:39:17,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:39:17,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:39:17,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:39:17,576 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 13:39:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:39:17,596 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2025-03-08 13:39:17,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:39:17,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2025-03-08 13:39:17,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:39:17,597 INFO L225 Difference]: With dead ends: 97 [2025-03-08 13:39:17,597 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 13:39:17,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:39:17,598 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:39:17,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:39:17,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 13:39:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 13:39:17,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 13:39:17,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-08 13:39:17,604 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 110 [2025-03-08 13:39:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:39:17,605 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-08 13:39:17,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 13:39:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-08 13:39:17,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 13:39:17,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:39:17,607 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:39:17,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:39:17,607 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:39:17,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:39:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash -176731281, now seen corresponding path program 1 times [2025-03-08 13:39:17,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:39:17,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119005741] [2025-03-08 13:39:17,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:39:17,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:39:17,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 13:39:17,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 13:39:17,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:39:17,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:39:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [211226144] [2025-03-08 13:39:17,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:39:17,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:39:17,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:39:17,729 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:39:17,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:39:17,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 13:39:17,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 13:39:17,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:39:17,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:39:17,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:39:17,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 13:39:17,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 13:39:17,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:39:17,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:39:17,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:39:17,908 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:39:17,909 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:39:17,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:39:18,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 13:39:18,114 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 13:39:18,190 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:39:18,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:39:18 BoogieIcfgContainer [2025-03-08 13:39:18,192 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:39:18,193 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:39:18,193 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:39:18,193 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:39:18,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:39:16" (3/4) ... [2025-03-08 13:39:18,195 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:39:18,195 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:39:18,196 INFO L158 Benchmark]: Toolchain (without parser) took 2127.22ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 105.4MB in the end (delta: -2.0MB). Peak memory consumption was 1.9MB. Max. memory is 16.1GB. [2025-03-08 13:39:18,196 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:39:18,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.18ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 91.2MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:39:18,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.60ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:39:18,196 INFO L158 Benchmark]: Boogie Preprocessor took 28.07ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 87.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:39:18,196 INFO L158 Benchmark]: IcfgBuilder took 311.34ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 71.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:39:18,197 INFO L158 Benchmark]: TraceAbstraction took 1526.98ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 105.5MB in the end (delta: -35.2MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2025-03-08 13:39:18,197 INFO L158 Benchmark]: Witness Printer took 2.47ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:39:18,201 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.46ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.18ms. Allocated memory is still 142.6MB. Free memory was 103.4MB in the beginning and 91.2MB in the end (delta: 12.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.60ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 89.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.07ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 87.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 311.34ms. Allocated memory is still 142.6MB. Free memory was 87.0MB in the beginning and 71.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1526.98ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 105.5MB in the end (delta: -35.2MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Witness Printer took 2.47ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 105.4MB in the end (delta: 37.0kB). 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 107, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someBinaryDOUBLEComparisonOperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] float var_1_2 = 64.5; [L24] float var_1_3 = 16.8; [L25] signed long int var_1_8 = 10; [L26] unsigned char var_1_9 = 0; [L27] double var_1_10 = 25.5; [L28] double var_1_11 = 999999999.729; [L29] double var_1_12 = 999.8; [L30] signed short int var_1_13 = -25; [L31] signed short int var_1_14 = -64; [L32] signed short int var_1_15 = 0; [L33] signed short int var_1_16 = -8; [L34] signed long int var_1_17 = 5; [L35] unsigned long int var_1_18 = 0; [L36] unsigned long int var_1_19 = 8; [L37] float var_1_20 = 32.375; [L38] signed long int var_1_21 = -10; [L39] signed short int last_1_var_1_13 = -25; [L40] signed long int last_1_var_1_17 = 5; VAL [isInitial=0, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=0] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L103] last_1_var_1_13 = var_1_13 [L104] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_2=129/2, var_1_3=84/5, var_1_8=10, var_1_9=0] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L74] var_1_2 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L75] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_3=84/5, var_1_8=10, var_1_9=0] [L76] var_1_3 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L77] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=10, var_1_9=0] [L78] var_1_8 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L80] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L81] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L82] var_1_9 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1] [L84] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_11=999999999729/1000, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L85] var_1_11 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L86] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=4999/5, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L87] var_1_12 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=-64, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L89] var_1_14 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_14 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not(var_1_14 >= -8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_14 <= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_14 <= 8192) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L92] var_1_15 = __VERIFIER_nondet_short() [L93] CALL assume_abort_if_not(var_1_15 >= -8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not(var_1_15 >= -8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_15 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L94] RET assume_abort_if_not(var_1_15 <= 8191) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=-8, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L95] var_1_16 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_16 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L96] RET assume_abort_if_not(var_1_16 >= -16383) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_16 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not(var_1_16 <= 16383) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=8, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L98] var_1_19 = __VERIFIER_nondet_ulong() [L99] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L99] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L115] RET updateVariables() [L116] CALL step() [L44] signed long int stepLocal_2 = var_1_8 + last_1_var_1_17; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_13=-25, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L45] COND FALSE !(\read(var_1_9)) [L52] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=5, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=259/8, var_1_21=-10, var_1_8=1, var_1_9=0] [L54] var_1_17 = (var_1_13 + var_1_14) [L55] var_1_18 = var_1_19 [L56] var_1_20 = var_1_12 [L57] var_1_21 = var_1_17 [L58] signed long int stepLocal_1 = var_1_17; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_1=1, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L59] COND FALSE !(stepLocal_1 != var_1_21) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L62] unsigned long int stepLocal_0 = var_1_18 + var_1_21; VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_0=1, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L63] COND TRUE (var_1_2 - var_1_3) >= var_1_10 VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_0=1, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=32, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L64] COND TRUE stepLocal_0 >= (var_1_13 / var_1_8) [L65] var_1_1 = ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, stepLocal_2=6, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L116] RET step() [L117] CALL, EXPR property() [L107-L108] return ((((((((var_1_2 - var_1_3) >= var_1_10) ? (((var_1_18 + var_1_21) >= (var_1_13 / var_1_8)) ? (var_1_1 == ((signed long int) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : 1) : (var_1_9 ? (var_1_1 == ((signed long int) ((((var_1_21) > (var_1_18)) ? (var_1_21) : (var_1_18))))) : 1)) && ((var_1_17 != var_1_21) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1)) && (var_1_9 ? ((last_1_var_1_13 <= (var_1_8 + last_1_var_1_17)) ? (var_1_13 == ((signed short int) ((var_1_14 + var_1_15) + var_1_16))) : (var_1_13 == ((signed short int) var_1_15))) : (var_1_13 == ((signed short int) var_1_15)))) && (var_1_17 == ((signed long int) (var_1_13 + var_1_14)))) && (var_1_18 == ((unsigned long int) var_1_19))) && (var_1_20 == ((float) var_1_12))) && (var_1_21 == ((signed long int) var_1_17)) ; VAL [\result=0, isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=-25, last_1_var_1_17=5, var_1_10=51/2, var_1_12=2, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=2, var_1_21=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 94 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 17, 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, 205 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 142 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 550 NumberOfCodeBlocks, 550 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 327 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1600/1632 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:39:18,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:39:19,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:39:20,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:39:20,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:39:20,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:39:20,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:39:20,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:39:20,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:39:20,086 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:39:20,087 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:39:20,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:39:20,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:39:20,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:39:20,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:39:20,087 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:39:20,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:39:20,087 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:39:20,087 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:39:20,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:39:20,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:39:20,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:39:20,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:39:20,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:39:20,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:39:20,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:39:20,091 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:39:20,091 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:39:20,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:39:20,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:39:20,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:39:20,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:39:20,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a066ceb57ae616cacea03e0962ddb0f72c30615de7f169bd50844b1bbd2737e4 [2025-03-08 13:39:20,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:39:20,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:39:20,319 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:39:20,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:39:20,320 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:39:20,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2025-03-08 13:39:21,466 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd99ea00/17c8c96a8e8c41b98cbbeaeae33a68bc/FLAG5898fa1ea [2025-03-08 13:39:21,631 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:39:21,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i [2025-03-08 13:39:21,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd99ea00/17c8c96a8e8c41b98cbbeaeae33a68bc/FLAG5898fa1ea [2025-03-08 13:39:22,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acd99ea00/17c8c96a8e8c41b98cbbeaeae33a68bc [2025-03-08 13:39:22,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:39:22,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:39:22,027 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:39:22,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:39:22,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:39:22,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e291be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22, skipping insertion in model container [2025-03-08 13:39:22,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:39:22,129 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i[917,930] [2025-03-08 13:39:22,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:39:22,182 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:39:22,189 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-68.i[917,930] [2025-03-08 13:39:22,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:39:22,218 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:39:22,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22 WrapperNode [2025-03-08 13:39:22,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:39:22,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:39:22,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:39:22,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:39:22,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,230 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,246 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2025-03-08 13:39:22,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:39:22,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:39:22,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:39:22,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:39:22,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,260 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,280 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:39:22,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,296 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:39:22,303 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:39:22,303 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:39:22,303 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:39:22,304 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (1/1) ... [2025-03-08 13:39:22,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:39:22,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:39:22,337 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:39:22,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:39:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:39:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:39:22,362 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:39:22,362 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:39:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:39:22,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:39:22,413 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:39:22,414 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:39:24,838 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 13:39:24,838 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:39:24,845 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:39:24,845 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:39:24,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:39:24 BoogieIcfgContainer [2025-03-08 13:39:24,845 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:39:24,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:39:24,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:39:24,851 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:39:24,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:39:22" (1/3) ... [2025-03-08 13:39:24,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0f3609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:39:24, skipping insertion in model container [2025-03-08 13:39:24,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:39:22" (2/3) ... [2025-03-08 13:39:24,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a0f3609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:39:24, skipping insertion in model container [2025-03-08 13:39:24,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:39:24" (3/3) ... [2025-03-08 13:39:24,852 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-68.i [2025-03-08 13:39:24,863 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:39:24,864 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-68.i that has 2 procedures, 53 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:39:24,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:39:24,929 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;@6a61500d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:39:24,929 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:39:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 13:39:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 13:39:24,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:39:24,937 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:39:24,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:39:24,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:39:24,941 INFO L85 PathProgramCache]: Analyzing trace with hash -574657649, now seen corresponding path program 1 times [2025-03-08 13:39:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:39:24,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968802989] [2025-03-08 13:39:24,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:39:24,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:39:24,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:39:24,951 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:39:24,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:39:25,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 13:39:25,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 13:39:25,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:39:25,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:39:25,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:39:25,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:39:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2025-03-08 13:39:25,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:39:25,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:39:25,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968802989] [2025-03-08 13:39:25,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968802989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:39:25,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:39:25,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:39:25,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450532905] [2025-03-08 13:39:25,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:39:25,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:39:25,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:39:25,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:39:25,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:39:25,262 INFO L87 Difference]: Start difference. First operand has 53 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 13:39:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:39:25,275 INFO L93 Difference]: Finished difference Result 100 states and 166 transitions. [2025-03-08 13:39:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:39:25,276 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 110 [2025-03-08 13:39:25,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:39:25,280 INFO L225 Difference]: With dead ends: 100 [2025-03-08 13:39:25,280 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 13:39:25,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:39:25,283 INFO L435 NwaCegarLoop]: 72 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, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:39:25,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:39:25,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 13:39:25,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 13:39:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 13:39:25,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-03-08 13:39:25,313 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 110 [2025-03-08 13:39:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:39:25,313 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-03-08 13:39:25,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 13:39:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-03-08 13:39:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 13:39:25,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:39:25,317 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:39:25,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 13:39:25,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:39:25,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:39:25,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:39:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1919541616, now seen corresponding path program 1 times [2025-03-08 13:39:25,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:39:25,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [725175627] [2025-03-08 13:39:25,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:39:25,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:39:25,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:39:25,522 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:39:25,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:39:25,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 13:39:25,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 13:39:25,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:39:25,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:39:25,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 13:39:25,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:39:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 13:39:25,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:39:25,831 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:39:25,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [725175627] [2025-03-08 13:39:25,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [725175627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:39:25,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:39:25,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:39:25,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428627914] [2025-03-08 13:39:25,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:39:25,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 13:39:25,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:39:25,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 13:39:25,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:39:25,834 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 13:39:27,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:39:27,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:39:27,024 INFO L93 Difference]: Finished difference Result 97 states and 141 transitions. [2025-03-08 13:39:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 13:39:27,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2025-03-08 13:39:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:39:27,050 INFO L225 Difference]: With dead ends: 97 [2025-03-08 13:39:27,050 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 13:39:27,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 13:39:27,051 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:39:27,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 13:39:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 13:39:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-08 13:39:27,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 13:39:27,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2025-03-08 13:39:27,056 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 110 [2025-03-08 13:39:27,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:39:27,057 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2025-03-08 13:39:27,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 13:39:27,057 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2025-03-08 13:39:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-08 13:39:27,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:39:27,058 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:39:27,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 13:39:27,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:39:27,259 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:39:27,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:39:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash -176731281, now seen corresponding path program 1 times [2025-03-08 13:39:27,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:39:27,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146506631] [2025-03-08 13:39:27,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:39:27,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:39:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:39:27,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:39:27,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:39:27,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 13:39:27,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 13:39:27,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:39:27,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:39:27,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 13:39:27,520 INFO L279 TraceCheckSpWp]: Computing forward predicates...