./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-8.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 d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:48:04,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:48:04,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 02:48:04,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:48:04,999 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:48:05,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:48:05,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:48:05,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:48:05,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:48:05,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:48:05,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:48:05,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:48:05,030 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:48:05,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:48:05,030 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:48:05,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:48:05,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:48:05,031 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:48:05,031 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 02:48:05,031 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:48:05,031 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:48:05,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:48:05,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:48:05,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:48:05,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:48:05,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:48:05,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:48:05,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:48:05,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:48:05,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:48:05,032 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 -> d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 [2025-03-17 02:48:05,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:48:05,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:48:05,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:48:05,287 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:48:05,287 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:48:05,288 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-8.i [2025-03-17 02:48:06,504 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/111d12c5b/14950282c7d343d39cfba0d03f7b195b/FLAG49a2269ef [2025-03-17 02:48:06,775 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:48:06,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i [2025-03-17 02:48:06,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/111d12c5b/14950282c7d343d39cfba0d03f7b195b/FLAG49a2269ef [2025-03-17 02:48:06,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/111d12c5b/14950282c7d343d39cfba0d03f7b195b [2025-03-17 02:48:06,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:48:06,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:48:06,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:48:06,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:48:06,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:48:06,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:48:06" (1/1) ... [2025-03-17 02:48:06,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:06, skipping insertion in model container [2025-03-17 02:48:06,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:48:06" (1/1) ... [2025-03-17 02:48:06,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:48:06,954 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-8.i[916,929] [2025-03-17 02:48:06,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:48:07,004 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:48:07,014 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-8.i[916,929] [2025-03-17 02:48:07,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:48:07,047 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:48:07,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07 WrapperNode [2025-03-17 02:48:07,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:48:07,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:48:07,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:48:07,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:48:07,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,081 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-17 02:48:07,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:48:07,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:48:07,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:48:07,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:48:07,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,094 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,112 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-17 02:48:07,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,117 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,118 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,119 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:48:07,122 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:48:07,122 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:48:07,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:48:07,123 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (1/1) ... [2025-03-17 02:48:07,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:48:07,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:48:07,167 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-17 02:48:07,171 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-17 02:48:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:48:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:48:07,193 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:48:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 02:48:07,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:48:07,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:48:07,250 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:48:07,252 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:48:07,453 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:48:07,453 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:48:07,463 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:48:07,463 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:48:07,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:48:07 BoogieIcfgContainer [2025-03-17 02:48:07,463 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:48:07,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:48:07,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:48:07,469 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:48:07,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:48:06" (1/3) ... [2025-03-17 02:48:07,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b97074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:48:07, skipping insertion in model container [2025-03-17 02:48:07,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:07" (2/3) ... [2025-03-17 02:48:07,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b97074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:48:07, skipping insertion in model container [2025-03-17 02:48:07,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:48:07" (3/3) ... [2025-03-17 02:48:07,472 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-8.i [2025-03-17 02:48:07,483 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:48:07,485 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-8.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:48:07,533 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:48:07,544 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;@3fcf8af5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:48:07,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:48:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:48:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:48:07,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:48:07,561 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:48:07,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:48:07,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:48:07,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1611092312, now seen corresponding path program 1 times [2025-03-17 02:48:07,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:48:07,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948785783] [2025-03-17 02:48:07,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:48:07,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:48:07,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:48:07,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:48:07,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:48:07,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:48:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 02:48:07,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:48:07,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948785783] [2025-03-17 02:48:07,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948785783] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 02:48:07,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900409720] [2025-03-17 02:48:07,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:48:07,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 02:48:07,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:48:07,783 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-17 02:48:07,785 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-17 02:48:07,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:48:07,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:48:07,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:48:07,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:48:07,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:48:07,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:48:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 02:48:07,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:48:07,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [900409720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:48:07,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 02:48:07,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 02:48:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58443582] [2025-03-17 02:48:07,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:48:07,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:48:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:48:07,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:48:07,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:48:07,959 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:48:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:48:07,981 INFO L93 Difference]: Finished difference Result 79 states and 132 transitions. [2025-03-17 02:48:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:48:07,984 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2025-03-17 02:48:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:48:07,988 INFO L225 Difference]: With dead ends: 79 [2025-03-17 02:48:07,989 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 02:48:07,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-17 02:48:07,996 INFO L435 NwaCegarLoop]: 56 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, 56 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-17 02:48:07,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:48:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 02:48:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 02:48:08,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:48:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2025-03-17 02:48:08,029 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 88 [2025-03-17 02:48:08,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:48:08,030 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2025-03-17 02:48:08,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:48:08,030 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2025-03-17 02:48:08,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:48:08,034 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:48:08,034 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:48:08,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 02:48:08,239 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-17 02:48:08,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:48:08,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:48:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1267310836, now seen corresponding path program 1 times [2025-03-17 02:48:08,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:48:08,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832597719] [2025-03-17 02:48:08,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:48:08,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:48:08,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:48:08,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:48:08,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:48:08,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:48:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:48:08,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 02:48:08,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832597719] [2025-03-17 02:48:08,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832597719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:48:08,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:48:08,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 02:48:08,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604451004] [2025-03-17 02:48:08,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:48:08,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 02:48:08,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 02:48:08,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 02:48:08,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 02:48:08,493 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:48:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:48:08,615 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2025-03-17 02:48:08,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 02:48:08,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2025-03-17 02:48:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:48:08,617 INFO L225 Difference]: With dead ends: 77 [2025-03-17 02:48:08,617 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 02:48:08,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:48:08,618 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 49 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 02:48:08,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 68 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 02:48:08,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 02:48:08,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 02:48:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:48:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2025-03-17 02:48:08,627 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 88 [2025-03-17 02:48:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:48:08,628 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2025-03-17 02:48:08,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:48:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2025-03-17 02:48:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:48:08,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:48:08,630 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:48:08,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 02:48:08,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:48:08,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:48:08,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1268234357, now seen corresponding path program 1 times [2025-03-17 02:48:08,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 02:48:08,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763365240] [2025-03-17 02:48:08,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:48:08,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 02:48:08,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:48:08,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:48:08,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:48:08,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:48:08,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 02:48:08,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:48:08,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:48:08,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:48:08,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 02:48:08,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 02:48:08,817 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 02:48:08,818 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 02:48:08,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 02:48:08,821 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-17 02:48:08,866 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 02:48:08,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:48:08 BoogieIcfgContainer [2025-03-17 02:48:08,869 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 02:48:08,870 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 02:48:08,870 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 02:48:08,870 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 02:48:08,870 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:48:07" (3/4) ... [2025-03-17 02:48:08,872 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 02:48:08,873 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 02:48:08,873 INFO L158 Benchmark]: Toolchain (without parser) took 2064.73ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 59.9MB in the end (delta: 50.9MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2025-03-17 02:48:08,874 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:48:08,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.88ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:48:08,875 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.27ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 02:48:08,876 INFO L158 Benchmark]: Boogie Preprocessor took 39.09ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 93.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:48:08,877 INFO L158 Benchmark]: IcfgBuilder took 341.20ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 77.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 02:48:08,877 INFO L158 Benchmark]: TraceAbstraction took 1403.72ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 59.9MB in the end (delta: 17.5MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2025-03-17 02:48:08,878 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 142.6MB. Free memory was 59.9MB in the beginning and 59.9MB in the end (delta: 17.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 02:48:08,879 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.88ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.27ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.2MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.09ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 93.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 341.20ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 77.7MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1403.72ms. Allocated memory is still 142.6MB. Free memory was 77.4MB in the beginning and 59.9MB in the end (delta: 17.5MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 142.6MB. Free memory was 59.9MB in the beginning and 59.9MB in the end (delta: 17.6kB). 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 94, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed long int var_1_8 = 64; [L28] float var_1_12 = 2.4; [L29] float var_1_13 = 127.75; [L30] float var_1_14 = 0.0; [L31] float var_1_15 = 31.4; [L32] float var_1_16 = 256.75; [L33] float var_1_17 = 256.6; [L34] signed long int var_1_18 = 0; [L35] unsigned char var_1_19 = 32; [L36] unsigned char var_1_20 = 100; [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L72] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L72] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L73] var_1_6 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L75] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L75] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L77] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L79] var_1_13 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L80] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L81] var_1_14 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L82] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L83] var_1_15 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L84] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L85] var_1_16 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L86] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L87] var_1_20 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L88] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L89] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L89] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L102] RET updateVariables() [L103] CALL step() [L40] var_1_17 = var_1_14 [L41] var_1_19 = var_1_20 [L42] var_1_18 = var_1_19 [L43] unsigned char stepLocal_1 = var_1_19; [L44] signed long int stepLocal_0 = (var_1_18 * var_1_18) * (var_1_19 - var_1_19); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=256, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L45] COND FALSE !(stepLocal_0 >= 1u) [L52] var_1_8 = var_1_19 VAL [isInitial=1, stepLocal_1=256, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L54] signed long int stepLocal_2 = var_1_8; VAL [isInitial=1, stepLocal_1=256, stepLocal_2=0, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L55] COND FALSE !(var_1_19 > stepLocal_2) [L58] var_1_12 = (var_1_16 - (var_1_14 + var_1_15)) VAL [isInitial=1, stepLocal_1=256, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=0, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L60] COND TRUE var_1_18 >= (8u * var_1_8) [L61] var_1_1 = (! (var_1_4 || (var_1_5 || var_1_6))) VAL [isInitial=1, stepLocal_1=256, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=1, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L103] RET step() [L104] CALL, EXPR property() [L94-L95] return ((((((var_1_18 >= (8u * var_1_8)) ? (var_1_1 == ((unsigned char) (! (var_1_4 || (var_1_5 || var_1_6))))) : (var_1_1 == ((unsigned char) var_1_7))) && ((((var_1_18 * var_1_18) * (var_1_19 - var_1_19)) >= 1u) ? ((var_1_18 <= var_1_19) ? (var_1_8 == ((signed long int) var_1_19)) : (var_1_8 == ((signed long int) var_1_19))) : (var_1_8 == ((signed long int) var_1_19)))) && ((var_1_19 > var_1_8) ? (var_1_12 == ((float) (var_1_13 + ((var_1_14 - var_1_15) - var_1_16)))) : (var_1_12 == ((float) (var_1_16 - (var_1_14 + var_1_15)))))) && (var_1_17 == ((float) var_1_14))) && (var_1_18 == ((signed long int) var_1_19))) && (var_1_19 == ((unsigned char) var_1_20)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=1, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=256, var_1_1=1, var_1_20=256, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 74 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 106 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 6, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 352 NumberOfCodeBlocks, 352 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 269 SizeOfPredicates, 0 NumberOfNonLiveVariables, 220 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1066/1092 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-17 02:48:08,896 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-8.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 d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 02:48:10,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 02:48:10,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 02:48:10,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 02:48:10,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 02:48:10,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 02:48:10,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 02:48:10,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 02:48:10,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 02:48:10,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 02:48:10,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 02:48:10,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 02:48:10,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 02:48:10,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 02:48:10,902 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 02:48:10,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 02:48:10,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 02:48:10,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 02:48:10,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 02:48:10,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 02:48:10,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 02:48:10,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 02:48:10,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 02:48:10,903 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 02:48:10,903 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 02:48:10,903 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 02:48:10,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 02:48:10,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 02:48:10,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 02:48:10,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 02:48:10,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 02:48:10,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 02:48:10,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 02:48:10,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 02:48:10,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:48:10,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 02:48:10,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 02:48:10,905 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 02:48:10,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 02:48:10,905 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 02:48:10,905 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 02:48:10,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 02:48:10,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 02:48:10,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 02:48:10,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 02:48:10,906 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 -> d71ae82dd186f34587e5c658cb62f85254bcdaf9e3f74492a6d8986ef7340c33 [2025-03-17 02:48:11,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 02:48:11,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 02:48:11,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 02:48:11,153 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 02:48:11,153 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 02:48:11,155 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-8.i [2025-03-17 02:48:12,406 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4738fb43b/765f0b81137f447ebc9f1f75e540b5e9/FLAG9c1bf2a1f [2025-03-17 02:48:12,592 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 02:48:12,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-8.i [2025-03-17 02:48:12,600 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4738fb43b/765f0b81137f447ebc9f1f75e540b5e9/FLAG9c1bf2a1f [2025-03-17 02:48:12,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4738fb43b/765f0b81137f447ebc9f1f75e540b5e9 [2025-03-17 02:48:12,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 02:48:12,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 02:48:12,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 02:48:12,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 02:48:12,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 02:48:12,966 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:48:12" (1/1) ... [2025-03-17 02:48:12,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34938247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:12, skipping insertion in model container [2025-03-17 02:48:12,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:48:12" (1/1) ... [2025-03-17 02:48:12,980 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 02:48:13,073 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-8.i[916,929] [2025-03-17 02:48:13,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:48:13,109 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 02:48:13,118 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-8.i[916,929] [2025-03-17 02:48:13,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 02:48:13,141 INFO L204 MainTranslator]: Completed translation [2025-03-17 02:48:13,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13 WrapperNode [2025-03-17 02:48:13,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 02:48:13,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 02:48:13,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 02:48:13,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 02:48:13,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,171 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-03-17 02:48:13,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 02:48:13,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 02:48:13,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 02:48:13,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 02:48:13,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,194 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-17 02:48:13,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,199 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 02:48:13,208 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 02:48:13,208 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 02:48:13,208 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 02:48:13,209 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (1/1) ... [2025-03-17 02:48:13,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 02:48:13,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 02:48:13,231 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-17 02:48:13,236 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-17 02:48:13,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 02:48:13,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 02:48:13,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 02:48:13,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 02:48:13,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 02:48:13,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 02:48:13,329 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 02:48:13,331 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 02:48:16,218 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-17 02:48:16,219 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 02:48:16,225 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 02:48:16,225 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 02:48:16,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:48:16 BoogieIcfgContainer [2025-03-17 02:48:16,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 02:48:16,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 02:48:16,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 02:48:16,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 02:48:16,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:48:12" (1/3) ... [2025-03-17 02:48:16,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c67d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:48:16, skipping insertion in model container [2025-03-17 02:48:16,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:48:13" (2/3) ... [2025-03-17 02:48:16,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c67d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:48:16, skipping insertion in model container [2025-03-17 02:48:16,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:48:16" (3/3) ... [2025-03-17 02:48:16,237 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-8.i [2025-03-17 02:48:16,249 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 02:48:16,250 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-8.i that has 2 procedures, 41 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 02:48:16,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 02:48:16,302 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;@1b04b1b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 02:48:16,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 02:48:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:48:16,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:48:16,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:48:16,311 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:48:16,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:48:16,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:48:16,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1611092312, now seen corresponding path program 1 times [2025-03-17 02:48:16,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:48:16,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267772335] [2025-03-17 02:48:16,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:48:16,323 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-17 02:48:16,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:48:16,325 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-17 02:48:16,327 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-17 02:48:16,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:48:16,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:48:16,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:48:16,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:48:16,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 02:48:16,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:48:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 02:48:16,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:48:16,650 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:48:16,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267772335] [2025-03-17 02:48:16,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267772335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:48:16,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:48:16,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 02:48:16,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425428464] [2025-03-17 02:48:16,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:48:16,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 02:48:16,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:48:16,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 02:48:16,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 02:48:16,672 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:48:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:48:16,685 INFO L93 Difference]: Finished difference Result 79 states and 132 transitions. [2025-03-17 02:48:16,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 02:48:16,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2025-03-17 02:48:16,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:48:16,691 INFO L225 Difference]: With dead ends: 79 [2025-03-17 02:48:16,691 INFO L226 Difference]: Without dead ends: 39 [2025-03-17 02:48:16,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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-17 02:48:16,694 INFO L435 NwaCegarLoop]: 56 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, 56 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-17 02:48:16,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 02:48:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-17 02:48:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-17 02:48:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:48:16,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2025-03-17 02:48:16,736 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 88 [2025-03-17 02:48:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:48:16,736 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2025-03-17 02:48:16,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 02:48:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2025-03-17 02:48:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:48:16,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:48:16,741 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:48:16,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 02:48:16,942 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-17 02:48:16,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:48:16,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:48:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1267310836, now seen corresponding path program 1 times [2025-03-17 02:48:16,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:48:16,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091220503] [2025-03-17 02:48:16,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:48:16,944 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-17 02:48:16,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:48:16,945 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-17 02:48:16,947 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-17 02:48:16,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:48:17,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:48:17,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:48:17,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:48:17,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 02:48:17,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:48:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 02:48:17,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 02:48:17,365 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 02:48:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091220503] [2025-03-17 02:48:17,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091220503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 02:48:17,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 02:48:17,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 02:48:17,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59351038] [2025-03-17 02:48:17,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 02:48:17,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 02:48:17,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 02:48:17,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 02:48:17,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:48:17,370 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:48:18,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 02:48:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 02:48:19,094 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2025-03-17 02:48:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 02:48:19,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2025-03-17 02:48:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 02:48:19,097 INFO L225 Difference]: With dead ends: 105 [2025-03-17 02:48:19,099 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 02:48:19,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-17 02:48:19,100 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 71 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 02:48:19,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 145 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 02:48:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 02:48:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 39. [2025-03-17 02:48:19,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 02:48:19,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2025-03-17 02:48:19,111 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 88 [2025-03-17 02:48:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 02:48:19,112 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2025-03-17 02:48:19,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 02:48:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2025-03-17 02:48:19,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 02:48:19,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 02:48:19,115 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:48:19,127 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-17 02:48:19,316 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-17 02:48:19,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 02:48:19,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 02:48:19,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1268234357, now seen corresponding path program 1 times [2025-03-17 02:48:19,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 02:48:19,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490430476] [2025-03-17 02:48:19,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 02:48:19,319 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-17 02:48:19,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 02:48:19,321 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-17 02:48:19,323 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-17 02:48:19,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 02:48:19,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 02:48:19,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 02:48:19,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 02:48:19,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 02:48:19,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 02:48:36,421 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 48 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 02:48:49,326 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 02:49:08,666 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:49:14,096 WARN L286 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 02:49:32,194 WARN L286 SmtUtils]: Spent 5.59s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)