./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-78.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 e9378820110475a355542652e61313eeb7cbd1a9ed890c41ec6fcefb7d91c4d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:40:37,191 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:40:37,244 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:40:37,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:40:37,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:40:37,265 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:40:37,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:40:37,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:40:37,267 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:40:37,267 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:40:37,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:40:37,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:40:37,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:40:37,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:40:37,268 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:40:37,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:40:37,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:40:37,269 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:40:37,269 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:40:37,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:40:37,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:40:37,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:40:37,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:40:37,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:40:37,269 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:40:37,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:40:37,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:40:37,270 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:40:37,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:40:37,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:40:37,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:40:37,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:40:37,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:37,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:40:37,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:40:37,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:40:37,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:40:37,271 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:40:37,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:40:37,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:40:37,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:40:37,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:40:37,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:40:37,271 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 -> e9378820110475a355542652e61313eeb7cbd1a9ed890c41ec6fcefb7d91c4d3 [2025-03-08 13:40:37,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:40:37,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:40:37,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:40:37,506 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:40:37,506 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:40:37,507 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-78.i [2025-03-08 13:40:38,612 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4a7062c/9f13b8e903d8462cb7740bdf68ad5908/FLAG28fa3754d [2025-03-08 13:40:38,834 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:40:38,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-78.i [2025-03-08 13:40:38,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4a7062c/9f13b8e903d8462cb7740bdf68ad5908/FLAG28fa3754d [2025-03-08 13:40:38,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4a7062c/9f13b8e903d8462cb7740bdf68ad5908 [2025-03-08 13:40:38,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:40:38,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:40:38,853 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:38,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:40:38,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:40:38,856 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:38" (1/1) ... [2025-03-08 13:40:38,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710c540f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:38, skipping insertion in model container [2025-03-08 13:40:38,857 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:38" (1/1) ... [2025-03-08 13:40:38,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:40:38,957 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-78.i[917,930] [2025-03-08 13:40:38,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:38,994 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:40:39,001 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-78.i[917,930] [2025-03-08 13:40:39,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:39,036 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:40:39,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39 WrapperNode [2025-03-08 13:40:39,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:39,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:39,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:40:39,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:40:39,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,060 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2025-03-08 13:40:39,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:39,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:40:39,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:40:39,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:40:39,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,068 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,075 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:40:39,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:40:39,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:40:39,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:40:39,084 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:40:39,085 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (1/1) ... [2025-03-08 13:40:39,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:39,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:40:39,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:40:39,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:40:39,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:40:39,129 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:40:39,129 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:40:39,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:40:39,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:40:39,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:40:39,183 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:40:39,184 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:40:39,333 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 13:40:39,335 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:40:39,341 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:40:39,341 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:40:39,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:39 BoogieIcfgContainer [2025-03-08 13:40:39,342 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:40:39,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:40:39,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:40:39,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:40:39,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:40:38" (1/3) ... [2025-03-08 13:40:39,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bcf714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:39, skipping insertion in model container [2025-03-08 13:40:39,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:39" (2/3) ... [2025-03-08 13:40:39,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43bcf714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:39, skipping insertion in model container [2025-03-08 13:40:39,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:39" (3/3) ... [2025-03-08 13:40:39,348 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-78.i [2025-03-08 13:40:39,357 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:40:39,359 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-78.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:40:39,402 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:40:39,411 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;@601b052e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:40:39,412 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:40:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 13:40:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 13:40:39,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:39,424 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:39,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:39,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1469056940, now seen corresponding path program 1 times [2025-03-08 13:40:39,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:40:39,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774872496] [2025-03-08 13:40:39,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:39,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:40:39,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 13:40:39,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 13:40:39,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:39,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:39,611 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 13:40:39,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:40:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774872496] [2025-03-08 13:40:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774872496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:40:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005450088] [2025-03-08 13:40:39,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:39,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:40:39,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:40:39,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:40:39,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 13:40:39,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 13:40:39,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 13:40:39,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:39,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:39,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:40:39,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:40:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2025-03-08 13:40:39,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:40:39,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005450088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:39,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:40:39,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:40:39,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886549115] [2025-03-08 13:40:39,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:39,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:40:39,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:40:39,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:40:39,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:39,767 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 13:40:39,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:39,783 INFO L93 Difference]: Finished difference Result 80 states and 125 transitions. [2025-03-08 13:40:39,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:40:39,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2025-03-08 13:40:39,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:39,788 INFO L225 Difference]: With dead ends: 80 [2025-03-08 13:40:39,789 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 13:40:39,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:39,793 INFO L435 NwaCegarLoop]: 55 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, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:39,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:40:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 13:40:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 13:40:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 13:40:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-03-08 13:40:39,816 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 72 [2025-03-08 13:40:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:39,817 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-03-08 13:40:39,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 13:40:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-03-08 13:40:39,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 13:40:39,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:39,819 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:39,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 13:40:40,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 13:40:40,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:40,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1466095416, now seen corresponding path program 1 times [2025-03-08 13:40:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:40:40,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900513556] [2025-03-08 13:40:40,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:40:40,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 13:40:40,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 13:40:40,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:40,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 13:40:40,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:40:40,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900513556] [2025-03-08 13:40:40,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900513556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:40,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:40:40,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 13:40:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199469172] [2025-03-08 13:40:40,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:40,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:40:40,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:40:40,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:40:40,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:40:40,288 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 13:40:40,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:40,345 INFO L93 Difference]: Finished difference Result 114 states and 159 transitions. [2025-03-08 13:40:40,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:40:40,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2025-03-08 13:40:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:40,348 INFO L225 Difference]: With dead ends: 114 [2025-03-08 13:40:40,348 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 13:40:40,349 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-08 13:40:40,349 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 25 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:40,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 146 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:40:40,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 13:40:40,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-03-08 13:40:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:40:40,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2025-03-08 13:40:40,360 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 72 [2025-03-08 13:40:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:40,360 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2025-03-08 13:40:40,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 13:40:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2025-03-08 13:40:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 13:40:40,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:40,365 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:40,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:40:40,365 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:40,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:40,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1467018937, now seen corresponding path program 1 times [2025-03-08 13:40:40,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:40:40,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232207244] [2025-03-08 13:40:40,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:40,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:40:40,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 13:40:40,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 13:40:40,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:40,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:40:40,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:40:40,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 13:40:40,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 13:40:40,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:40,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:40:40,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:40:40,467 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:40:40,467 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:40:40,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:40:40,470 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 13:40:40,500 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:40:40,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:40:40 BoogieIcfgContainer [2025-03-08 13:40:40,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:40:40,504 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:40:40,504 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:40:40,504 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:40:40,504 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:39" (3/4) ... [2025-03-08 13:40:40,507 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:40:40,508 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:40:40,509 INFO L158 Benchmark]: Toolchain (without parser) took 1656.77ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 103.4MB in the end (delta: 20.6MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2025-03-08 13:40:40,509 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:40,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.57ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 111.2MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:40:40,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.04ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 109.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:40:40,509 INFO L158 Benchmark]: Boogie Preprocessor took 22.29ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:40,509 INFO L158 Benchmark]: IcfgBuilder took 257.77ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 92.5MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:40:40,510 INFO L158 Benchmark]: TraceAbstraction took 1159.83ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 104.3MB in the end (delta: -12.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:40,510 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 103.4MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:40:40,512 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.22ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.57ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 111.2MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.04ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 109.3MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.29ms. Allocated memory is still 167.8MB. Free memory was 109.3MB in the beginning and 107.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 257.77ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 92.5MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1159.83ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 104.3MB in the end (delta: -12.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 167.8MB. Free memory was 103.4MB in the beginning and 103.4MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryArithmeticFLOAToperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -200; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 1; [L25] float var_1_9 = 100.55; [L26] float var_1_10 = 4.75; [L27] float var_1_11 = 128.75; [L28] double var_1_12 = 128.5; [L29] double var_1_13 = 0.0; [L30] double var_1_14 = 127.875; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 16; VAL [isInitial=0, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=0, var_1_3=1, var_1_9=2011/20] [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] FCALL updateLastVariables() [L94] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=2011/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=2011/20] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_3=1, var_1_9=2011/20] [L67] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=2011/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=2011/20] [L67] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=1, var_1_9=2011/20] [L68] var_1_3 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=2011/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=2011/20] [L69] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_9=2011/20] [L70] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L70] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=19/4, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L71] var_1_10 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L72] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=515/4, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L73] var_1_11 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L74] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=257/2, var_1_13=0, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L75] var_1_13 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=257/2, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=257/2, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L76] RET assume_abort_if_not((var_1_13 >= 4611686.018427382800e+12F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=257/2, var_1_14=1023/8, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L77] var_1_14 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_14 >= 0.0F && 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=257/2, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=257/2, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L78] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=257/2, var_1_15=1, var_1_16=16, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L79] var_1_16 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=257/2, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=257/2, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L80] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_12=257/2, var_1_15=1, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L81] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=257/2, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=257/2, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L81] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_12=257/2, var_1_15=1, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L94] RET updateVariables() [L95] CALL step() [L36] COND TRUE 0.8f > (- var_1_10) [L37] var_1_15 = var_1_16 VAL [isInitial=1, var_1_12=257/2, var_1_15=0, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L39] unsigned char stepLocal_1 = var_1_15 > var_1_15; [L40] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=-256, stepLocal_1=0, var_1_12=257/2, var_1_15=0, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L41] COND FALSE !(var_1_2 && stepLocal_0) VAL [isInitial=1, stepLocal_1=0, var_1_12=257/2, var_1_15=0, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256, var_1_9=2011/20] [L48] COND TRUE \read(var_1_2) [L49] var_1_9 = (var_1_10 - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_12=257/2, var_1_15=0, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256] [L57] signed long int stepLocal_2 = var_1_1; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=-200, var_1_12=257/2, var_1_15=0, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256] [L58] COND FALSE !(stepLocal_2 <= ((((8u) < 0 ) ? -(8u) : (8u)))) [L61] var_1_12 = ((var_1_13 - var_1_14) - var_1_11) VAL [isInitial=1, stepLocal_1=0, var_1_15=0, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256] [L95] RET step() [L96] CALL, EXPR property() [L86-L87] return ((((var_1_2 && var_1_3) ? ((var_1_2 && (var_1_15 > var_1_15)) ? (var_1_1 == ((signed long int) (var_1_15 - var_1_15))) : (var_1_1 == ((signed long int) ((var_1_15 + 5) - var_1_15)))) : 1) && (var_1_2 ? (var_1_9 == ((float) (var_1_10 - var_1_11))) : ((var_1_1 < var_1_15) ? (var_1_9 == ((float) ((((var_1_11) > (var_1_10)) ? (var_1_11) : (var_1_10))))) : (var_1_9 == ((float) var_1_10))))) && ((var_1_1 <= ((((8u) < 0 ) ? -(8u) : (8u)))) ? (var_1_12 == ((double) (var_1_10 - 99.5))) : (var_1_12 == ((double) ((var_1_13 - var_1_14) - var_1_11))))) && ((0.8f > (- var_1_10)) ? (var_1_15 == ((unsigned char) var_1_16)) : 1) ; VAL [\result=0, isInitial=1, var_1_15=0, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256] [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_15=0, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256] [L19] reach_error() VAL [isInitial=1, var_1_15=0, var_1_16=0, var_1_1=-200, var_1_2=1, var_1_3=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 70 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 201 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 95 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 106 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 213 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 172 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 522/540 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 13:40:40,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-78.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 e9378820110475a355542652e61313eeb7cbd1a9ed890c41ec6fcefb7d91c4d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:40:42,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:40:42,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:40:42,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:40:42,388 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:40:42,427 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:40:42,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:40:42,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:40:42,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:40:42,428 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:40:42,428 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:40:42,428 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:40:42,428 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:40:42,429 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:42,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:40:42,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:40:42,429 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 -> e9378820110475a355542652e61313eeb7cbd1a9ed890c41ec6fcefb7d91c4d3 [2025-03-08 13:40:42,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:40:42,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:40:42,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:40:42,665 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:40:42,666 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:40:42,666 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-78.i [2025-03-08 13:40:43,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8a3c0db/b0e9cf6e42e94178a843e95c5aa585d0/FLAG9540acd06 [2025-03-08 13:40:44,041 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:40:44,042 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-78.i [2025-03-08 13:40:44,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8a3c0db/b0e9cf6e42e94178a843e95c5aa585d0/FLAG9540acd06 [2025-03-08 13:40:44,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f8a3c0db/b0e9cf6e42e94178a843e95c5aa585d0 [2025-03-08 13:40:44,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:40:44,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:40:44,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:44,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:40:44,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:40:44,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7a1510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44, skipping insertion in model container [2025-03-08 13:40:44,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,460 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:40:44,558 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-78.i[917,930] [2025-03-08 13:40:44,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:44,593 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:40:44,601 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-78.i[917,930] [2025-03-08 13:40:44,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:40:44,624 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:40:44,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44 WrapperNode [2025-03-08 13:40:44,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:40:44,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:44,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:40:44,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:40:44,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,659 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2025-03-08 13:40:44,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:40:44,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:40:44,660 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:40:44,660 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:40:44,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,689 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 13:40:44,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,706 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:40:44,708 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:40:44,708 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:40:44,709 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:40:44,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (1/1) ... [2025-03-08 13:40:44,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:40:44,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:40:44,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 13:40:44,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 13:40:44,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:40:44,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:40:44,761 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:40:44,761 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:40:44,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:40:44,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:40:44,822 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:40:44,824 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:40:51,590 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 13:40:51,590 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:40:51,598 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:40:51,598 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:40:51,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:51 BoogieIcfgContainer [2025-03-08 13:40:51,598 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:40:51,601 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:40:51,601 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:40:51,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:40:51,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:40:44" (1/3) ... [2025-03-08 13:40:51,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25202a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:51, skipping insertion in model container [2025-03-08 13:40:51,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:44" (2/3) ... [2025-03-08 13:40:51,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25202a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:51, skipping insertion in model container [2025-03-08 13:40:51,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:51" (3/3) ... [2025-03-08 13:40:51,609 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-78.i [2025-03-08 13:40:51,618 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:40:51,619 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-78.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:40:51,659 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:40:51,668 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;@2e4e933e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:40:51,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:40:51,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 13:40:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 13:40:51,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:51,678 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:51,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:51,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:51,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1469056940, now seen corresponding path program 1 times [2025-03-08 13:40:51,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:40:51,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175433643] [2025-03-08 13:40:51,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:51,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:51,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:40:51,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:40:51,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 13:40:51,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 13:40:51,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 13:40:51,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:51,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:52,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:40:52,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:40:52,030 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 13:40:52,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:40:52,034 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:40:52,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175433643] [2025-03-08 13:40:52,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175433643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:52,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:40:52,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:40:52,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695900062] [2025-03-08 13:40:52,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:52,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:40:52,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:40:52,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:40:52,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:52,053 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 13:40:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:52,068 INFO L93 Difference]: Finished difference Result 80 states and 125 transitions. [2025-03-08 13:40:52,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:40:52,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2025-03-08 13:40:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:52,073 INFO L225 Difference]: With dead ends: 80 [2025-03-08 13:40:52,073 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 13:40:52,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:40:52,076 INFO L435 NwaCegarLoop]: 55 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, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:52,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:40:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 13:40:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 13:40:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-08 13:40:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-03-08 13:40:52,102 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 72 [2025-03-08 13:40:52,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:52,102 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-03-08 13:40:52,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-03-08 13:40:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-03-08 13:40:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 13:40:52,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:52,105 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:52,117 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-08 13:40:52,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:52,306 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:52,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1466095416, now seen corresponding path program 1 times [2025-03-08 13:40:52,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:40:52,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125064682] [2025-03-08 13:40:52,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:52,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:40:52,309 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:40:52,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 13:40:52,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 13:40:52,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 13:40:52,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:52,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:52,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 13:40:52,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:40:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 13:40:53,094 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:40:53,095 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:40:53,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125064682] [2025-03-08 13:40:53,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125064682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:40:53,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:40:53,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:40:53,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295777992] [2025-03-08 13:40:53,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:40:53,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:40:53,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:40:53,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:40:53,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:40:53,096 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 13:40:57,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:40:57,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:40:57,541 INFO L93 Difference]: Finished difference Result 114 states and 159 transitions. [2025-03-08 13:40:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:40:57,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2025-03-08 13:40:57,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:40:57,575 INFO L225 Difference]: With dead ends: 114 [2025-03-08 13:40:57,575 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 13:40:57,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 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-08 13:40:57,576 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-08 13:40:57,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 146 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-08 13:40:57,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 13:40:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-03-08 13:40:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 13:40:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2025-03-08 13:40:57,587 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 72 [2025-03-08 13:40:57,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:40:57,588 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2025-03-08 13:40:57,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2025-03-08 13:40:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2025-03-08 13:40:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-08 13:40:57,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:40:57,589 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 13:40:57,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 13:40:57,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:57,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:40:57,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:40:57,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1467018937, now seen corresponding path program 1 times [2025-03-08 13:40:57,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:40:57,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812776026] [2025-03-08 13:40:57,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:40:57,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 13:40:57,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:40:57,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 13:40:57,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 13:40:57,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-08 13:40:58,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-08 13:40:58,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:40:58,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:40:58,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 13:40:58,146 INFO L279 TraceCheckSpWp]: Computing forward predicates...