./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.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-21.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 4557fd955b08b5fada9f3a6efa621afd9324a377fdc4d7b9e90703dc668aa740 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:33:49,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:33:49,310 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 13:33:49,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:33:49,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:33:49,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:33:49,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:33:49,332 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:33:49,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:33:49,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:33:49,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:33:49,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:33:49,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:33:49,334 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:33:49,334 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:33:49,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:33:49,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:33:49,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:33:49,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:33:49,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:33:49,336 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:33:49,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:33:49,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 13:33:49,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 13:33:49,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:33:49,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:33:49,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:33:49,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:33:49,336 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 -> 4557fd955b08b5fada9f3a6efa621afd9324a377fdc4d7b9e90703dc668aa740 [2025-03-08 13:33:49,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:33:49,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:33:49,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:33:49,593 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:33:49,593 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:33:49,595 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-21.i [2025-03-08 13:33:50,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825d3367a/a256a5e7373d4d7a822ba72748953160/FLAGc4e984dd1 [2025-03-08 13:33:50,988 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:33:50,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i [2025-03-08 13:33:50,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825d3367a/a256a5e7373d4d7a822ba72748953160/FLAGc4e984dd1 [2025-03-08 13:33:51,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/825d3367a/a256a5e7373d4d7a822ba72748953160 [2025-03-08 13:33:51,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:33:51,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:33:51,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:33:51,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:33:51,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:33:51,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c95e135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51, skipping insertion in model container [2025-03-08 13:33:51,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,042 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:33:51,148 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-21.i[917,930] [2025-03-08 13:33:51,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:33:51,198 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:33:51,208 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-21.i[917,930] [2025-03-08 13:33:51,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:33:51,248 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:33:51,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51 WrapperNode [2025-03-08 13:33:51,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:33:51,249 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:33:51,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:33:51,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:33:51,255 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:33:51" (1/1) ... [2025-03-08 13:33:51,266 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:33:51" (1/1) ... [2025-03-08 13:33:51,288 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-03-08 13:33:51,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:33:51,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:33:51,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:33:51,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:33:51,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,318 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:33:51,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,328 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:33:51,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:33:51,334 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:33:51,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:33:51,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:51" (1/1) ... [2025-03-08 13:33:51,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:33:51,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:33:51,361 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:33:51,364 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:33:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:33:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:33:51,381 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:33:51,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 13:33:51,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:33:51,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:33:51,435 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:33:51,437 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:33:51,594 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 13:33:51,595 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:33:51,600 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:33:51,600 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:33:51,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:33:51 BoogieIcfgContainer [2025-03-08 13:33:51,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:33:51,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:33:51,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:33:51,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:33:51,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:33:51" (1/3) ... [2025-03-08 13:33:51,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653a3cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:33:51, skipping insertion in model container [2025-03-08 13:33: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:33:51" (2/3) ... [2025-03-08 13:33:51,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653a3cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:33:51, skipping insertion in model container [2025-03-08 13:33: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:33:51" (3/3) ... [2025-03-08 13:33:51,608 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-21.i [2025-03-08 13:33:51,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:33:51,618 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-21.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:33:51,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:33:51,660 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;@6dff57ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:33:51,661 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:33:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 13:33:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 13:33:51,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:33:51,672 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:51,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:33:51,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:33:51,677 INFO L85 PathProgramCache]: Analyzing trace with hash -651377664, now seen corresponding path program 1 times [2025-03-08 13:33:51,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:33:51,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131898462] [2025-03-08 13:33:51,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:33:51,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:33:51,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 13:33:51,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 13:33:51,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:33:51,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:33:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 13:33:51,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:33:51,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131898462] [2025-03-08 13:33:51,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131898462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 13:33:51,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548994011] [2025-03-08 13:33:51,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:33:51,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:33:51,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:33:51,844 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:33:51,845 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:33:51,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 13:33:51,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 13:33:51,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:33:51,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:33:51,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:33:51,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:33:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 13:33:51,930 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:33:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548994011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:33:51,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 13:33:51,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 13:33:51,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558846480] [2025-03-08 13:33:51,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:33:51,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:33:51,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:33:51,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:33:51,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:33:51,949 INFO L87 Difference]: Start difference. First operand has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 13:33:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:33:51,964 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2025-03-08 13:33:51,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:33:51,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2025-03-08 13:33:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:33:51,971 INFO L225 Difference]: With dead ends: 70 [2025-03-08 13:33:51,971 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 13:33:51,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 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:33:51,977 INFO L435 NwaCegarLoop]: 48 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, 48 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:33:51,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:33:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 13:33:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 13:33:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 13:33:52,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2025-03-08 13:33:52,002 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 53 [2025-03-08 13:33:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:33:52,003 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2025-03-08 13:33:52,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 13:33:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2025-03-08 13:33:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 13:33:52,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:33:52,005 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:52,012 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:33:52,206 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:33:52,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:33:52,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:33:52,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1198733311, now seen corresponding path program 1 times [2025-03-08 13:33:52,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:33:52,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553368515] [2025-03-08 13:33:52,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:33:52,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:33:52,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 13:33:52,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 13:33:52,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:33:52,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:33:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 13:33:53,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:33:53,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553368515] [2025-03-08 13:33:53,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553368515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:33:53,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:33:53,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 13:33:53,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87396757] [2025-03-08 13:33:53,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:33:53,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 13:33:53,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:33:53,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 13:33:53,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:33:53,495 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 13:33:53,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:33:53,759 INFO L93 Difference]: Finished difference Result 160 states and 212 transitions. [2025-03-08 13:33:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 13:33:53,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2025-03-08 13:33:53,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:33:53,761 INFO L225 Difference]: With dead ends: 160 [2025-03-08 13:33:53,762 INFO L226 Difference]: Without dead ends: 128 [2025-03-08 13:33:53,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-03-08 13:33:53,763 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 130 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 13:33:53,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 313 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 13:33:53,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-08 13:33:53,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2025-03-08 13:33:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 63 states have internal predecessors, (77), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 13:33:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2025-03-08 13:33:53,774 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 53 [2025-03-08 13:33:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:33:53,774 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2025-03-08 13:33:53,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 13:33:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2025-03-08 13:33:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 13:33:53,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:33:53,775 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:53,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 13:33:53,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:33:53,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:33:53,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1203229182, now seen corresponding path program 1 times [2025-03-08 13:33:53,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:33:53,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133834509] [2025-03-08 13:33:53,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:33:53,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:33:53,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 13:33:53,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 13:33:53,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:33:53,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:33:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 13:33:54,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:33:54,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133834509] [2025-03-08 13:33:54,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133834509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:33:54,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:33:54,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 13:33:54,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393488025] [2025-03-08 13:33:54,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:33:54,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 13:33:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:33:54,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 13:33:54,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 13:33:54,388 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 13:33:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:33:54,752 INFO L93 Difference]: Finished difference Result 307 states and 397 transitions. [2025-03-08 13:33:54,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 13:33:54,755 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 55 [2025-03-08 13:33:54,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:33:54,757 INFO L225 Difference]: With dead ends: 307 [2025-03-08 13:33:54,757 INFO L226 Difference]: Without dead ends: 234 [2025-03-08 13:33:54,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-03-08 13:33:54,760 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 124 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:33:54,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 326 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:33:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-08 13:33:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 154. [2025-03-08 13:33:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 117 states have internal predecessors, (144), 31 states have call successors, (31), 6 states have call predecessors, (31), 6 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 13:33:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 206 transitions. [2025-03-08 13:33:54,795 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 206 transitions. Word has length 55 [2025-03-08 13:33:54,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:33:54,795 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 206 transitions. [2025-03-08 13:33:54,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 13:33:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 206 transitions. [2025-03-08 13:33:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 13:33:54,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:33:54,798 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:54,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 13:33:54,798 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:33:54,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:33:54,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2061180191, now seen corresponding path program 1 times [2025-03-08 13:33:54,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:33:54,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022390846] [2025-03-08 13:33:54,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:33:54,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:33:54,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 13:33:54,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 13:33:54,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:33:54,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:33:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 13:33:55,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 13:33:55,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022390846] [2025-03-08 13:33:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022390846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:33:55,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:33:55,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 13:33:55,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449942322] [2025-03-08 13:33:55,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:33:55,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 13:33:55,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 13:33:55,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 13:33:55,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 13:33:55,210 INFO L87 Difference]: Start difference. First operand 154 states and 206 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 13:33:55,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:33:55,549 INFO L93 Difference]: Finished difference Result 244 states and 306 transitions. [2025-03-08 13:33:55,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 13:33:55,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 55 [2025-03-08 13:33:55,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:33:55,551 INFO L225 Difference]: With dead ends: 244 [2025-03-08 13:33:55,551 INFO L226 Difference]: Without dead ends: 242 [2025-03-08 13:33:55,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2025-03-08 13:33:55,552 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 113 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 13:33:55,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 285 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 13:33:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-08 13:33:55,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 168. [2025-03-08 13:33:55,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 128 states have internal predecessors, (155), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 13:33:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 223 transitions. [2025-03-08 13:33:55,572 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 223 transitions. Word has length 55 [2025-03-08 13:33:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:33:55,572 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 223 transitions. [2025-03-08 13:33:55,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 13:33:55,572 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 223 transitions. [2025-03-08 13:33:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 13:33:55,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:33:55,575 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:55,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 13:33:55,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:33:55,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:33:55,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1324063288, now seen corresponding path program 1 times [2025-03-08 13:33:55,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 13:33:55,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323006677] [2025-03-08 13:33:55,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:33:55,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 13:33:55,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 13:33:55,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 13:33:55,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:33:55,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 13:33:55,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1088262194] [2025-03-08 13:33:55,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:33:55,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:33:55,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:33:55,606 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 13:33:55,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 13:33:55,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 13:33:55,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 13:33:55,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:33:55,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:33:55,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 13:33:55,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 13:33:55,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 13:33:55,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:33:55,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 13:33:55,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 13:33:55,693 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 13:33:55,693 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 13:33:55,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 13:33:55,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 13:33:55,897 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 13:33:55,935 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 13:33:55,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:33:55 BoogieIcfgContainer [2025-03-08 13:33:55,938 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 13:33:55,938 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 13:33:55,938 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 13:33:55,938 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 13:33:55,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:33:51" (3/4) ... [2025-03-08 13:33:55,945 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 13:33:55,946 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 13:33:55,947 INFO L158 Benchmark]: Toolchain (without parser) took 4929.11ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 155.1MB in the beginning and 130.0MB in the end (delta: 25.1MB). Peak memory consumption was 65.9MB. Max. memory is 16.1GB. [2025-03-08 13:33:55,948 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:33:55,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.97ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 142.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:33:55,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.50ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 140.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 13:33:55,949 INFO L158 Benchmark]: Boogie Preprocessor took 40.95ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 137.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:33:55,949 INFO L158 Benchmark]: IcfgBuilder took 266.64ms. Allocated memory is still 201.3MB. Free memory was 137.5MB in the beginning and 123.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 13:33:55,950 INFO L158 Benchmark]: TraceAbstraction took 4335.62ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 122.3MB in the beginning and 130.1MB in the end (delta: -7.8MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. [2025-03-08 13:33:55,950 INFO L158 Benchmark]: Witness Printer took 8.35ms. Allocated memory is still 243.3MB. Free memory was 130.1MB in the beginning and 130.0MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 13:33:55,951 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 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.97ms. Allocated memory is still 201.3MB. Free memory was 154.8MB in the beginning and 142.2MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.50ms. Allocated memory is still 201.3MB. Free memory was 142.2MB in the beginning and 140.2MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.95ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 137.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 266.64ms. Allocated memory is still 201.3MB. Free memory was 137.5MB in the beginning and 123.0MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4335.62ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 122.3MB in the beginning and 130.1MB in the end (delta: -7.8MB). Peak memory consumption was 32.3MB. Max. memory is 16.1GB. * Witness Printer took 8.35ms. Allocated memory is still 243.3MB. Free memory was 130.1MB in the beginning and 130.0MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 62. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] unsigned char var_1_7 = 0; [L24] double var_1_8 = 15.6; [L25] double var_1_9 = 15.4; [L26] double var_1_10 = 32.2; [L27] unsigned char var_1_12 = 1; [L28] signed short int var_1_13 = 256; [L29] float var_1_14 = 5.75; [L30] float var_1_15 = 8.6; [L31] unsigned char last_1_var_1_7 = 0; [L32] signed short int last_1_var_1_13 = 256; VAL [isInitial=0, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_8=78/5, var_1_9=77/5] [L84] isInitial = 1 [L85] FCALL initially() [L86] COND TRUE 1 [L87] CALL updateLastVariables() [L76] last_1_var_1_7 = var_1_7 [L77] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_8=78/5, var_1_9=77/5] [L87] RET updateLastVariables() [L88] CALL updateVariables() [L61] var_1_8 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L62] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0, var_1_9=77/5] [L63] var_1_9 = __VERIFIER_nondet_double() [L64] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L64] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_10=161/5, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L65] var_1_10 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L66] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L67] var_1_12 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L68] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L69] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L69] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_14=23/4, var_1_15=43/5, var_1_1=32, var_1_7=0] [L70] var_1_14 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L71] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_15=43/5, var_1_1=32, var_1_7=0] [L72] var_1_15 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L73] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L88] RET updateVariables() [L89] CALL step() [L36] COND TRUE (last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L37] COND FALSE !(last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L45] COND TRUE \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=256, var_1_1=32, var_1_7=0] [L46] COND TRUE (var_1_14 - var_1_15) >= ((var_1_8 + var_1_10) + var_1_9) [L47] var_1_13 = ((((var_1_1) > (var_1_1)) ? (var_1_1) : (var_1_1))) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L52] COND TRUE ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) <= var_1_10 VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L53] COND FALSE !(last_1_var_1_7 && (var_1_1 >= var_1_1)) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L89] RET step() [L90] CALL, EXPR property() [L80-L81] return ((((last_1_var_1_13 + ((((last_1_var_1_13) > (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))) < (last_1_var_1_13 * last_1_var_1_13)) ? ((last_1_var_1_13 < (last_1_var_1_13 - last_1_var_1_13)) ? ((last_1_var_1_13 != (((((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) < 0 ) ? -((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13))) : ((((last_1_var_1_13) < (last_1_var_1_13)) ? (last_1_var_1_13) : (last_1_var_1_13)))))) ? (var_1_1 == ((unsigned short int) last_1_var_1_13)) : 1) : 1) : (var_1_1 == ((unsigned short int) last_1_var_1_13))) && ((((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) <= var_1_10) ? ((last_1_var_1_7 && (var_1_1 >= var_1_1)) ? (var_1_7 == ((unsigned char) 0)) : 1) : (var_1_7 == ((unsigned char) var_1_12)))) && (var_1_12 ? (((var_1_14 - var_1_15) >= ((var_1_8 + var_1_10) + var_1_9)) ? (var_1_13 == ((signed short int) ((((var_1_1) > (var_1_1)) ? (var_1_1) : (var_1_1))))) : (var_1_13 == ((signed short int) var_1_1))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L90] RET, EXPR property() [L90] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=256, last_1_var_1_7=0, var_1_12=1, var_1_13=32, var_1_1=32, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 60 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 5, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 367 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 367 mSDsluCounter, 972 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 769 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 394 IncrementalHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 203 mSDtfsCounter, 394 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168occurred in iteration=4, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 199 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 381 NumberOfCodeBlocks, 381 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 264 ConstructedInterpolants, 0 QuantifiedInterpolants, 964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 408/420 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:33:55,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.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 4557fd955b08b5fada9f3a6efa621afd9324a377fdc4d7b9e90703dc668aa740 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 13:33:57,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 13:33:57,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 13:33:58,001 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 13:33:58,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 13:33:58,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 13:33:58,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 13:33:58,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 13:33:58,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 13:33:58,025 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 13:33:58,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 13:33:58,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 13:33:58,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 13:33:58,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 13:33:58,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 13:33:58,026 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 13:33:58,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:33:58,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 13:33:58,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 13:33:58,029 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 -> 4557fd955b08b5fada9f3a6efa621afd9324a377fdc4d7b9e90703dc668aa740 [2025-03-08 13:33:58,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 13:33:58,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 13:33:58,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 13:33:58,298 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 13:33:58,299 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 13:33:58,300 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-21.i [2025-03-08 13:33:59,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a5d68d72/9d15af925ec749d1a4a5dfab02d9b2b1/FLAG37dee4339 [2025-03-08 13:33:59,664 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 13:33:59,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-21.i [2025-03-08 13:33:59,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a5d68d72/9d15af925ec749d1a4a5dfab02d9b2b1/FLAG37dee4339 [2025-03-08 13:33:59,684 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a5d68d72/9d15af925ec749d1a4a5dfab02d9b2b1 [2025-03-08 13:33:59,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 13:33:59,688 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 13:33:59,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 13:33:59,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 13:33:59,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 13:33:59,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,695 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bf22205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59, skipping insertion in model container [2025-03-08 13:33:59,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 13:33:59,807 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-21.i[917,930] [2025-03-08 13:33:59,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:33:59,866 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 13:33:59,877 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-21.i[917,930] [2025-03-08 13:33:59,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 13:33:59,901 INFO L204 MainTranslator]: Completed translation [2025-03-08 13:33:59,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59 WrapperNode [2025-03-08 13:33:59,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 13:33:59,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 13:33:59,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 13:33:59,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 13:33:59,908 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:33:59" (1/1) ... [2025-03-08 13:33:59,920 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:33:59" (1/1) ... [2025-03-08 13:33:59,942 INFO L138 Inliner]: procedures = 27, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 82 [2025-03-08 13:33:59,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 13:33:59,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 13:33:59,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 13:33:59,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 13:33:59,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,967 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:33:59,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,975 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,977 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 13:33:59,980 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 13:33:59,980 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 13:33:59,980 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 13:33:59,981 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59" (1/1) ... [2025-03-08 13:33:59,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 13:33:59,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 13:34:00,011 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:34:00,014 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:34:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 13:34:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 13:34:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 13:34:00,033 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 13:34:00,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 13:34:00,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 13:34:00,093 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 13:34:00,096 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 13:34:05,260 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 13:34:05,261 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 13:34:05,267 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 13:34:05,268 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 13:34:05,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:05 BoogieIcfgContainer [2025-03-08 13:34:05,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 13:34:05,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 13:34:05,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 13:34:05,275 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 13:34:05,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:33:59" (1/3) ... [2025-03-08 13:34:05,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d939747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:05, skipping insertion in model container [2025-03-08 13:34:05,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:33:59" (2/3) ... [2025-03-08 13:34:05,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d939747 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:34:05, skipping insertion in model container [2025-03-08 13:34:05,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:34:05" (3/3) ... [2025-03-08 13:34:05,278 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-21.i [2025-03-08 13:34:05,289 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 13:34:05,290 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_has-floats_file-21.i that has 2 procedures, 38 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 13:34:05,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 13:34:05,337 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;@3c87c4be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 13:34:05,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 13:34:05,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 13:34:05,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 13:34:05,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:05,345 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:05,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:05,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:05,348 INFO L85 PathProgramCache]: Analyzing trace with hash -651377664, now seen corresponding path program 1 times [2025-03-08 13:34:05,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:05,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932889889] [2025-03-08 13:34:05,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:05,356 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:34:05,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:05,358 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:34:05,360 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:34:05,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 13:34:05,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 13:34:05,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:05,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:05,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 13:34:05,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-08 13:34:05,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:34:05,528 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:34:05,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932889889] [2025-03-08 13:34:05,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932889889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:34:05,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:34:05,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 13:34:05,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327981541] [2025-03-08 13:34:05,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:34:05,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 13:34:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:34:05,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 13:34:05,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 13:34:05,549 INFO L87 Difference]: Start difference. First operand has 38 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 13:34:05,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:05,561 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2025-03-08 13:34:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 13:34:05,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2025-03-08 13:34:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:05,567 INFO L225 Difference]: With dead ends: 70 [2025-03-08 13:34:05,567 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 13:34:05,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 52 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:34:05,571 INFO L435 NwaCegarLoop]: 48 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, 48 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:34:05,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 13:34:05,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 13:34:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-08 13:34:05,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 13:34:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2025-03-08 13:34:05,598 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 53 [2025-03-08 13:34:05,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:05,598 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2025-03-08 13:34:05,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 13:34:05,599 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2025-03-08 13:34:05,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 13:34:05,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:05,600 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:05,608 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:34:05,801 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:34:05,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:05,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:05,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1198733311, now seen corresponding path program 1 times [2025-03-08 13:34:05,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:05,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160703705] [2025-03-08 13:34:05,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:05,803 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:34:05,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:05,805 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:34:05,806 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:34:05,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 13:34:05,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 13:34:05,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:05,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:05,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 13:34:05,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:06,186 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 13:34:06,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 13:34:06,187 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:34:06,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160703705] [2025-03-08 13:34:06,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160703705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 13:34:06,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 13:34:06,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 13:34:06,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546299693] [2025-03-08 13:34:06,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 13:34:06,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 13:34:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:34:06,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 13:34:06,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 13:34:06,189 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 13:34:10,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:11,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:14,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:16,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:18,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:18,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:18,058 INFO L93 Difference]: Finished difference Result 107 states and 147 transitions. [2025-03-08 13:34:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 13:34:18,079 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 53 [2025-03-08 13:34:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:18,080 INFO L225 Difference]: With dead ends: 107 [2025-03-08 13:34:18,080 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 13:34:18,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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:34:18,081 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 53 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 16 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:18,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 122 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 11.8s Time] [2025-03-08 13:34:18,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 13:34:18,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2025-03-08 13:34:18,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 13:34:18,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2025-03-08 13:34:18,093 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 53 [2025-03-08 13:34:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:18,093 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2025-03-08 13:34:18,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-08 13:34:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2025-03-08 13:34:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 13:34:18,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:18,095 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:18,105 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:34:18,295 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:34:18,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:18,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:18,296 INFO L85 PathProgramCache]: Analyzing trace with hash -350137401, now seen corresponding path program 1 times [2025-03-08 13:34:18,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:18,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [257940111] [2025-03-08 13:34:18,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:18,297 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:34:18,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:18,299 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:34:18,301 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:34:18,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-08 13:34:18,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 13:34:18,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:18,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:18,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 13:34:18,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 13:34:18,522 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 48 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 13:34:18,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 13:34:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-08 13:34:18,712 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 13:34:18,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [257940111] [2025-03-08 13:34:18,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [257940111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 13:34:18,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 13:34:18,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 13:34:18,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010968886] [2025-03-08 13:34:18,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 13:34:18,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 13:34:18,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 13:34:18,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 13:34:18,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 13:34:18,713 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 13:34:22,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 13:34:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 13:34:22,534 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2025-03-08 13:34:22,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 13:34:22,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 54 [2025-03-08 13:34:22,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 13:34:22,556 INFO L225 Difference]: With dead ends: 125 [2025-03-08 13:34:22,556 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 13:34:22,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-08 13:34:22,557 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-08 13:34:22,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 91 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-08 13:34:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 13:34:22,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-03-08 13:34:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 13:34:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2025-03-08 13:34:22,567 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 54 [2025-03-08 13:34:22,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 13:34:22,569 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2025-03-08 13:34:22,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-08 13:34:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2025-03-08 13:34:22,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-08 13:34:22,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 13:34:22,570 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:22,576 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 (4)] Ended with exit code 0 [2025-03-08 13:34:22,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:34:22,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 13:34:22,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 13:34:22,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1203229182, now seen corresponding path program 1 times [2025-03-08 13:34:22,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 13:34:22,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156635069] [2025-03-08 13:34:22,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 13:34:22,772 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:34:22,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 13:34:22,774 INFO L229 MonitoredProcess]: Starting monitored process 5 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:34:22,775 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 (5)] Waiting until timeout for monitored process [2025-03-08 13:34:22,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 13:34:22,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 13:34:22,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 13:34:22,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 13:34:23,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 13:34:23,003 INFO L279 TraceCheckSpWp]: Computing forward predicates...